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.

A215044 a(n) = F(2*n)^5 with F=A000045 (Fibonacci numbers).

Original entry on oeis.org

0, 1, 243, 32768, 4084101, 503284375, 61917364224, 7615646045657, 936668172433707, 115202670521319424, 14168993617568728125, 1742671044798615789551, 214334370099947863277568, 26361384861716322814590193
Offset: 0

Views

Author

Wolfdieter Lang, Aug 31 2012

Keywords

Crossrefs

Cf. A000045, A056572, A215045 (odd part).

Programs

Formula

O.g.f.: x*(1 + 99*x + 416*x^2 + 99*x^3 + x^4)/((1-3*x+x^2)*(1-18*x+x^2)*(1-123*x+x^2)), (from the even part of the bisection of A056572).
a(n) = (5*F(4*n) - 4*F(8*n) + F(12*n))/(5^2*L(2*n)), with L=A000032 (Lucas). See the third row in the signed triangle A039598, called in a general comment S.
a(n) = (10*F(2*n) - 5*F(6*n) + F(10*n))/5^2, from the partial fraction decomposition of the o.g.f. - Wolfdieter Lang, Oct 11 2012