This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A005344 a(n) = solution to the postage stamp problem with n denominations and 9 stamps. (Formerly M4615) 20
 9, 34, 112, 326, 797, 1617, 3191 (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 and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). LINKS R. Alter and J. A. Barnett, A postage stamp problem, Amer. Math. Monthly, 87 (1980), 206-210. Erich Friedman, Postage stamp problem R. L. Graham and N. J. A. Sloane, On Additive Bases and Harmonious Graphs R. L. Graham and N. J. A. Sloane, On Additive Bases and Harmonious Graphs, SIAM J. Algebraic and Discrete Methods, 1 (1980), 382-404. W. F. Lunnon, A postage stamp problem, Comput. J. 12 (1969) 377-380. CROSSREFS Postage stamp sequences: A001208, A001209, A001210, A001211, A001212, A001213, A001214, A001215, A001216, A005342, A005343, A005344, A014616, A053346, A053348, A075060, A084192, A084193. Sequence in context: A002881 A268803 A250652 * A250763 A264678 A050478 Adjacent sequences:  A005341 A005342 A005343 * A005345 A005346 A005347 KEYWORD nonn,more AUTHOR EXTENSIONS Entry improved by comments from John Seldon (johnseldon(AT)onetel.com), Sep 15 2004 a(7) from Challis and Robinson by Robert Price, Jul 19 2013 STATUS approved

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

Last modified September 21 02:16 EDT 2018. Contains 315247 sequences. (Running on oeis4.)