|
Search: id:A053346
|
|
|
| A053346 |
|
a(n) = solution to the postage stamp problem with 7 denominations and n stamps. |
|
+0
20
|
| |
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
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
|
M. F. Challis, Two new techniques for computing extremal h-bases A_kComp. J. 36(2) (1993) 117-126
Erich Friedman, Postage stamp problem
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: A024001 A068601 A006325 this_sequence A027964 A078501 A027937
Adjacent sequences: A053343 A053344 A053345 this_sequence A053347 A053348 A053349
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, Jun 20 2003
|
|
EXTENSIONS
|
Added a(9) from Challis. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 01 2006
Entry improved by comments from John Seldon (johnseldon(AT)onetel.com), Sep 15 2004
|
|
|
Search completed in 0.002 seconds
|
