0,2

Number of partitions of n into an even number of distinct parts - partitions of n into an odd number of distinct parts, with 2 types of each part. E.g. for n=4, we consider k and k* to be different versions of k, and so we have 4, 4*, 31, 31*, 3*1, 3*1*, 22*, 211*, 2*11*. The even partitions number 5 and the odd partitions number 4, so a(4)=5-4=1 - Jon Perry (perry(AT)globalnet.co.uk), Apr 04 2004

Also, number of different partitions of n into parts of -2 different kinds (based upon formal analogy) - Michele Dondi (blazar(AT)lcm.mi.infn.it), Jun 29 2004

M. Boylan, Exceptional congruences for the coefficients of certain eta-product newforms, J. Number Theory 98 (2003), no. 2, 377-389.

J. W. L. Glaisher, On the square of Euler's series, Proc. London Math. Soc., 21 (1889), 182-194.

M. Koike, On McKay's conjecture, Nagoya Math. J., 95 (1984), 85-89.

T. D. Noe, Table of n, a(n) for n=0..1000

S. R. Finch, Powers of Euler's q-Series, (arXiv: math.NT/0701251).

Index entries for expansions of Product_{k >= 1} (1-x^k)^m

a(n)=b(12n+1) where b(n) is multiplicative and b(2^e) = b(3^e) = 0^e, b(p^e) = (1+(-1)^e)/2 if p == 7, 11 (mod 12), b(p^e) = (-1)^(e/2)(1+(-1)^e)/2 if p == 5 (mod 12), b(p^e) = (e+1)*(-1)^(e*x) if p == 1 (mod 12) and p = x^2+9y^2. - Michael Somos Sep 16 2006

(PARI) {a(n)=local(A, p, e, x); if(n<0, 0, n=12*n+1; A=factor(n); prod(k=1, matsize(A)[1], if(p=A[k, 1], e=A[k, 2]; if(p<5, 0, if(p%12>1, if(e%2, 0, (-1)^((p%12==5)*e/2)), for(i=1, sqrtint(p\9), if(issquare(p-9*i^2), x=i; break)); (e+1)*(-1)^(e*x))))))} /* Michael Somos Aug 30 2006 */

(PARI) {a(n)=if(n<0, 0, polcoeff( eta(x+x*O(x^n))^2, n))} /* Michael Somos Aug 30 2006 */

Cf. A000712 (reciprocal of g.f.).

Adjacent sequences: A002104 A002105 A002106 this_sequence A002108 A002109 A002110

Sequence in context: A020738 A063279 A124333 this_sequence A133099 A006571 A094781

sign,nice

njas