Let a_1 = 1 and define a_(n + 1) to be the least integer greater than a_n which cannot be written as the sum of at most h>=2 addends among the terms a_1, a_2, ..., a_n. This defines the h-Stöhr sequence. The first few of these are given in the following table. h | OEIS | h-Stöhr sequence 2 | A033627 | 1, 2, 4, 7, 10, 13, 16, 19, 22, 25, ... 3 | A026474 | 1, 2, 4, 8, 15, 22, 29, 36, 43, 50, ... 4 | A051039 | 1, 2, 4, 8, 16, 31, 46, 61, 76, 91, ... 5 | A051040 | 1, 2, 4, 8, 16, 32, 63, 94, 125, 156, ...

greedy algorithm | integer relation | postage stamp problem | s-additive sequence | subset sum problem | sum-free set | Ulam sequence