A127595 a(n) = F(4n) - 2F(2n) where F(n) = Fibonacci numbers A000045.

0, 1, 15, 128, 945, 6655, 46080, 317057, 2176335, 14925184, 102320625, 701373311, 4807434240, 32951037313, 225850798095, 1548007091840, 10610205501105, 72723448842367, 498453982018560, 3416454544730369, 23416728143799375

Offset

0,3

Comments

a(n) is a divisibility sequence; that is, if h|k then a(h)|a(k).

Links

Michael De Vlieger, Table of n, a(n) for n = 0..1196

E. L. Roettger and H. C. Williams, Appearance of Primes in Fourth-Order Odd Divisibility Sequences, J. Int. Seq., Vol. 24 (2021), Article 21.7.5.

Hugh Williams and R. K. Guy, Some fourth-order linear divisibility sequences, Intl. J. Number Theory vol. 7 (5) (2011) 1255-1277.

H. C. Williams and R. K. Guy, Odd and even linear divisibility sequences of order 4, INTEGERS, 2015, #A33.

Index to divisibility sequences

Index entries for linear recurrences with constant coefficients, signature (10,-23,10,-1).

Formula

a(n) = F(2n)*(L(2n)-2) = A001906(n)*A004146(n), where L(n) are the Lucas numbers A000032.

a(2n) = 5*(F(2n))^3*L(2n), a(2n+1) = F(2n+1)*L(2n+1)^3.

a(n) = [(Phi^(2n))-1]^2*[(Phi^(4n))-1]/[sqrt(5)*(Phi^(4n))].

G.f.: A(x)=x*(1+(r+2)*x+x^2)/((1-r*x+x^2)*(1-(r^2-2)*x+x^2)) at r=3. The case r=2 is A000578.

a(n) = -a(-n) for all n in Z. - Michael Somos, Dec 30 2022

Example

G.f. = x + 15*x^2 + 128*x^3 + 945*x^4 + 6655*x^5 + ... - Michael Somos, Dec 30 2022

Mathematica

With[{r = 3}, CoefficientList[Series[x (1 + (r + 2) x + x^2)/((1 - r x + x^2)*(1 - (r^2 - 2)*x + x^2)), {x, 0, 20}], x]] (* Michael De Vlieger, Nov 09 2021 *)

Prog

(PARI) {a(n) = my(w = quadgen(5)^(2*n)); imag(w^2 - 2*w)}; /* Michael Somos, Dec 30 2022 */

Crossrefs

Cf. A000032, A000045, A001906, A004146.

Sequence in context: A198850 A283120 A209404 * A056579 A294054 A156922

Adjacent sequences: A127592 A127593 A127594 * A127596 A127597 A127598

Keyword

easy,nonn

Author

Peter Bala, Apr 10 2007

Status

approved