Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054874
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054874 a(n) = 2^(sum of a(i) where i<n). +0
1
0, 1, 2, 8, 2048 (list; graph; listen)
OFFSET

0,3

COMMENT

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 this_sequence A057841 A135238 A133376

Adjacent sequences: A054871 A054872 A054873 this_sequence A054875 A054876 A054877

KEYWORD

easy,nonn

AUTHOR

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

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 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research