Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001212
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A001212 a(n) = solution to the postage stamp problem with n denominations and 2 stamps.
(Formerly M1089 N0972)
+0
23
2, 4, 8, 12, 16, 20, 26, 32, 40, 46, 54, 64, 72, 80, 92, 104, 116, 128, 140, 152 (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.

a(20)=152: There is only one set of 20 denominations covering all sums through 152: {1, 3, 4, 5, 8, 14, 20, 26, 32, 38, 44, 50, 56, 62, 68, 71, 72, 73, 75, 76}. - Tim Peters (tim.one(AT)comcast.net), Oct 04 2006

REFERENCES

S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures}, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

R. Alter and J. A. Barnett, A postage stamp problem, Amer. Math. Monthly, 87 (1980), 206-210.

Gardner, M. The Sixth Book of Mathematical Games from Scientific American. Chicago, IL: University of Chicago Press, p. 115 (Coins of the Realm), 1984.

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.

W. F. Lunnon, A postage stamp problem. Comput. J. 12 (1969) 377-380.

LINKS

S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures}, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

Erich Friedman, Postage stamp problem

Eric Weisstein's World of Mathematics, Postage stamp problem

R. L. Graham and N. J. A. Sloane, On Additive Bases and Harmonious Graphs

M. F. Challis, Twonew techniques for computing extremal h-bases A_kComp J 36(2) (1993) 117-126

MAPLE

A001212:=2*(1+2*z**2+2*z+3*z**3+3*z**4+2*z**6)/(z-1)/(3*z**5-z**4+z**2-z-1); [Conjectured by S. Plouffe in his 1992 dissertation.]

CROSSREFS

Postage stamp sequences: A001208 A001209 A001210 A001211 A001212 A001213 A001214 A001215 A001216 A005342 A005343 A005344 A014616 A053346 A053348 A075060 A084192 A084193

Cf. A006638.

Sequence in context: A048166 A010066 A006638 this_sequence A118030 A047836 A070173

Adjacent sequences: A001209 A001210 A001211 this_sequence A001213 A001214 A001215

KEYWORD

nonn,nice

AUTHOR

njas

EXTENSIONS

Corrected a(17). Added a(18) and a(19) from Challis. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 01 2006

Entry improved by comments from John Seldon (johnseldon(AT)onetel.com), Sep 15 2004

a(20) from Tim Peters (tim.one(AT)comcast.net), Oct 04 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research