OFFSET
0,1
COMMENTS
a(0) = 2 assuming 0^0 = 1, or using the limit for n -> 0 (assuming n is a real variable); the same value for a(0) arises from other formulae for this sequence.
LINKS
Eric Weisstein's World of Mathematics, Lucas Polynomial
Wikipedia, Fibonacci polynomials
FORMULA
a(n) = 2^(1 - n) * Sum_{k=0..floor(n/2)} binomial(n, 2*k)*(4*n^2 + 1)^k.
a(n) = 2^(1 - n) * hypergeom([(1 - n)/2, -n/2], [1/2], 4*n^2 + 1).
For n > 0, a(n) = n^n * L_n(1/n), where L_n(x) is the Lucas polynomial.
For n > 0, a(n) = 2*(-i*n)^n*cos(n*arcsin(sqrt(4*n^2+1)/(2*n))). - Peter Luschny, Oct 14 2018
MATHEMATICA
Table[2^(1 - n) Hypergeometric2F1[(1 - n)/2, -n/2, 1/2, 4 n^2 + 1], {n, 0, 19}]
(* or *)
a[0] = Limit[n^n LucasL[n, 1/n], n -> 0]; (* a[0] = 2 *)
a[n_] := a[n] = n^n LucasL[n, 1/n];
Table[a[n], {n, 0, 19}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Vladimir Reshetnikov, Oct 14 2018
STATUS
approved