1,1

Lunnon defines "solution" to be the smallest value not obtainable by the best set of stamps. The solutions given are one lower than this, that is, the sequence gives the largest number obtainable without a break using the best set of stamps.

R. Alter and J. A. Barnett, A postage stamp problem, Amer. Math. Monthly, 87 (1980), 206-210.

R. L. Graham and N. J. A. Sloane, On Additive Bases and Harmonious Graphs, SIAM J. Algebraic and Discrete Methods, 1 (1980), 382-404.

R. K. Guy, Unsolved Problems in Number Theory, C12.

W. F. Lunnon, A postage stamp problem. Comput. J. 12 (1969) 377-380.

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Erich Friedman, Postage stamp problem

R. L. Graham and N. J. A. Sloane, On Additive Bases and Harmonious Graphs

Eric Weisstein's World of Mathematics, Postage stamp problem

Postage stamp sequences: A001208 A001209 A001210 A001211 A001212 A001213 A001214 A001215 A001216 A005342 A005343 A005344 A014616 A053346 A053348 A075060 A084192 A084193

Sequence in context: A067317 A141354 A131753 this_sequence A114221 A144643 A034757

Adjacent sequences: A001210 A001211 A001212 this_sequence A001214 A001215 A001216

nonn,new

N. J. A. Sloane (njas(AT)research.att.com).

Entry improved by comments from John Seldon (johnseldon(AT)onetel.com), Sep 15 2004

More terms from Al Zimmermann (alzimmerma(AT)aol.com), Feb 20 2002

Further terms from Friedman web site, Jun 20, 2003

Removed a(17), as it was incorrect. Al Zimmermann (alzimmerma(AT)aol.com), Nov 08 2009