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.

A034797 a(0) = 0; a(n+1) = a(n) + 2^a(n).

Original entry on oeis.org

0, 1, 3, 11, 2059
Offset: 0

Views

Author

Joseph Shipman (shipman(AT)savera.com)

Keywords

Comments

First impartial game with value n, using natural enumeration of impartial games.
The natural 1-1 correspondence between nonnegative numbers and hereditarily finite sets is given by f(A)=sum over members m of A of 2^f(m). A set can be considered an impartial game where the legal moves are the members. The value of an impartial game is always an ordinal (for finite games, an integer).
The next term, a(5) = 2^2059 + 2059, has 620 decimal digits and is too large to include. - Olivier Gérard, Jun 26 2001
Positions of records in A103318. - N. J. A. Sloane and David Applegate, Mar 21 2005
The first n terms in this sequence form the lexicographically earliest n-vertex clique in the Ackermann-Rado encoding of the Rado graph (an infinite graph in which vertex i is adjacent to vertex j, with iDavid Eppstein, Aug 22 2014
This sequence was used by Spiro to bound the density of refactorable numbers (A033950). - David Eppstein, Aug 22 2014
For any positive integer m, a(1), a(2), ..., a(3^m) modulo 3^m form a complete residue set. - Yifan Xie, Aug 19 2025

References

  • J. H. Conway, On Numbers and Games, Academic Press.

Crossrefs

Programs