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.

A138590 a(n) = Fibonacci(9*n).

Original entry on oeis.org

0, 34, 2584, 196418, 14930352, 1134903170, 86267571272, 6557470319842, 498454011879264, 37889062373143906, 2880067194370816120, 218922995834555169026, 16641027750620563662096, 1264937032042997393488322, 96151855463018422468774568
Offset: 0

Views

Author

Zerinvary Lajos, May 13 2008

Keywords

Crossrefs

Programs

Formula

a(n) = 34*A049669(n). G.f.: -34*x / ( -1+76*x+x^2 ). - R. J. Mathar, Sep 30 2013
From Colin Barker, Apr 06 2017: (Start)
a(n) = ((-38 - 17*sqrt(5))^(-n)*(-1 + (-2889 - 1292*sqrt(5))^n)) / sqrt(5).
a(n) = 76*a(n-1) + a(n-2) for n > 1.
(End)