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.
Additional terms a(30) through a(67) are available on line at Challis and Robinson. - John P Robinson (john-robinson(AT)uiowa.edu), Feb 18 2010
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
Robert Price, Table of n, a(n) for n = 1..67
R. Alter and J. A. Barnett, A postage stamp problem, Amer. Math. Monthly, 87 (1980), 206-210.
M. F. Challis, Two new techniques for computing extremal h-bases A_k, Comp. J. 36(2) (1993) 117-126.
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]
Erich Friedman, Postage stamp problem
W. F. Lunnon, A postage stamp problem, Comput. J. 12 (1969) 377-380.
Eric Weisstein's World of Mathematics, Postage stamp problem
CROSSREFS
KEYWORD
nonn
AUTHOR
EXTENSIONS
Terms up to a(29) from Challis added by R. J. Mathar, Apr 01 2006
Entry improved by comments from John Seldon (johnseldon(AT)onetel.com), Sep 15 2004
a(30)-a(67) from Challis and Robinson added by Robert Price, Jul 19 2013
STATUS
approved