A005344 - OEIS

This site is supported by donations to The OEIS Foundation.

A005344

a(n) = solution to the postage stamp problem with n denominations and 9 stamps.
(Formerly M4615)

9, 34, 112, 326, 797, 1617 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,1`
	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 largest number obtainable without a break using the best set of stamps.`
	REFERENCES	`R. Alter and J. A. Barnett, A postage stamp problem, Amer. Math. Monthly, 87 (1980), 206-210.` `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.` `N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).`
	LINKS	`Erich Friedman, Postage stamp problem` `R. L. Graham and N. J. A. Sloane, On Additive Bases and Harmonious Graphs`
	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: A147691 A000441 A067989 * A050478 A204426 A154393` `Adjacent sequences: A005341 A005342 A005343 * A005345 A005346 A005347`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`
	EXTENSIONS	`Entry improved by comments from John Seldon (johnseldon(AT)onetel.com), Sep 15 2004`

Content is available under The OEIS End-User License Agreement .

Last modified February 15 04:23 EST 2012. Contains 205694 sequences.