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

10, 40, 146, 427, 1055, 2510, 5047

Offset

1,1

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.

Links

Table of n, a(n) for n=1..7.

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

M. F. Challis and J. P. Robinson, Some Extremal Postage Stamp Bases, J. Integer Seq., 13 (2010), Article 10.2.3. [From John P Robinson (john-robinson(AT)uiowa.edu), Feb 18 2010]

Erich Friedman, Postage stamp problem

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

Eric Weisstein's World of Mathematics, Postage stamp problem

Crossrefs

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

Sequence in context: A227056 A027981 A013977 * A279219 A002066 A061991

Adjacent sequences: A075057 A075058 A075059 * A075061 A075062 A075063

Keyword

nonn,more

Author

N. J. A. Sloane, Jun 20 2003

Extensions

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

a(7) from Challis and Robinson by John P Robinson (john-robinson(AT)uiowa.edu), Feb 18 2010

Status

approved