|
Search: id:A001209
|
|
|
| A001209 |
|
a(n) = solution to the postage stamp problem with 4 denominations and n stamps.
(Formerly M3432 N1568)
|
|
+0
20
|
|
| 4, 12, 24, 44, 71, 114, 165, 234, 326, 427, 547, 708, 873, 1094, 1383, 1650, 1935, 2304, 2782, 3324, 3812, 4368, 5130, 5892, 6745, 7880, 8913, 9919
(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.
Challis lists up to a(54) and provides recursions up to a(157). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 01 2006
|
|
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.
S. Mossige, Algorithms for Computing the h-Range of the Postage Stamp Problem, Math. Comp. 36 (1981) 575-582
|
|
LINKS
|
Erich Friedman, Postage stamp problem
Eric Weisstein's World of Mathematics, Postage stamp problem
M. F. Challis, Two new techniques for computing extremal h-bases A_kComp. J. 36(2) (1993) 117-126
|
|
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: A011887 A057305 A008195 this_sequence A128624 A132477 A102651
Adjacent sequences: A001206 A001207 A001208 this_sequence A001210 A001211 A001212
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
Entry improved by comments from John Seldon (johnseldon(AT)onetel.com), Sep 15 2004
Added a(15) to a(28) from Table 1 of Mossige reference. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 29 2006
|
|
|
Search completed in 0.002 seconds
|
