OFFSET
0,2
COMMENTS
Compare g.f. to the Lambert series of A008653: 1 + 12*Sum_{n>=1} Chi(n,3)*n*x^n/(1-x^n).
Here Chi(n,3) = principal Dirichlet character of n modulo 3.
LINKS
G. C. Greubel, Table of n, a(n) for n = 0..2500
FORMULA
G.f.: 1 + 12*Sum_{n>=1} Fibonacci(n)*Chi(n,3)*n*x^n/(1 - Lucas(n)*x^n + (-1)^n*x^(2*n)).
EXAMPLE
G.f.: A(x) = 1 + 12*x + 36*x^2 + 24*x^3 + 252*x^4 + 360*x^5 + 288*x^6 +...
where A(x) = 1 + 1*12*x + 1*36*x^2 + 2*12*x^3 + 3*84*x^4 + 5*72*x^5 + 8*36*x^6 +...+ Fibonacci(n)*A008653(n)*x^n +...
The g.f. is also given by the identity:
A(x) = 1 + 12*( 1*1*x/(1-x-x^2) + 1*2*x^2/(1-3*x^2+x^4) + 3*4*x^4/(1-7*x^4+x^8) + 5*5*x^5/(1-11*x^5-x^10) + 13*7*x^7/(1-29*x^7-x^14) + 21*8*x^8/(1-47*x^8-x^16) +...).
The values of the Dirichlet character Chi(n,3) repeat [1,1,0, ...].
MATHEMATICA
terms = 34; s = 1 + 12*Sum[Fibonacci[n]*KroneckerSymbol[n, 3]^2*n*(x^n/(1 - LucasL[n]*x^n + (-1)^n*x^(2*n))), {n, 1, terms}] + O[x]^terms; CoefficientList[s, x] (* Jean-François Alcover, Jul 05 2017 *)
b[n_] := If[n < 1, Boole[n == 0], 12 Sum[If[Mod[d, 3] > 0, d, 0], {d, Divisors@n}]]; Table[If[n == 0, 1, b[n]*Fibonacci[n]], {n, 0, 50}] (* G. C. Greubel, Jul 17 2018 *)
PROG
(PARI) {Lucas(n)=fibonacci(n-1)+fibonacci(n+1)}
{a(n)=polcoeff(1 + 12*sum(m=1, n, fibonacci(m)*kronecker(m, 3)^2*m*x^m/(1-Lucas(m)*x^m+(-1)^m*x^(2*m) +x*O(x^n))), n)}
for(n=0, 50, print1(a(n), ", "))
CROSSREFS
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Feb 04 2012
STATUS
approved