|
|
|
|
|
|
|
|
|
#14 by Russ Cox at Sat Apr 09 17:54:56 EDT 2011
|
|
| LINKS
|
M. F. Challis and J. P. Robinson, <a href="http://www.research.att.com/~njas/sequences/">="/">Some Extremal Postage Stamp Bases</a>, J. Integer Seq., 13 (2010), Article 10.2.3. [From John P Robinson (john-robinson(AT)uiowa.edu), Feb 18 2010]
|
|
|
|
|
Discussion
|
| Sat Apr 09
| 17:54
| OEIS Server: https://oeis.org/edit/global/5
|
|
|
|
|
|
|
#13 by N. J. A. Sloane at Tue Jun 01 03:00:00 EDT 2010
|
|
| DATA
|
8, 28, 89, 234, 512, 1045, 2001, 3485
|
|
| REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
| LINKS
|
M. F. Challis and J. P. Robinson, <a href="http://www.research.att.com/~njas/sequences/">Some Extremal Postage Stamp Bases</a>, J. Integer Seq., 13 (2010), Article 10.2.3. [From John P Robinson (john-robinson(AT)uiowa.edu), Feb 18 2010]
|
|
| KEYWORD
|
nonn,new
nonn
|
|
| EXTENSIONS
|
Added term a(8) from Challis and Robinson. John P Robinson (john-robinson(AT)uiowa.edu), Feb 18 2010
|
|
|
|
|
|
|
#12 by N. J. A. Sloane at Fri Feb 27 03:00:00 EST 2009
|
|
| KEYWORD
|
nonn,new
nonn
|
|
| AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
|
|
|
|
#11 by N. J. A. Sloane at Fri Feb 24 03:00:00 EST 2006
|
|
| COMMENTS
|
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 highestlargest number obtainable without a break using the best set of stamps.
|
|
| LINKS
|
R. L. Graham and N. J. A. Sloane, <a href="http://www.research.att.com/~njas/doc/RLG/073.pdf">On Additive Bases and Harmonious Graphs</a>
|
|
| KEYWORD
|
nonn,new
nonn
|
|
|
|
|
|
|
#10 by N. J. A. Sloane at Sun Feb 20 03:00:00 EST 2005
|
|
| COMMENTS
|
Lunnon defines "solution" to be the lowestsmallest value not obtainable by the best set of stamps. The solutions given are one lower than this, that is, the sequence gives the highest number obtainable without a break using the best set of stamps.
|
|
| KEYWORD
|
nonn,new
nonn
|
|
|
|
|
|
|
#9 by N. J. A. Sloane at Wed Sep 22 03:00:00 EDT 2004
|
|
|
|
|
|
|
|
#8 by N. J. A. Sloane at Sat Sep 13 03:00:00 EDT 2003
|
|
| NAME
|
Postage stamp problem with n denominations and 8 stamps.
|
|
| DATA
|
8, 28, 89, 234, 512, 1045, 2001
|
|
| REFERENCES
|
R. L. Graham and N. J. A. Sloane, On Additive Bases and Harmonious Graphs, SIAM J. Algebraic and Discrete Methods, 1 (1980), 382-404.
R. K. Guy, Unsolved Problems in Number Theory, C12.
|
|
| LINKS
|
Erich Friedman, <a href="http://www.stetson.edu/%7Eefriedma/mathmagic/0403.html">Postage stamp problem</a>
|
|
| KEYWORD
|
nonn,new
nonn
|
|
|
|
|
|
|
#7 by N. J. A. Sloane at Fri May 16 03:00:00 EDT 2003
|
|
| REFERENCES
|
Lunnon, W. F., A postage stamp problem. Comput. J. 12 (1969) 377-380.
W. F. Lunnon, A postage stamp problem. Comput. J. 12 (1969) 377-380.
|
|
| KEYWORD
|
nonn,new
nonn
|
|
|
|
|
|
|
#6 by N. J. A. Sloane at Sat Dec 11 03:00:00 EST 1999
|
|
| REFERENCES
|
Lunnon, W. F., A postage stamp problem. Comput. J. 12 (1969) 377-380.
CJN 12R. Alter 379and 69J. A. AMMBarnett, A 87postage 208stamp 80problem, Amer. Math. Monthly, 87 (1980), 206-210.
|
|
| KEYWORD
|
nonn,new
nonn
|
|
|
|
|
|
|
#5 by N. J. A. Sloane at Wed Dec 11 03:00:00 EST 1996
|
|
|
|
|
|
|
