Stöhr Sequence

Let $a_1=1$ and define $a_{n+1}$ to be the least Integer greater than $a_n$ for $n\geq k$ which cannot be written as the Sum of at most $h$ addends among the terms $a_1$, $a_2$, ..., $a_n$.

See also Greedy Algorithm, s-Additive Sequence, Ulam Sequence

References

Guy, R. K. Unsolved Problems in Number Theory, 2nd ed. New York: Springer-Verlag, p. 233, 1994.