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.

A145510 a(n+1) = a(n)^2 + 2*a(n) - 2 and a(1)=10.

Original entry on oeis.org

10, 118, 14158, 200477278, 40191139395243838, 1615327685887921300502934267457918, 2609283532796026943395592527806764363779539144932833602430435810558
Offset: 1

Views

Author

Artur Jasinski, Oct 11 2008

Keywords

Comments

General formula for a(n+1)=a(n)^2+2*a(n)-2 and a(1)=k+1 is a(n)=Floor[((k + Sqrt[k^2 + 4])/2)^(2^((n+1) - 1))

Crossrefs

Programs

  • Mathematica
    aa = {}; k = 10; Do[AppendTo[aa, k]; k = k^2 + 2 k - 2, {n, 1, 10}]; aa
    (* or *)
    k =9; Table[Floor[((k + Sqrt[k^2 + 4])/2)^(2^(n - 1))], {n, 2, 7}] (*Artur Jasinski*)

Formula

From Peter Bala, Nov 12 2012: (Start)
a(n) = alpha^(2^(n-1)) + (1/alpha)^(2^(n-1)) - 1, where alpha := 1/2*(11 + sqrt(117)). a(n) = 1 (mod 9).
Recurrence: a(n) = 12*{Product_{k = 1..n-1} a(k)} - 2 with a(1) = 10.
Product {n = 1..inf} (1 + 1/a(n)) = 12/sqrt(117).
Product {n = 1..inf} (1 + 2/(a(n) + 1)) = sqrt(13/9).
(End)