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.

A134490 a(n) = Fibonacci(5n + 3).

Original entry on oeis.org

2, 21, 233, 2584, 28657, 317811, 3524578, 39088169, 433494437, 4807526976, 53316291173, 591286729879, 6557470319842, 72723460248141, 806515533049393, 8944394323791464, 99194853094755497, 1100087778366101931
Offset: 0

Views

Author

Artur Jasinski, Oct 28 2007

Keywords

Crossrefs

Programs

Formula

a(n) = 11a(n-1) + a(n-2). - Paul Curtz, May 07 2008
From R. J. Mathar, Nov 02 2008: (Start)
G.f.: (2-x)/(1 - 11x - x^2).
a(n) = |A122574(n+2)| + A049666(n+1). (End)
a(n) = A000045(A016885(n)). - Michel Marcus, Nov 08 2013

Extensions

Offset changed to 0 by R. J. Mathar, Jul 28 2008