Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I M4615 #23 Aug 14 2020 13:46:29
%S 9,34,112,326,797,1617,3191
%N a(n) = solution to the postage stamp problem with n denominations and 9 stamps.
%C _Fred Lunnon_ [W. F. 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 R. K. Guy, Unsolved Problems in Number Theory, C12.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H R. Alter and J. A. Barnett, <a href="http://www.jstor.org/stable/2321610">A postage stamp problem</a>, Amer. Math. Monthly, 87 (1980), 206-210.
%H Erich Friedman, <a href="https://erich-friedman.github.io/mathmagic/0403.html">Postage stamp problem</a>
%H R. L. Graham and N. J. A. Sloane, <a href="http://neilsloane.com/doc/RLG/073.pdf">On Additive Bases and Harmonious Graphs</a>
%H R. L. Graham and N. J. A. Sloane, <a href="http://dx.doi.org/10.1137/0601045">On Additive Bases and Harmonious Graphs</a>, SIAM J. Algebraic and Discrete Methods, 1 (1980), 382-404.
%H W. F. Lunnon, <a href="https://doi.org/10.1093/comjnl/12.4.377">A postage stamp problem</a>, Comput. J. 12 (1969) 377-380.
%Y Postage stamp sequences: A001208, A001209, A001210, A001211, A001212, A001213, A001214, A001215, A001216, A005342, A005343, A005344, A014616, A053346, A053348, A075060, A084192, A084193.
%K nonn,more
%O 1,1
%A _N. J. A. Sloane_.
%E Entry improved by comments from John Seldon (johnseldon(AT)onetel.com), Sep 15 2004
%E a(7) from Challis and Robinson by _Robert Price_, Jul 19 2013