OFFSET
0,3
COMMENTS
Analog to Euler's identity: Product_{n>=1} (1+x^n) = Product_{n>=1} 1/(1-x^(2*n-1)), which is the g.f. for the number of partitions into distinct parts.
LINKS
Eric Weisstein's World of Mathematics, Euler Identity.
FORMULA
EXAMPLE
G.f.: A(x) = 1 + x + 2*x^2 + 7*x^3 + 9*x^4 + 27*x^5 + 53*x^6 +...
where A(x) = (1+x-x^2) * (1+3*x^2+x^4) * (1+4*x^3-x^6) * (1+7*x^4+x^8) * (1+11*x^5-x^10) * (1+18*x^6+x^12) *...* (1 + Lucas(n)*x^n + (-1)^n*x^(2*n)) *...
and 1/A(x) = (1-x-x^2) * (1-4*x^3-x^6) * (1-11*x^5-x^10) * (1-29*x^7-x^14) * (1-76*x^9-x^18) * (1-199*x^11-x^22) *...* (1 - Lucas(2*n-1)*x^(2*n-1) + (-1)^n*x^(4*n-2)) *...
Also, the logarithm of the g.f. equals the series:
log(A(x)) = x + 1*3*x^2/2 + 4*4*x^3/3 + 1*7*x^4/4 + 6*11*x^5/5 + 4*18*x^6/6 + 8*29*x^7/7 + 1*47*x^8/8 +...+ A000593(n)*Lucas(n)*x^n/n +...
MATHEMATICA
max = 40; s = Product[1 + LucasL[n]*x^n + (-1)^n*x^(2*n), {n, 1, max}] + O[x]^max; CoefficientList[s, x] (* Jean-François Alcover, Dec 14 2015 *)
PROG
(PARI) /* Subroutine used in PARI programs below: */
{Lucas(n)=fibonacci(n-1)+fibonacci(n+1)}
(PARI) {a(n)=polcoeff(prod(k=1, n, 1+Lucas(k)*x^k+(-1)^k*x^(2*k) +x*O(x^n)), n)}
(PARI) {a(n)=polcoeff(1/prod(k=1, n, 1-Lucas(2*k-1)*x^(2*k-1)-x^(4*k-2) +x*O(x^n)), n)}
(PARI) /* Exponential form using sum of odd divisors of n: */
{A000593(n)=if(n<1, 0, sumdiv(n, d, (-1)^(d+1)*n/d))}
{a(n)=polcoeff(exp(sum(k=1, n, A000593(k)*Lucas(k)*x^k/k)+x*O(x^n)), n)}
CROSSREFS
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Jan 11 2012
STATUS
approved