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.

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

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

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.

Erich Friedman, Postage stamp problem

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

M. F. Challis, Two new techniques for computing extremal h-bases A_kComp J 36(2) (1993) 117-126

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

Sequence in context: A097136 A049348 A145775 this_sequence A022812 A000293 A000294

Adjacent sequences: A001211 A001212 A001213 this_sequence A001215 A001216 A001217

nonn

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

Added a(10) from Challis. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 01 2006

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