Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007673
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007673 Coins needed for ApSimon's mints problem.
(Formerly M1109)
+0
1
1, 2, 4, 8, 15, 38, 74 (list; graph; listen)
OFFSET

1,2

REFERENCES

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

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

CROSSREFS

Sequence in context: A036661 A145671 A108693 this_sequence A026096 A098864 A002546

Adjacent sequences: A007670 A007671 A007672 this_sequence A007674 A007675 A007676

KEYWORD

hard,nonn,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Robert G. Wilson v (rgwv(AT)rgwv.com)

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research