login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A075060 a(n) = solution to the postage stamp problem with n denominations and 10 stamps. 19
10, 40, 146, 427, 1055, 2510, 5047 (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.
LINKS
R. Alter and J. A. Barnett, A postage stamp problem, Amer. Math. Monthly, 87 (1980), 206-210.
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
Sequence in context: A227056 A027981 A013977 * A279219 A002066 A061991
KEYWORD
nonn,more
AUTHOR
N. J. A. Sloane, Jun 20 2003
EXTENSIONS
Entry improved by comments from John Seldon (johnseldon(AT)onetel.com), Sep 15 2004
a(7) from Challis and Robinson by John P Robinson (john-robinson(AT)uiowa.edu), Feb 18 2010
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 13 02:50 EDT 2024. Contains 374265 sequences. (Running on oeis4.)