|
Search: id:A001210
|
|
|
| A001210 |
|
a(n) = solution to the postage stamp problem with 5 denominations and n stamps.
(Formerly M3864 N1707)
|
|
+0
20
|
|
| 5, 16, 36, 70, 126, 216, 345, 512, 797, 1055, 1475, 2047, 2659, 3403, 4422, 5629, 6865, 8669, 10835, 12903, 15785, 18801, 22456, 26469, 31108, 36949, 42744, 49436, 57033
(list; graph; listen)
|
|
|
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
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
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: A108966 A072333 A055232 this_sequence A128848 A022496 A041044
Adjacent sequences: A001207 A001208 A001209 this_sequence A001211 A001212 A001213
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
Added terms up to a(29) 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
|
