%I #92 Aug 22 2022 10:08:14
%S 1,-1,0,-1,1,-1,1,-1,2,-2,2,-2,3,-3,3,-4,5,-5,5,-6,7,-8,8,-9,11,-12,
%T 12,-14,16,-17,18,-20,23,-25,26,-29,33,-35,37,-41,46,-49,52,-57,63,
%U -68,72,-78,87,-93,98,-107,117,-125,133,-144,157,-168,178,-192,209,-223,236,-255,276,-294,312,-335,361,-385
%N Expansion of q^(1/24) * eta(q) / eta(q^2) in powers of q.
%C Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
%C (Number of partitions of n into an even number of parts) - (number of partitions of n into an odd number of parts). [Fine]
%C Number 3 of the 130 identities listed in Slater 1952. - _Michael Somos_, Aug 20 2015
%D B. C. Berndt, Ramanujan's Notebooks Part IV, Springer-Verlag, see p. 425, Corollary 1, Eqs. (37)-(40).
%D N. J. Fine, Basic Hypergeometric Series and Applications, Amer. Math. Soc., 1988; p. 38, Eq. (22.14).
%H Seiichi Manyama, <a href="/A081362/b081362.txt">Table of n, a(n) for n = 0..10000</a> (terms 0..5000 from Vaclav Kotesovec)
%H Blecher, Aubrey; Brennan, Charlotte; Knopfmacher, Arnold; Mansour, Toufik <a href="https://doi.org/10.1007/s11139-014-9666-4">Counting corners in partitions</a>. Ramanujan J. 39, No. 1, 201-224 (2016).
%H J. Fulman, <a href="http://dx.doi.org/10.1090/S0273-0979-01-00920-X">Random matrix theory over finite fields</a>, Bull. Amer. Math. Soc. (N.S.), 39 (2002), no. 1, 51--85. MR1864086 (2002i:60012). See top of page 70, Eq. 3, with k=0. - _N. J. A. Sloane_, Aug 31 2014
%H Vaclav Kotesovec, <a href="http://arxiv.org/abs/1509.08708">A method of finding the asymptotics of q-series based on the convolution of generating functions</a>, arXiv:1509.08708 [math.CO], Sep 30 2015, p. 13.
%H Mircea Merca, <a href="http://dx.doi.org/10.1016/j.jnt.2015.08.014">Combinatorial interpretations of a recent convolution for the number of divisors of a positive integer</a>, Journal of Number Theory, Volume 160, March 2016, Pages 60-75, function p_{e-o}(n).
%H Lucy Joan Slater, <a href="http://plms.oxfordjournals.org/content/s2-54/1/147.extract">Further Identities of the Rogers-Ramanujan Type</a>, Proc. London Math. Soc., Series 2, vol.s2-54, no.2, pp.147-167, (1952).
%H Michael Somos, <a href="/A010815/a010815.txt">Introduction to Ramanujan theta functions</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/RamanujanThetaFunctions.html">Ramanujan Theta Functions</a>
%F G.f.: Product_{k>0} (1 - x^(2*k-1)) = Product_{k>0} 1 / (1 + x^k) = 1 + Sum_{k>0} (-x)^k / (Product_{i=1..k} (1 - x^i)).
%F a(n) = A027187(n)-A027193(n). [Fine]
%F This is the convolution inverse of A000009 (partitions into distinct parts) - i.e. the negation of the INVERTi transform of A000009. - _Franklin T. Adams-Watters_, Jan 06 2006
%F Expansion of chi(-x) = chi(-x^2) / chi(x) = phi(-x) / f(-x) = phi(-x^2) / f(x) = psi(-x) / f(-x^4) = f(-x) / f(-x^2) = f(-x^2) / psi(x) in powers of x where chi(), psi(), phi(), f() are Ramanujan theta functions.
%F Expansion of chi(x) * chi(-x) = f(x) / psi(x) = f(-x) / psi(-x) in powers of x^2 where chi(), psi(), f() are Ramanujan theta functions.
%F Expansion of f(-x, -x^5) / psi(x^3) = phi(-x^3) / f(x, x^2) in powers of x where phi(), psi(), f() are Ramanujan theta functions. - _Michael Somos_, Jun 03 2015
%F Given g.f. A(x), then B(q) = A(q^3)^8 / q satisfies 0 = f(B(q), B(q^2)) where f(u, v) = u^2*v + 16*u - v^2.
%F G.f. A(x) satisfies A(x^2) = A(x) * A(-x).
%F G.f. is a period 1 Fourier series which satisfies f(-1 / (1152 t)) = 2^(1/2) g(t) where q = exp(2 Pi i t) and g() is the g.f. for A000009.
%F Euler transform of period 2 sequence [ -1, 0, ...].
%F Expansion of q^(1/24) * f1(t) in powers of q = exp(Pi i t) where f1() is a Weber function.
%F a(n) = (-1)^n * A000700(n). a(2*n) = A069910(n). a(2*n + 1) = - A069911(n).
%F a(n) ~ (-1)^n * exp(Pi*sqrt(n/6)) / (2*24^(1/4)*n^(3/4)). - _Vaclav Kotesovec_, Feb 25 2015
%F a(n) = Sum_{k = 0..n} (-1)^k*A072233(n,k). - _Peter Luschny_, Aug 03 2015
%F G.f.: Sum_{k>=0} (-1)^k * x^k^2 / (Product_{i=1..k} (1 - x^(2*i))). - _Michael Somos_, Aug 20 2015
%F Sum_{j>=0} a(n-A000217(j)) = 0 if n not in A152749, = (-1)^k if n is in A152749, n=k*(3*k-1). [Merca, Corollary 4.1] - _R. J. Mathar_, Jun 18 2016
%F a(n) = -(1/n)*Sum_{k=1..n} A000593(k)*a(n-k), a(0) = 1. - _Seiichi Manyama_, Mar 25 2017
%F G.f.: exp(Sum_{k>=1} (-1)^k*x^k/(k*(1 - x^k))). - _Ilya Gutkovskiy_, May 28 2018
%F G.f.: (1 - x) * Sum_{k >= 0} (-1)^k * x^(k*(k+2)) / (Product_{i = 1..k} (1 - x^(2*i))) = (1 - x)*(1 - x^3) * Sum_{k >= 0} (-1)^k * x^(k*(k+4)) / (Product_{i = 1..k} (1 - x^(2*i)))= (1 - x)*(1 - x^3)*(1 - x^5) *
%F Sum_{k >= 0} (-1)^k * x^(k*(k+6)) / (Product_{i = 1..k} (1 - x^(2*i))) = .... - _Peter Bala_, Jan 15 2021
%e G.f. = 1 - x - x^3 + x^4 - x^5 + x^6 - x^7 + 2*x^8 - 2*x^9 + 2*x^10 - 2*x^11 + ...
%e G.f. = 1/q - q^23 - q^71 + q^95 - q^119 + q^143 - q^167 + 2*q^191 - 2*q^215 + ...
%t a[ n_] := SeriesCoefficient[ Product[1 - x^k, {k, 1, n, 2}], {x, 0, n}];
%t a[ n_] := With[ {t = Log[q] / (2 Pi I)}, SeriesCoefficient[ q^(1/24) DedekindEta[t] / DedekindEta[2 t], {q, 0, n}]];
%t a[ n_] := SeriesCoefficient[ QHypergeometricPFQ[ {}, {}, x^2, x], {x, 0, n}]; (* _Michael Somos_, Jan 02 2015 *)
%t a[ n_] := SeriesCoefficient[ 1 / QPochhammer[ -x, x], {x, 0, n}]; (* _Michael Somos_, Jan 02 2015 *)
%t a[ n_] := SeriesCoefficient[ 1 / Product[ 1 + x^k, {k, n}], {x, 0, n}]; (* _Michael Somos_, Jan 02 2015 *)
%t a[ n_] := SeriesCoefficient[ QPochhammer[ x, x^2], {x, 0, n}]; (* _Michael Somos_, Jan 02 2015 *)
%t a[ n_] := SeriesCoefficient[ QHypergeometricPFQ[ {}, {-1}, x, -1] 2, {x, 0, n}]; (* _Michael Somos_, May 11 2015 *)
%t a[ n_] := With[ {m = InverseEllipticNomeQ @ q}, SeriesCoefficient[ (m / ( 1 - m)^2 / (16 q))^(-1/24), {q, 0, n}]]; (* _Michael Somos_, May 11 2015 *)
%o (PARI) {a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( eta(x + A) / eta(x^2 + A), n))};
%o (Sage)
%o from sage.combinat.partition import number_of_partitions_length
%o print([sum((-1)^k*number_of_partitions_length(n, k) for k in (0..n)) for n in (0..69)]) # _Peter Luschny_, Aug 03 2015
%Y Cf. A000009, A000700, A069910, A069911, A072233.
%K sign
%O 0,9
%A _Michael Somos_, Mar 18 2003