login
The OEIS is supported by the many generous donors 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; text; internal format)
OFFSET
0,3
COMMENTS
The next term is too large to include.
LINKS
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: A306241 A073630 A027733 * A174736 A324567 A135238
KEYWORD
easy,nonn
AUTHOR
Henry Bottomley, May 26 2000
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 24 18:44 EDT 2024. Contains 373688 sequences. (Running on oeis4.)