OFFSET
0,2
COMMENTS
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..1000
FORMULA
G.f.: 1 - 5*Sum_{n>=1} Fibonacci(n)*L(n,5)*n*x^n / (1 - Lucas(n)*x^n + (-1)^n*x^(2*n)), where L(n,5) is the Legendre symbol and Lucas(n) = A000204(n).
EXAMPLE
G.f.: A(x) = 1 - 5*x + 5*x^2 + 20*x^3 - 45*x^4 - 25*x^5 - 80*x^6 + 390*x^7 +...
where A(x) = 1 - 1*5*x + 1*5*x^2 + 2*10*x^3 - 3*15*x^4 - 5*5*x^5 - 8*10*x^6 + 13*30*x^7 + 21*25*x^8 +...+ Fibonacci(n)*A109064(n)*x^n +...
The g.f. is illustrated by:
A(x) = 1 - 5*(+1)*1*1*x/(1-x-x^2) - 5*(-1)*2*1*x^2/(1-3*x^2+x^4) - 5*(-1)*3*2*x^3/(1-4*x^3-x^6) - 5*(+1)*4*3*x^4/(1-7*x^4+x^8) - 5*(0)*5*5*x^5/(1-11*x^5-x^10) - 5*(+1)*6*8*x^6/(1-18*x^6+x^12) +...
The values of the Legendre symbol L(n,5) repeat: [1,-1,-1,1,0, ...].
MATHEMATICA
QP = QPochhammer; a[0] = 1; a[n_] := Fibonacci[n] * SeriesCoefficient[ QP[q]^5 / QP[q^5], {q, 0, n}]; Table[a[n], {n, 0, 40}] (* Jean-François Alcover, Apr 26 2017 *)
PROG
CROSSREFS
KEYWORD
sign
AUTHOR
Paul D. Hanna, Feb 01 2012
STATUS
approved