The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A054874 a(n) = 2^(sum of a(i) where i
 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 Table of n, a(n) for n=0..4. 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 Adjacent sequences: A054871 A054872 A054873 * A054875 A054876 A054877 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.

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