OFFSET
1,1
REFERENCES
Arthur T. Benjamin and Jennifer J. Quinn, Proofs that really count: the art of combinatorial proof, M.A.A., 2003, id. 53.
LINKS
Matthew House, Table of n, a(n) for n = 1..2380
Index entries for linear recurrences with constant coefficients, signature (2,2,-1).
FORMULA
a(n) = 5 * A007598(n).
a(n) = Lucas(n)^2 - 4(-1)^n.
G.f.: x*(5-5*x) / ((1+x)*(1-3*x+x^2)).
a(n) = 2*a(n-1) + 2*a(n-2) - a(n-3) for n > 3. - Matthew House, Jan 13 2017
a(n) = ((3-sqrt(5))/2)^n + ((3+sqrt(5))/2)^n - 2*(-1)^n. - Colin Barker, Jan 14 2017
a(n) = 2*Fibonacci(2*n+1) - Fibonacci(2*n) - 2*(-1)^n. - Vincenzo Librandi, Sep 14 2017
a(n) = Lucas(2*n) - 2*(-1)^n. - Amiram Eldar, Jan 17 2022
MAPLE
MATHEMATICA
5*Fibonacci[Range[30]]^2 (* Harvey P. Dale, Feb 24 2015 *)
LinearRecurrence[{2, 2, -1}, {5, 5, 20}, 30] (* Vincenzo Librandi, Sep 14 2017 *)
PROG
(PARI) a(n) = 5*fibonacci(n)^2; \\ Michel Marcus, Jan 14 2017
(PARI) Vec(x*(5-5*x) / ((1+x)*(1-3*x+x^2)) + O(x^40)) \\ Colin Barker, Jan 14 2017
(Magma) [5*Fibonacci(n)^2: n in [1..30]]; // Vincenzo Librandi, Sep 14 2017
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Ralf Stephan, Nov 01 2004
STATUS
approved