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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A054874 a(n) = 2^(sum of a(i) where i<n). 1
0, 1, 2, 8, 2048 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

The next term is too large to include.

FORMULA

a(n) = 2^A034797(n-1) = A034797(n) - A034797(n-1)

EXAMPLE

a(4) = 2^(0+1+2+8) = 2^11 = 2048; a(5) = 2^2059>10^619

CROSSREFS

Cf. A014221, A034797 for partial sum, so a(n) is number of impartial games with value n-1, using natural enumeration of impartial games.

Sequence in context: A121015 A073630 A027733 * A174736 A135238 A133376

Adjacent sequences:  A054871 A054872 A054873 * A054875 A054876 A054877

KEYWORD

easy,nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), May 26 2000

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

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

Last modified February 17 21:13 EST 2012. Contains 206085 sequences.