%I A005343 M4505
%S A005343 8,28,89,234,512,1045,2001
%N A005343 a(n) = solution to the postage stamp problem with n denominations and 
               8 stamps.
%C A005343 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.
%D A005343 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A005343 R. Alter and J. A. Barnett, A postage stamp problem, Amer. Math. Monthly, 
               87 (1980), 206-210.
%D A005343 R. L. Graham and N. J. A. Sloane, On Additive Bases and Harmonious Graphs, 
               SIAM J. Algebraic and Discrete Methods, 1 (1980), 382-404.
%D A005343 R. K. Guy, Unsolved Problems in Number Theory, C12.
%D A005343 W. F. Lunnon, A postage stamp problem. Comput. J. 12 (1969) 377-380.
%H A005343 Erich Friedman, <a href="http://www.stetson.edu/%7Eefriedma/mathmagic/
               0403.html">Postage stamp problem</a>
%H A005343 R. L. Graham and N. J. A. Sloane, <a href="http://www.research.att.com/
               ~njas/doc/RLG/073.pdf">On Additive Bases and Harmonious Graphs</a>
%Y A005343 Postage stamp sequences: A001208 A001209 A001210 A001211 A001212 A001213 
               A001214 A001215 A001216 A005342 A005343 A005344 A014616 A053346 A053348 
               A075060 A084192 A084193
%Y A005343 Sequence in context: A102665 A134638 A130129 this_sequence A095857 A054114 
               A110687
%Y A005343 Adjacent sequences: A005340 A005341 A005342 this_sequence A005344 A005345 
               A005346
%K A005343 nonn
%O A005343 1,1
%A A005343 N. J. A. Sloane (njas(AT)research.att.com).
%E A005343 Entry improved by comments from John Seldon (johnseldon(AT)onetel.com), 
               Sep 15 2004