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.

A144787 Recurrence sequence a(n+1)=a(n)^3-a(n)+1 and a(1)=2.

Original entry on oeis.org

2, 7, 337, 38272417, 56060590716839257663297, 176186654453940966415101758343368831005891099500239113100063334235777
Offset: 1

Views

Author

Artur Jasinski, Sep 22 2008

Keywords

Comments

For constant c=1.240554576397679299452... see A144810.

Crossrefs

Programs

  • Mathematica
    a = {}; k = 2; Do[AppendTo[a, k]; k = k^3 - k + 1, {n, 1, 8}]; a (*Artur Jasinski*)
    NestList[#^3-#+1&,2,5] (* Harvey P. Dale, Jun 24 2013 *)