

A001215


a(n) is the solution to the postage stamp problem with n denominations and 5 stamps.
(Formerly M3845 N1706)


20



5, 14, 35, 71, 126, 211, 336, 524, 726, 1016, 1393, 1871, 2494, 3196, 4063, 5113, 6511, 7949, 9865, 11589
(list;
graph;
refs;
listen;
history;
text;
internal format)



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.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).


LINKS



CROSSREFS

Postage stamp sequences: A001208, A001209, A001210, A001211, A001212, A001213, A001214, A001215, A001216, A005342, A005343, A005344, A014616, A053346, A053348, A075060, A084192, A084193.
A row or column of the array A196416 (possibly with 1 subtracted from it).


KEYWORD

nonn,more


AUTHOR



EXTENSIONS

Entry improved by comments from John Seldon (johnseldon(AT)onetel.com), Sep 15 2004
a(10) from Challis and Robinson added by John P Robinson (johnrobinson(AT)uiowa.edu), Feb 18 2010
a(11)a(20) from Friedman added by Robert Price, Jul 19 2013


STATUS

approved



