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.

A167616 a(n) = Fibonacci(n) - 5.

Original entry on oeis.org

0, 3, 8, 16, 29, 50, 84, 139, 228, 372, 605, 982, 1592, 2579, 4176, 6760, 10941, 17706, 28652, 46363, 75020, 121388, 196413, 317806, 514224, 832035, 1346264, 2178304, 3524573, 5702882, 9227460, 14930347, 24157812, 39088164, 63245981, 102334150
Offset: 5

Views

Author

N. J. A. Sloane, Jun 26 2010

Keywords

Crossrefs

Programs

Formula

a(n) = a(n-1) + a(n-2) + 5. - Zak Seidov, Jun 27 2010
a(5)=0, a(6)=3, a(7)=8, a(n) = 2*a(n-1) - a(n-3). - Harvey P. Dale, Dec 31 2011
G.f.: x^6*(3+2*x)/((1-x)*(1-x-x^2)). - L. Edson Jeffery, Mar 17 2013