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.

A276122 a(0) = a(1) = a(2) = 1; for n > 2, a(n) = (a(n-1)^2+a(n-2)^2+a(n-1)+a(n-2))/a(n-3).

Original entry on oeis.org

1, 1, 1, 4, 22, 526, 69427, 219111589, 91273561736491, 119994570874632853695766, 65713991236617279734602790963627271046, 47311933073383646516067037755547920981262829886906923065810924
Offset: 0

Views

Author

Bruno Langlois, Aug 21 2016

Keywords

Crossrefs

Programs

  • Mathematica
    RecurrenceTable[{a[n] == (a[n - 1]^2 + a[n - 2]^2 + a[n - 1] + a[n - 2])/a[n - 3], a[0] == a[1] == a[2] == 1}, a, {n, 0, 11}] (* Michael De Vlieger, Aug 21 2016 *)

Formula

a(n) = 6*a(n-1)*a(n-2)-a(n-3)-1.
a(n) ~ 1/6 * c^(phi^n), where c = 2.059783590102273... and phi = A001622 = (1+sqrt(5))/2 is the golden ratio. - Vaclav Kotesovec, Mar 20 2017

Extensions

a(10) corrected by Seiichi Manyama, Aug 21 2016