%I #15 Mar 31 2023 05:13:21
%S 1,0,0,1,1,1,0,2,2,1,1,3,3,2,2,5,6,3,5,8,9,7,8,13,14,10,14,19,20,17,
%T 20,29,30,26,32,42,45,41,47,63,64,60,70,88,91,87,99,124,128,123,143,
%U 172,179,176,200,240,246,246,279,325,337,338,381,440,456,461,519,590,615
%N Number of partitions of n into parts free of both odd squares and even numbers which are not squares, the odd parts they occur with a single multiplicity, there is no restriction on the even parts.
%H G. C. Greubel, <a href="/A100522/b100522.txt">Table of n, a(n) for n = 0..5000</a>
%H Noureddine Chair, <a href="http://arxiv.org/abs/hep-th/0409011">Partition Identities From Partial Supersymmetry</a>, arXiv:hep-th/0409011, 2004.
%F G.f.: Product_{k>0} (1+x^(2*k-1))/(1-(-1)^k*x^(k^2)).
%e a(16)=6 because 16 = 13+3 = 11+5 = 7+5+4 = 5+3+4+4 = 4+4+4+4.
%p series(product((1+x^(2*k-))/(1-(-1)^k*x^(k^2)),k=1..100),x=0,100);
%t With[{m=80}, CoefficientList[Series[Product[(1+x^(2*k-1))/(1-(-1)^k *x^(k^2)), {k,m+2}], {x,0,m}], x]] (* _G. C. Greubel_, Mar 28 2023 *)
%o (Magma)
%o m:=80;
%o f:= func< x | (&*[(1+x^(2*k-1))/(1-(-1)^k*x^(k^2)): k in [1..m+2]]) >;
%o R<x>:=PowerSeriesRing(Integers(), m);
%o Coefficients(R!( f(x) )); // _G. C. Greubel_, Mar 28 2023
%o (SageMath)
%o m=80
%o def f(x): return product( (1+x^(2*k-1))/(1-(-1)^k*x^(k^2)) for k in range(1,m+2))
%o def A100522_list(prec):
%o P.<x> = PowerSeriesRing(ZZ, prec)
%o return P( f(x) ).list()
%o A100522_list(m) # _G. C. Greubel_, Mar 28 2023
%Y Cf. A100926.
%K nonn
%O 0,8
%A _Noureddine Chair_, Nov 25 2004
%E Offset corrected by _G. C. Greubel_, Mar 28 2023