login
This site is supported by donations to The OEIS Foundation.

 

Logo

Many excellent designs for a new banner were submitted. We will use the best of them in rotation.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007673 Coins needed for ApSimon's mints problem.
(Formerly M1109)
0
1, 2, 4, 8, 15, 38, 74 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

R. K. Guy and R. Nowakowski, ApSimon's mints problem, Amer. Math. Monthly, 101 (1994), 358-359.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Table of n, a(n) for n=1..7.

CROSSREFS

Sequence in context: A036661 A145671 A108693 * A026096 A098864 A002546

Adjacent sequences:  A007670 A007671 A007672 * A007674 A007675 A007676

KEYWORD

hard,nonn,nice

AUTHOR

N. J. A. Sloane, Robert G. Wilson v

STATUS

approved

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

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

Last modified April 16 10:48 EDT 2014. Contains 240577 sequences.