A133563 -id:A133563 - cp's OEIS frontend

A035959 Number of partitions of n in which no parts are multiples of 5.

1, 1, 2, 3, 5, 6, 10, 13, 19, 25, 34, 44, 60, 76, 100, 127, 164, 205, 262, 325, 409, 505, 628, 769, 950, 1156, 1414, 1713, 2081, 2505, 3026, 3625, 4352, 5192, 6200, 7364, 8756, 10357, 12258, 14450, 17034, 20006, 23500, 27510, 32200, 37582, 43846, 51022

Offset: 0

Olivier Gérard

Also number of partitions with at most 4 parts of size 1 and differences between parts at distance 6 are greater than 1.
Also number of partitions of n where no part appears more than four times.
Case k=7, i=5 of Gordon Theorem.

			G.f. = 1 + x + 2*x^2 + 3*x^3 + 5*x^4 + 6*x^5 + 10*x^6 + 13*x^7 + 19*x^8 + ...
G.f. = q + q^7 + 2*q^13 + 3*q^19 + 5*q^25 + 6*q^31 + 10*q^37 + 13*q^43 + ...
a(6) counts these partitions: 6, 42, 411, 33, 321, 3111, 2211, 21111, 111111. - _Clark Kimberling_, Mar 09 2014

G. E. Andrews, The Theory of Partitions, Addison-Wesley, 1976, p. 109.

Seiichi Manyama, Table of n, a(n) for n = 0..10000 (terms 0..1000 from T. D. Noe)
Riccardo Aragona, Roberto Civino, and Norberto Gavioli, A modular idealizer chain and unrefinability of partitions with repeated parts, arXiv:2301.06347 [math.RA], 2023.
Vaclav Kotesovec, A method of finding the asymptotics of q-series based on the convolution of generating functions, arXiv:1509.08708 [math.CO], Sep 30 2015, p. 15.
G. N. Watson, Ramanujans Vermutung ueber Zerfaellungsanzahlen, J. Reine Angew. Math. (Crelle), 179 (1938), 97-128. See the expression Y = C/B in the notation of p. 106. [Added by _N. J. A. Sloane_, Nov 13 2009]
Eric Weisstein's World of Mathematics, Partition Function b_k.
Wikipedia, Glaisher's Theorem

Cf. A061198, A061199, A047201.
Cf. A000009 (m=2), A000726 (m=3), A001935 (m=4), A219601 (m=6), A035985 (m=7), A261775 (m=8), A104502 (m=9), A261776 (m=10).
Cf. A096938, A133563, A320607.
Number of r-regular partitions for r = 2 through 12: A000009, A000726, A001935, A035959, A219601, A035985, A261775, A104502, A261776, A328545, A328546.

a035959 = p a047201_list where
   p _      0 = 1
   p ks'@(k:ks) m = if m < k then 0 else p ks' (m - k) + p ks m
-- Reinhard Zumkeller, Dec 17 2011

max = 47; f[x_] := (x^5-1)/(x-1); g[x_] := Product[f[x^k], {k, 1, max}]; CoefficientList[ Series[g[x], {x, 0, max}], x] (* Jean-François Alcover, Nov 29 2011, after Michael Somos *)
t = Flatten[Table[5 n + r, {n, 0, 60}, {r, 1, 4}]]; p[n_] := IntegerPartitions[n, All, t]; Table[p[n], {n, 0, 8}] (* shows partitions *)
a[n_] := Length@p@n; a /@ Range[0, 50] (* Clark Kimberling, Mar 09 2014 *)
nmax = 50; CoefficientList[Series[Product[(1 - x^(5*k))/(1 - x^k), {k, 1, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Aug 31 2015 *)
QP = QPochhammer; s = QP[q^5]/QP[q] + O[q]^50; CoefficientList[s, q] (* Jean-François Alcover, Nov 25 2015, after Michael Somos *)
Table[Count[IntegerPartitions@n, x_ /; ! MemberQ [Mod[x, 5], 0, 2] ], {n, 0, 47}] (* Robert Price, Jul 28 2020 *)
Table[Count[IntegerPartitions[n],?(NoneTrue[Mod[#,5]==0&])],{n,0,50}] (* _Harvey P. Dale, Dec 25 2021 *)

{a(n) = if( n<0, 0, polcoeff( eta(x^5 + x * O(x^n)) / eta(x + x * O(x^n)), n))}; /* Michael Somos, May 28 2006 */

G.f.: Product_{j>=1} (1 + x^j + x^2j + x^3j + x^4j). - Jon Perry, Mar 30 2004
G.f.: Product_{n>0, n==1, 2, 3, 4 mod 5} 1/(1-q^n).
Given g.f. A(x) then B(x) = x * A(x^3)^2 satisfies 0 = f(B(x), B(x^2)) where f(u, v) = u^3 + v^3 - u*v - 5*u^2*v^2. - Michael Somos, May 28 2006
Given g.f. A(x) then B(x) = x * A(x^3)^2 satisfies 0 = f(B(x), B(x^2), B(x^4)) where f(u, v, w) = v + 5*v^2*(u + w) - (u^2 + u*w + w^2). - Michael Somos, May 28 2006
Euler transform of period 5 sequence [ 1, 1, 1, 1, 0, ...]. - Michael Somos, May 28 2006
G.f.: Product_{k > 0} P5(x^k) where P5 is 5th cyclotomic polynomial.
Convolution inverse is A145466. - Michael Somos, Jun 26 2014
a(n) ~ 2*Pi * BesselI(1, 2*sqrt((6*n + 1)/5) * Pi/3) / (5*sqrt(6*n + 1)) ~ exp(2*Pi*sqrt(2*n/15)) / (3^(1/4) * 10^(3/4) * n^(3/4)) * (1 + (Pi/(3*sqrt(15)) - 3*sqrt(15)/(16*Pi)) / sqrt(2*n) + (Pi^2/540 - 225/(1024*Pi^2) - 5/32) / n). - Vaclav Kotesovec, Aug 31 2015, extended Jan 14 2017
a(n) = (1/n)*Sum_{k=1..n} A116073(k)*a(n-k), a(0) = 1. - Seiichi Manyama, Mar 25 2017
G.f.: exp(Sum_{k>=1} x^k*(1 + x^k + x^(2*k) + x^(3*k))/(k*(1 - x^(5*k)))). - Ilya Gutkovskiy, Aug 15 2018

A109389 Expansion of q^(-1/12)eta(q)eta(q^6)/(eta(q^2)eta(q^3)) in powers of q.

Original entry on oeis.org

1, -1, 0, 0, 0, -1, 1, -1, 1, 0, 0, -1, 2, -2, 1, 0, 1, -2, 3, -3, 2, -1, 1, -3, 5, -5, 3, -1, 2, -5, 7, -7, 5, -3, 3, -7, 11, -11, 7, -4, 6, -11, 15, -15, 11, -7, 8, -15, 22, -22, 15, -10, 13, -22, 30, -30, 23, -16, 18, -30, 42, -42, 31, -22, 27, -43, 56, -56, 44, -33, 37, -57, 77, -77, 59, -45, 53, -79, 101, -101, 82, -64

Offset: 0

Michael Somos, Jun 26 2005

sign

In general, if m > 1 and g.f. = Product_{k>=1} (1 + x^(m*k))/(1 + x^k), then a(n) ~ (-1)^n * exp(Pi*sqrt((m+2)*n/(6*m))) * (m+2)^(1/4) / (4 * (6*m)^(1/4) * n^(3/4)) if m is even and a(n) ~ (-1)^n * exp(Pi*sqrt((m-1)*n/(6*m))) * (m-1)^(1/4) / (2^(3/2) * (6*m)^(1/4) * n^(3/4)) if m is odd. - Vaclav Kotesovec, Aug 31 2015

			q - q^13 - q^61 + q^73 - q^85 + q^97 - q^133 + 2*q^145 - 2*q^157 + q^169 + ...

Seiichi Manyama, Table of n, a(n) for n = 0..10000 (terms 0..5000 from Vaclav Kotesovec)
Vaclav Kotesovec, A method of finding the asymptotics of q-series based on the convolution of generating functions, arXiv:1509.08708 [math.CO], Sep 30 2015, p. 14.

Cf. A098884.

Cf. A081360 (m=2), A261734 (m=4), A133563 (m=5), A261736 (m=6), A113297 (m=7), A261735 (m=8), A261733 (m=9), A145707 (m=10).

nmax = 100; CoefficientList[Series[Product[(1 + x^(3*k))/(1 + x^k), {k, 1, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Aug 30 2015 *)
QP = QPochhammer; s = QP[q]*(QP[q^6]/(QP[q^2]*QP[q^3])) + O[q]^100; CoefficientList[s, q] (* Jean-François Alcover, Nov 23 2015 *)

{a(n)=local(A); if(n<0, 0, A=x*O(x^n); polcoeff( eta(x+A)*eta(x^6+A)/eta(x^2+A)/eta(x^3+A), n))}

Euler transform of period 6 sequence [ -1, 0, 0, 0, -1, 0, ...].
G.f.: 1/(Product_{k>0} (1+x^(2k-1)+x^(4k-2))) = Product_{k>0} (1-x^(6k-1))(1-x^(6k-5)) = Product_{k>0} (1-x^k+x^(2k)) (where 1-x+x^2 is 6th cyclotomic polynomial).
Given g.f. A(x), then B(x)=x*A(x^12) satisfies 0=f(B(x), B(x^2), B(x^4)) where f(u, v, w)=(v^2+u^4)*(v^2+w^4)-2*v^4*(1-v*u^2*w^2).
Expansion of G(x^6) * H(x) - x * G(x) * H(x^6) where G(), H() are Rogers-Ramanujan functions.
a(n) = (-1)^n*A098884(n).
a(n) ~ (-1)^n * exp(sqrt(n)*Pi/3) / (2*sqrt(6)*n^(3/4)). - Vaclav Kotesovec, Aug 30 2015
a(n) = -(1/n)*Sum_{k=1..n} A186099(k)*a(n-k), a(0) = 1. - Seiichi Manyama, Mar 26 2017

A096938 McKay-Thompson series of class 60F for the Monster group.

Original entry on oeis.org

1, 1, 1, 2, 2, 2, 3, 4, 4, 6, 7, 8, 10, 12, 14, 16, 19, 22, 26, 30, 35, 41, 47, 54, 62, 70, 80, 92, 104, 118, 135, 152, 171, 194, 218, 244, 275, 308, 344, 386, 432, 481, 537, 598, 664, 738, 819, 908, 1006, 1114, 1232, 1362, 1503, 1658, 1828, 2012, 2214, 2436, 2676

Offset: 0

Noureddine Chair, Aug 18 2004

nonn

The inverted graded parafermionic partition function.
Also number of partitions of n into parts congruent to {1,3,7,9} mod 10. Also number of partitions of n into odd parts parts in which no part appears more than 4 times.
Number of partitions of n into distinct parts in which no part is a multiple of 5.
This generating function is a generalization of the sequences A003105 and A006950. It arose in my recent work on partial supersymmetry in writing the graded parafermionic partition function in which I obtained a more general formula.

			a(8)=4, the number of partitions into distinct parts that exclude the number 5 because we can write 8=7+1=6+2=4+3+1.
T60F = 1/q + q^5 + q^11 + 2*q^17 + 2*q^23 + 2*q^29 + 3*q^35 + 4*q^41 +...

T. M. Apostol, An Introduction to Analytic Number Theory, Springer-Verlag, NY, 1976

Seiichi Manyama, Table of n, a(n) for n = 0..1000
Cristina Ballantine and Brooke Feigon, Truncated Theta Series Related to the Jacobi Triple Product Identity, arXiv:2401.04019 [math.CO], 2024. See page 16.
Nayandeep Deka Baruah and Abhishek Sarma, Arithmetic properties of 5-regular partitions into distinct parts, arXiv:2411.02978 [math.NT], 2024. See p. 2.
N. Chair, Partition identities from Partial Supersymmetry, arXiv:hep-th/0409011, 2004.
Vaclav Kotesovec, A method of finding the asymptotics of q-series based on the convolution of generating functions, arXiv:1509.08708 [math.CO], Sep 30 2015, p. 12.
Donald Spector, Duality, partial supersymmetry and arithmetic number theory, arXiv:hep-th/9710002, 1997.
Donald Spector, Duality, partial supersymmetry and arithmetic number theory, J. Math. Phys. Vol. 39, 1998, p. 1919.
Index entries for sequences related to groups
Index entries for McKay-Thompson series for Monster simple group

Cf. A133563.

Cf. A000700 (m=2), A003105 (m=3), A070048 (m=4), A261770 (m=6), A097793 (m=7), A261771 (m=8), A112193 (m=9), A261772 (m=10).

series(product(1/(1-x^k+x^(2*k)-x^(3*k)+x^(4*k)),k+1..150),x=0,100);

CoefficientList[ Series[ Product[1/(1 - x^k + x^(2k) - x^(3k) + x^(4k)), {k, 70}], {x, 0, 60}], x] (* Robert G. Wilson v, Aug 19 2004 *)
nmax = 50; CoefficientList[Series[Product[(1 + x^k) / (1 + x^(5*k)), {k, 1, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Aug 31 2015 *)
QP = QPochhammer; s = QP[q^2]*(QP[q^5]/(QP[q]*QP[q^10])) + O[q]^60; CoefficientList[s, q] (* Jean-François Alcover, Nov 12 2015 *)

{a(n)=local(A); if(n<0,0, A=x*O(x^n); polcoeff( eta(x^2+A)*eta(x^5+A)/eta(x+A)/eta(x^10+A), n))} /* Michael Somos, Jan 18 2005 */

Euler transform of period 10 sequence [1, 0, 1, 0, 0, 0, 1, 0, 1, 0, ...]. - Vladeta Jovovic, Aug 19 2004
Expansion of q^(1/6)eta(q^2)eta(q^5)/(eta(q)eta(q^10)) in powers of q.
Given g.f. A(x), then B(x)=(A(x^6)/x)^2 satisfies 0=f(B(x), B(x^2)) where f(u, v)=(u^3+v^3)(1+uv)-uv(1-uv)^2. - Michael Somos, Jan 18 2005
G.f.: 1/product_{k>=1} (1-x^k+x^(2*k)-x^(3*k)+x^(4*k)) = 1/Product_{k>0} P10(x^k) where P10 is the 10th cyclotomic polynomial.
a(n) ~ exp(2*Pi*sqrt(n/15)) / (2 * 15^(1/4) * n^(3/4)) * (1 - (3*sqrt(15)/(16*Pi) + Pi/(6*sqrt(15))) / sqrt(n)). - Vaclav Kotesovec, Aug 31 2015, extended Jan 21 2017

Definition corrected by Vladeta Jovovic, Aug 19 2004

More terms from Robert G. Wilson v, Aug 19 2004

A145707 Expansion of chi(-q) / chi(-q^10) in powers of q where chi() is a Ramanujan theta function.

Original entry on oeis.org

1, -1, 0, -1, 1, -1, 1, -1, 2, -2, 3, -3, 3, -4, 4, -5, 6, -6, 7, -8, 10, -11, 11, -13, 15, -17, 18, -20, 23, -25, 29, -32, 34, -39, 42, -47, 52, -56, 62, -68, 77, -83, 89, -99, 108, -119, 129, -139, 154, -167, 183, -199, 214, -234, 253, -276, 299, -322, 350

Offset: 0

Michael Somos, Oct 17 2008

sign

Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).

In general, if m > 1 and g.f. = Product_{k>=1} (1 + x^(m*k))/(1 + x^k), then a(n) ~ (-1)^n * exp(Pi*sqrt((m+2)*n/(6*m))) * (m+2)^(1/4) / (4 * (6*m)^(1/4) * n^(3/4)) if m is even and a(n) ~ (-1)^n * exp(Pi*sqrt((m-1)*n/(6*m))) * (m-1)^(1/4) / (2^(3/2) * (6*m)^(1/4) * n^(3/4)) if m is odd. - Vaclav Kotesovec, Aug 31 2015

			G.f. = 1 - x - x^3 + x^4 - x^5 + x^6 - x^7 + 2*x^8 - 2*x^9 + 3*x^10 + ...
G.f. = q^3 - q^11 - q^27 + q^35 - q^43 + q^51 - q^59 + 2*q^67 - 2*q^75 + ...

Alois P. Heinz, Table of n, a(n) for n = 0..10000
Michael Somos, Introduction to Ramanujan theta functions
Eric Weisstein's World of Mathematics, Ramanujan Theta Functions

Cf. A145703, A145704, A145705.

Cf. A081360 (m=2), A109389 (m=3), A261734 (m=4), A133563 (m=5), A261736 (m=6), A113297 (m=7), A261735 (m=8), A261733 (m=9).

nmax = 100; CoefficientList[Series[Product[(1 + x^(10*k))/(1 + x^k), {k, 1, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Aug 30 2015 *)
a[ n_] := SeriesCoefficient[ QPochhammer[ x, x^2] QPochhammer[ -x^10, x^10], {x, 0, n}]; (* Michael Somos, Sep 06 2015 *)

{a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( eta(x + A) * eta(x^20 + A) / (eta(x^2 + A) * eta(x^10 + A)), n))};

Expansion of q^(-3/8) * eta(q) * eta(q^20) / (eta(q^2) * eta(q^10)) in powers of q.
Euler transform of period 20 sequence [ -1, 0, -1, 0, -1, 0, -1, 0, -1, 1, -1, 0, -1, 0, -1, 0, -1, 0, -1, 0, ...].
G.f. is a period 1 Fourier series which satisfies f(-1 / (1280 t)) = f(t) where q = exp(2 Pi i t).
G.f.: Product_{k>0} (1 - x^(2*k - 1)) / (1 - x^(20*k - 10)).
a(n) = (-1)^n * A145703(n) = A145704(2*n + 1) = - A145705(2*n + 1).
a(n) ~ (-1)^n * exp(Pi*sqrt(n/5)) / (4*5^(1/4)*n^(3/4)). - Vaclav Kotesovec, Aug 30 2015

A261734 Expansion of Product_{k>=1} (1 + x^(4*k))/(1 + x^k).

Original entry on oeis.org

1, -1, 0, -1, 2, -2, 1, -2, 4, -4, 3, -4, 8, -8, 6, -9, 14, -14, 12, -16, 24, -25, 22, -28, 40, -42, 38, -48, 65, -68, 64, -78, 102, -108, 104, -124, 159, -168, 164, -194, 242, -256, 254, -296, 362, -385, 386, -444, 536, -570, 576, -658, 782, -832, 848, -961

Offset: 0

Vaclav Kotesovec, Aug 30 2015

sign

Seiichi Manyama, Table of n, a(n) for n = 0..10000
David J. Hemmer, Generating functions for fixed points of the Mullineux map, arXiv:2402.03643 [math.CO], 2024.
Vaclav Kotesovec, A method of finding the asymptotics of q-series based on the convolution of generating functions, arXiv:1509.08708 [math.CO], Sep 30 2015, p. 14.

Cf. A081360 (m=2), A109389 (m=3), A133563 (m=5), A261736 (m=6), A113297 (m=7), A261735 (m=8), A261733 (m=9), A145707 (m=10).

seq(coeff(series(mul((1+x^(4*k))/(1+x^k),k=1..n), x,n+1),x,n),n=0..60); # Muniru A Asiru, Jul 29 2018

nmax = 100; CoefficientList[Series[Product[(1 + x^(4*k))/(1 + x^k), {k, 1, nmax}], {x, 0, nmax}], x]

a(n) ~ (-1)^n * exp(sqrt(n)*Pi/2) / (4*sqrt(2)*n^(3/4)).

A261736 Expansion of Product_{k>=1} (1 + x^(6*k))/(1 + x^k).

Original entry on oeis.org

1, -1, 0, -1, 1, -1, 2, -2, 2, -3, 3, -3, 5, -5, 5, -7, 8, -8, 11, -12, 12, -16, 17, -18, 23, -25, 26, -32, 35, -37, 45, -49, 52, -62, 67, -72, 85, -92, 98, -114, 124, -133, 153, -166, 178, -203, 220, -236, 268, -290, 311, -350, 379, -407, 456, -493, 529

Offset: 0

Vaclav Kotesovec, Aug 30 2015

sign

Seiichi Manyama, Table of n, a(n) for n = 0..10000
David J. Hemmer, Generating functions for fixed points of the Mullineux map, arXiv:2402.03643 [math.CO], 2024.
Vaclav Kotesovec, A method of finding the asymptotics of q-series based on the convolution of generating functions, arXiv:1509.08708 [math.CO], Sep 30 2015, p. 14.

Cf. A081360 (m=2), A109389 (m=3), A261734 (m=4), A133563 (m=5), A113297 (m=7), A261735 (m=8), A261733 (m=9), A145707 (m=10).

seq(coeff(series(mul((1+x^(6*k))/(1+x^k),k=1..n), x,n+1),x,n),n=0..60); # Muniru A Asiru, Jul 29 2018

nmax = 100; CoefficientList[Series[Product[(1 + x^(6*k))/(1 + x^k), {k, 1, nmax}], {x, 0, nmax}], x]

a(n) ~ (-1)^n * exp(sqrt(2*n)*Pi/3) / (2^(7/4)*sqrt(3)*n^(3/4)).

A261733 Expansion of Product_{k>=1} (1 + x^(9*k))/(1 + x^k).

Original entry on oeis.org

1, -1, 0, -1, 1, -1, 1, -1, 2, -1, 1, -2, 2, -2, 2, -3, 4, -3, 4, -5, 5, -6, 6, -7, 8, -8, 9, -9, 10, -12, 11, -13, 15, -16, 17, -18, 22, -23, 23, -27, 30, -31, 32, -35, 40, -40, 42, -48, 51, -54, 57, -63, 69, -71, 78, -85, 90, -97, 102, -110, 118, -124, 133

Offset: 0

Vaclav Kotesovec, Aug 30 2015

sign

In general, if m > 1 and g.f. = Product_{k>=1} (1 + x^(m*k))/(1 + x^k), then a(n) ~ (-1)^n * exp(Pi*sqrt((m+2)*n/(6*m))) * (m+2)^(1/4) / (4 * (6*m)^(1/4) * n^(3/4)) if m is even and a(n) ~ (-1)^n * exp(Pi*sqrt((m-1)*n/(6*m))) * (m-1)^(1/4) / (2^(3/2) * (6*m)^(1/4) * n^(3/4)) if m is odd.

Alois P. Heinz, Table of n, a(n) for n = 0..10000

Cf. A081360 (m=2), A109389 (m=3), A261734 (m=4), A133563 (m=5), A261736 (m=6), A113297 (m=7), A261735 (m=8), A145707 (m=10).

with(numtheory):
a:= proc(n) option remember; `if`(n=0, 1, add(add(d*[0, -1, 0,
        -1, 0, -1, 0, -1, 0, 0, 0, -1, 0, -1, 0, -1, 0, -1]
       [1+irem(d, 18)], d=divisors(j))*a(n-j), j=1..n)/n)
    end:
seq(a(n), n=0..80);  # Alois P. Heinz, Sep 01 2015

nmax = 100; CoefficientList[Series[Product[(1 + x^(9*k))/(1 + x^k), {k, 1, nmax}], {x, 0, nmax}], x]

a(n) ~ (-1)^n * exp(2*Pi*sqrt(n/3)/3) / (2 * 3^(3/4) * n^(3/4)).

A261735 Expansion of Product_{k>=1} (1 + x^(8*k))/(1 + x^k).

Original entry on oeis.org

1, -1, 0, -1, 1, -1, 1, -1, 3, -3, 2, -3, 4, -4, 4, -5, 8, -8, 7, -9, 11, -12, 12, -14, 20, -21, 19, -24, 28, -30, 31, -35, 45, -48, 47, -55, 64, -68, 71, -80, 97, -103, 104, -119, 135, -145, 152, -168, 198, -211, 216, -243, 272, -291, 307, -337, 386, -412

Offset: 0

Vaclav Kotesovec, Aug 30 2015

sign

In general, if m > 1 and g.f. = Product_{k>=1} (1 + x^(m*k))/(1 + x^k), then a(n) ~ (-1)^n * exp(Pi*sqrt((m+2)*n/(6*m))) * (m+2)^(1/4) / (4 * (6*m)^(1/4) * n^(3/4)) if m is even and a(n) ~ (-1)^n * exp(Pi*sqrt((m-1)*n/(6*m))) * (m-1)^(1/4) / (2^(3/2) * (6*m)^(1/4) * n^(3/4)) if m is odd.

Seiichi Manyama, Table of n, a(n) for n = 0..10000
Vaclav Kotesovec, A method of finding the asymptotics of q-series based on the convolution of generating functions, arXiv:1509.08708 [math.CO], Sep 30 2015, p. 14.

Cf. A081360 (m=2), A109389 (m=3), A261734 (m=4), A133563 (m=5), A261736 (m=6), A113297 (m=7), A261733 (m=9), A145707 (m=10).

seq(coeff(series(mul((1+x^(8*k))/(1+x^k),k=1..n), x,n+1),x,n),n=0..60); # Muniru A Asiru, Jul 29 2018

nmax = 100; CoefficientList[Series[Product[(1 + x^(8*k))/(1 + x^k), {k, 1, nmax}], {x, 0, nmax}], x]

a(n) ~ (-1)^n * exp(sqrt(5*n/6)*Pi/2) * 5^(1/4) / (2^(11/4)*3^(1/4)*n^(3/4)).

A113297 Expansion of chi(-q) / chi(-q^7) in powers of q where chi() is a Ramanujan theta function.

Original entry on oeis.org

1, -1, 0, -1, 1, -1, 1, 0, 1, -2, 1, -1, 2, -2, 3, -3, 3, -4, 4, -4, 5, -4, 4, -6, 6, -7, 7, -8, 11, -11, 10, -12, 14, -15, 15, -14, 17, -20, 19, -21, 24, -26, 30, -31, 32, -37, 38, -40, 45, -44, 47, -54, 56, -60, 64, -68, 79, -83, 83, -92, 100, -105, 110, -112, 123, -136, 138, -147, 160, -170, 185, -194, 203

Offset: 0

Michael Somos, Oct 23 2005

sign

Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
Rogers-Ramanujan functions: G(q) (see A003114), H(q) (A003106).
In general, if m > 1 and g.f. = Product_{k>=1} (1 + x^(m*k))/(1 + x^k), then a(n) ~ (-1)^n * exp(Pi*sqrt((m+2)*n/(6*m))) * (m+2)^(1/4) / (4 * (6*m)^(1/4) * n^(3/4)) if m is even and a(n) ~ (-1)^n * exp(Pi*sqrt((m-1)*n/(6*m))) * (m-1)^(1/4) / (2^(3/2) * (6*m)^(1/4) * n^(3/4)) if m is odd. - Vaclav Kotesovec, Aug 31 2015

			G.f. = 1 - x - x^3 + x^4 - x^5 + x^6 + x^8 - 2*x^9 + x^10 - x^11 + ...
G.f. = q - q^5 - q^13 + q^17 - q^21 + q^25 + q^33 - 2*q^37 + q^41 + ...

Seiichi Manyama, Table of n, a(n) for n = 0..10000 (terms 0..1000 from G. C. Greubel)
F. G. Garvan and H. Yesilyurt, Shifted and shiftless partition identities II, arXiv:math/0605317 [math.NT], 2003.
Vaclav Kotesovec, A method of finding the asymptotics of q-series based on the convolution of generating functions, arXiv:1509.08708 [math.CO], Sep 30 2015, p. 14.
Michael Somos, Introduction to Ramanujan theta functions
Eric Weisstein's World of Mathematics, Ramanujan Theta Functions

Cf. A097793.

Cf. A081360 (m=2), A109389 (m=3), A261734 (m=4), A133563 (m=5), A261736 (m=6), A261735 (m=8), A261733 (m=9), A145707 (m=10).

seq(coeff(series(mul((1+x^(7*k))/(1+x^k),k=1..n), x,n+1),x,n),n=0..80); # Muniru A Asiru, Jul 29 2018

a[ n_] := SeriesCoefficient[ QPochhammer[ x] QPochhammer[ x^14] / (QPochhammer[ x^2] QPochhammer[ x^7]), {x, 0, n}]; (* Michael Somos, Aug 26 2015 *)

{a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( eta(x  + A) * eta(x^14 + A) / (eta(x^2 + A) * eta(x^7 + A)), n))};

Expansion of q^(-1/4) * eta(q) * eta(q^14) / ( eta(q^2) * eta(q^7) ) in powers of q.
Euler transform of period 14 sequence [ -1, 0, -1, 0, -1, 0, 0, 0, -1, 0, -1, 0, -1, 0, ...].
G.f. A(x) = G(x^7) * H(x^2) - x * G(x^2) * H(x^7) where G(x) and H(x) are the Rogers-Ramanujan functions.
G.f.: Product_{k>0} (1 + x^(7*k)) / (1 + x^k).
Expansion of chi(-q) / chi(-q^7) in powers of q where chi() is a Ramanujan theta function.
G.f. is a period 1 Fourier series which satisfies f(-1 / (224 t)) = f(t) where q = exp(2 Pi i t).
G.f.: Product_{k>0} P14(x^k) where P14 is the 14th cyclotomic polynomial.
Convolution inverse is A097793.
a(n) ~ (-1)^n * exp(Pi*sqrt(n/7)) / (2^(3/2) * 7^(1/4) * n^(3/4)). - Vaclav Kotesovec, Aug 31 2015

A302233 Square array A(n,k), n >= 0, k >= 1, read by antidiagonals, where column k is the expansion of Product_{j>=1} (1 + x^(k*j))/(1 + x^j).

Original entry on oeis.org

1, 1, 0, 1, -1, 0, 1, -1, 1, 0, 1, -1, 0, -2, 0, 1, -1, 0, 0, 2, 0, 1, -1, 0, -1, 0, -3, 0, 1, -1, 0, -1, 2, -1, 4, 0, 1, -1, 0, -1, 1, -2, 1, -5, 0, 1, -1, 0, -1, 1, 0, 1, -1, 6, 0, 1, -1, 0, -1, 1, -1, 0, -2, 1, -8, 0, 1, -1, 0, -1, 1, -1, 2, -1, 4, 0, 10, 0, 1, -1, 0, -1, 1, -1, 1, -2, 1, -4, 0, -12, 0

Offset: 0

Ilya Gutkovskiy, Apr 03 2018

			Square array begins:
1,  1,  1,  1,  1,  1,  ...
0, -1, -1, -1, -1, -1,  ...
0,  1,  0,  0,  0,  0,  ...
0, -2,  0, -1, -1, -1,  ...
0,  2,  0,  2,  1,  1,  ...
0, -3, -1, -2,  0, -1,  ...

Columns k=1-10 give: A000007, A081360, A109389, A261734, A133563, A261736, A113297, A261735, A261733, A145707.
Main diagonal gives A081362.
Cf. A286653, A286656, A290307.

Table[Function[k, SeriesCoefficient[Product[(1 + x^(k i))/(1 + x^i), {i, 1, n}], {x, 0, n}]][j - n + 1], {j, 0, 12}, {n, 0, j}] // Flatten
Table[Function[k, SeriesCoefficient[QPochhammer[-1, x^k]/QPochhammer[-1, x], {x, 0, n}]][j - n + 1], {j, 0, 12}, {n, 0, j}] // Flatten

G.f. of column k: Product_{j>=1} (1 + x^(k*j))/(1 + x^j).

For asymptotics of column k see comment from Vaclav Kotesovec in A145707.

cp's OEIS Frontend

A035959 Number of partitions of n in which no parts are multiples of 5.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

Formula

A109389 Expansion of q^(-1/12)eta(q)eta(q^6)/(eta(q^2)eta(q^3)) in powers of q.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A096938 McKay-Thompson series of class 60F for the Monster group.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A145707 Expansion of chi(-q) / chi(-q^10) in powers of q where chi() is a Ramanujan theta function.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A261734 Expansion of Product_{k>=1} (1 + x^(4*k))/(1 + x^k).

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A261736 Expansion of Product_{k>=1} (1 + x^(6*k))/(1 + x^k).

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A261733 Expansion of Product_{k>=1} (1 + x^(9*k))/(1 + x^k).

Views

Author

Keywords

Comments

Links