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.

A006485 a(n) = (2^(2^n + 1) + 1)/3.

Original entry on oeis.org

3, 11, 171, 43691, 2863311531, 12297829382473034411, 226854911280625642308916404954512140971, 77194726158210796949047323339125271902179989777093709359638389338608753093291
Offset: 1

Views

Author

Dennis S. Kluk (mathemagician(AT)ameritech.net)

Keywords

References

  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Programs

Formula

a(n) = A001045(2^n+1) = (3*a(n-1)^2 + 1)/2 - a(n-1). - Michael Somos, Mar 30 2020
a(n) = A070969(n)/3. - Alois P. Heinz, Mar 28 2023