Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A075060
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A075060 a(n) = solution to the postage stamp problem with n denominations and 10 stamps. +0
20
10, 40, 146, 427, 1055, 2510 (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.

REFERENCES

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

R. K. Guy, Unsolved Problems in Number Theory, C12.

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

LINKS

Erich Friedman, Postage stamp problem

Eric Weisstein's World of Mathematics, Postage stamp problem

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: A002419 A027981 A013977 this_sequence A002066 A061991 A060580

Adjacent sequences: A075057 A075058 A075059 this_sequence A075061 A075062 A075063

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jun 20 2003

EXTENSIONS

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

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 November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research