A005342 a(n) = solution to the postage stamp problem with n denominations and 7 stamps.

7, 23, 69, 165, 345, 664, 1137, 1911

Offset: 1

Author

N. J. A. Sloane

Keywords

• nonn
• more

Comments

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.

References

• R. K. Guy, Unsolved Problems in Number Theory, C12.
• N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Links

• R. Alter and J. A. Barnett, A postage stamp problem, Amer. Math. Monthly, 87 (1980), 206-210.
• Erich Friedman, Postage stamp problem
• R. L. Graham and N. J. A. Sloane, On Additive Bases and Harmonious Graphs
• R. L. Graham and N. J. A. Sloane, On Additive Bases and Harmonious Graphs, SIAM J. Algebraic and Discrete Methods, 1 (1980), 382-404.
• W. F. Lunnon, A postage stamp problem, Comput. J. 12 (1969) 377-380.

Crossrefs

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

Extensions

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

a(8) from Challis and Robinson by Robert Price, Jul 19 2013