OFFSET
1,2
COMMENTS
LINKS
Paolo Xausa, Table of n, a(n) for n = 1..2000
Index entries for linear recurrences with constant coefficients, signature (3,0,-3,1).
FORMULA
a(n) = Lucas(n)^2 for odd n, a(n) = Lucas(n)^2 - 2 for even n>0.
O.g.f.: x*(1+4*x-5*x^2+2*x^3)/((1-x^2)*(1-3*x+x^2)).
From Klaus Purath, Sep 15 2025: (Start)
a(n) = A047946(n) - 1.
a(n) = 3*a(n-1) - a(n-2) + 1 + 5*(-1)^n. (End)
EXAMPLE
G.f.: L(x) = x + 7*x^2/2 + 16*x^3/3 + 47*x^4/4 + 121*x^5/5 +...
exp(L(x)) = 1 + x + 2^2*x^2 + 3^2*x^3 + 5^2*x^4 + 8^2*x^5 +...
MATHEMATICA
LinearRecurrence[{3, 0, -3, 1}, {1, 7, 16, 47}, 30] (* Paolo Xausa, Sep 20 2025 *)
PROG
(PARI) {a(n)=(fibonacci(n-1)+fibonacci(n+1))^2-2*((n-1)%2)}
(PARI) {a(n)=polcoeff(deriv(log(sum(m=0, n, fibonacci(m)^2*x^m)+x*O(x^n))), n)}
(PARI) {a(n)=polcoeff(x*(1+4*x-5*x^2+2*x^3)/((1-x^2)*(1-3*x+x^2+x*O(x^n))), n)}
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Paul D. Hanna, Nov 24 2010
STATUS
approved
