Let and define to be the least Integer greater than for which cannot be written as the Sum of at most addends among the terms , , ..., .
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.