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.

A082585 a(1)=1, a(n) = ceiling(r(5)*a(n-1)) where r(5) = (1/2)*(5 + sqrt(29)) is the positive root of X^2 = 5*X + 1.

Original entry on oeis.org

1, 6, 32, 167, 868, 4508, 23409, 121554, 631180, 3277455, 17018456, 88369736, 458867137, 2382705422, 12372394248, 64244676663, 333595777564, 1732223564484, 8994713599985, 46705791564410, 242523671422036
Offset: 1

Views

Author

Benoit Cloitre, May 07 2003

Keywords

Crossrefs

Programs

Formula

For n > 3, a(n) = 6*a(n-1) - 4*a(n-2) - a(n-3); a(n) = floor(t(5)*r(5)^n) where t(5) = (1/10)*(1 + 7/sqrt(29)) is the positive root of 145*X^2 = 29*X + 1.
G.f.: x/((x-1)*(x^2+5*x-1)). - Colin Barker, Jan 27 2013
G.f.: 1/(1/Q(0) + 3*x^3 - 3*x) where Q(k) = 1 + k*(2*x+1) + 8*x - 2*x*(k+1)*(k+5)/Q(k+1) ; (continued fraction). - Sergei N. Gladkovskii, Mar 15 2013