cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A054874 a(n) = 2^(sum of a(i) where i

Original entry on oeis.org

0, 1, 2, 8, 2048
Offset: 0

Views

Author

Henry Bottomley, May 26 2000

Keywords

Comments

The next term is too large to include.

Examples

			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.

Formula

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