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.

A000659 a(n) = 2^a(n-1) + a(n-2).

Original entry on oeis.org

0, 0, 1, 2, 5, 34, 17179869189
Offset: 0

Views

Author

Keywords

Comments

The next term has 5171655948 digits. - Franklin T. Adams-Watters, Jul 03 2009

Crossrefs

Cf. A000643.

Programs