|
| |
|
|
A075060
|
|
a(n) = solution to the postage stamp problem with n denominations and 10 stamps.
|
|
20
| | |
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| 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. Alter and J. A. Barnett, A postage stamp problem, Amer. Math. Monthly, 87 (1980), 206-210.
R. K. Guy, Unsolved Problems in Number Theory, C12.
W. F. Lunnon, A postage stamp problem. Comput. J. 12 (1969) 377-380.
|
|
|
LINKS
| Erich Friedman, Postage stamp problem
Eric Weisstein's World of Mathematics, Postage stamp problem
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]
|
|
|
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: A199826 A027981 A013977 * A002066 A061991 A060580
Adjacent sequences: A075057 A075058 A075059 * A075061 A075062 A075063
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Jun 20 2003
|
|
|
EXTENSIONS
| Entry improved by comments from John Seldon (johnseldon(AT)onetel.com), Sep 15 2004
Added term a(7) from Challis and Robinson. John P Robinson (john-robinson(AT)uiowa.edu), Feb 18 2010
|
| |
|
|
