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.

A100011 a(n+1) = a(n)*((261*a(n)^3)-(504*a(n)^2)+(283*a(n))-38)/2 for n > 0, a(0) = 2.

Original entry on oeis.org

2, 600, 16858418928600, 10540904502382779165253193559218987587063928137089696600
Offset: 0

Views

Author

Jonathan Vos Post, Nov 16 2004

Keywords

Comments

The next term (a(4)) has 223 digits and a(5) has 891 digits. - Harvey P. Dale, Dec 22 2024

Crossrefs

Programs

  • Mathematica
    NestList[# (261 #^3 - 504 #^2 + 283 # - 38)/2 &, 2, 5] (* Harvey P. Dale, Dec 22 2024 *)