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.

A153873 a(n) = 9*Fibonacci(2n+1) - 1.

Original entry on oeis.org

8, 17, 44, 116, 305, 800, 2096, 5489, 14372, 37628, 98513, 257912, 675224, 1767761, 4628060, 12116420, 31721201, 83047184, 217420352, 569213873, 1490221268, 3901449932, 10214128529, 26740935656, 70008678440, 183285099665, 479846620556, 1256254762004, 3288917665457
Offset: 0

Views

Author

Paul Curtz, Jan 03 2009

Keywords

Programs

Formula

a(n) = 3*a(n-1) - a(n-2) + 1.
a(n) = 4*a(n-1) - 4*a(n-2) + a(n-3).
a(n) = 3*a(n-1) - 3*a(n-3) + a(n-4).
a(n) = 9*A001519(n+1) - 1.
G.f.: (8 - 15*x + 8*x^2)/((1-x)*(1-3*x+x^2)). - Jaume Oliver Lafont, Aug 30 2009