OFFSET
0,1
LINKS
Colin Barker, Table of n, a(n) for n = 0..700
Index entries for linear recurrences with constant coefficients, signature (17,17,-1).
FORMULA
a(n) = Fibonacci(6*n+3) - 2*Fibonacci(6*n) + 2*(-1)^n. - Ralf Stephan, May 14 2004
G.f.: 4*(-4*x^2-13*x+1)/((1+x)*(1-18*x+x^2)). - Ralf Stephan, May 14 2004
From Colin Barker, Mar 04 2016: (Start)
a(n) = 2*(-1)^n+(9+4*sqrt(5))^(-n)+(9+4*sqrt(5))^n.
a(n) = 17*a(n-1)+17*a(n-2)-a(n-3) for n>2. (End)
a(n) = A014448(n)^2. - Sean A. Irvine, Nov 18 2018
a(n) = 5*Fibonacci(3*n)^2 + 4*(-1)^n. - Amiram Eldar, Jan 11 2022
MATHEMATICA
(Table[LucasL@ n, {n, 0, 52}] /. n_ /; OddQ@ n -> Nothing)^2 (* Michael De Vlieger, Mar 04 2016 *)
LinearRecurrence[{17, 17, -1}, {4, 16, 324}, 20] (* Harvey P. Dale, Nov 19 2024 *)
PROG
(PARI) Vec(4*(1-13*x-4*x^2)/((1+x)*(1-18*x+x^2)) + O(x^20)) \\ Colin Barker, Mar 04 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
EXTENSIONS
More terms from Erich Friedman.
STATUS
approved