A008705 -id:A008705 - cp's OEIS frontend

A262308 Bisection of A008705.

-1, 5, -6, 41, -85, -2069, 8605, 3990, 36685, -254525, -3603805, 13479425, 23579969, 237487433, -1795846200, -6788705842, 44427298525, -48251561329, 1187033450882, -5419042629125, -29806300419830, 195349574327650, -288613313574270, 2714096998599960, -8002401055092375

Offset: 0

N. J. A. Sloane, Oct 04 2015

sign

Morris Newman, Further identities and congruences for the coefficients of modular forms [annotated scanned copy], Canadian J. Math 10 (1958): 577-586. See Table 1, column p=5.
Morris Newman, Further identities and congruences for the coefficients of modular forms, Canadian J. Math 10 (1958): 577-586. See Table 1, column p=5.

Cf. A008705, A262309.

A262309 Bisection of A008705.

Original entry on oeis.org

1, -1, -5, 11, -125, 1054, -209, -15625, 14035, -130525, 1899830, -134905, -25499225, -64447293, -133867445, 6309965146, -11762712973, -29646853725, -160561408097, -1495301415045, 24032249395590, -42497223256645, -176218120143125, 271151209742715, -6483574667232425

Offset: 0

N. J. A. Sloane, Oct 04 2015

sign

Cf. A008705, A262308.

A270919 Coefficient of x^n in Product_{k>=1} ((1 + x^k) / (1 - x^k))^n.

Original entry on oeis.org

1, 2, 12, 80, 552, 3912, 28224, 206208, 1520784, 11297546, 84413912, 633713808, 4776117216, 36115518376, 273868321536, 2081866609920, 15859616674336, 121046064563376, 925411686479820, 7085465166635440, 54323193841192752, 416993869451825424, 3204447137019290944

Offset: 0

Vaclav Kotesovec, Mar 25 2016

nonn

From Peter Bala, Apr 18 2023: (Start)
The Gauss congruences a(n*p^k) == a(n*p^(k-1)) (mod p^k) hold for all primes p and all positive integers n and k.
Conjecture: the supercongruence a(p) == 2*p + 2 (mod p^2) holds for all primes p. Cf. A291697. (End)

Seiichi Manyama, Table of n, a(n) for n = 0..1118 (terms 0..500 from Vaclav Kotesovec)

Main diagonal of A288515.

Cf. A008485, A008705, A156616, A270913, A270923, A270924, A291697, A309986, A362408.

Table[SeriesCoefficient[Product[((1+x^k)/(1-x^k))^n, {k, 1, n}], {x, 0, n}], {n, 0, 25}]
Table[SeriesCoefficient[(QPochhammer[-1, x]/QPochhammer[x, x])^n, {x, 0, n}]/2^n, {n, 0, 25}]
(* Calculation of constants {d,c}: *) eq = FindRoot[{2*s*QPochhammer[r*s] == QPochhammer[-1, r*s], (Log[1 - r*s] + QPolyGamma[0, 1, r*s])/Log[r*s] + r*((Derivative[0, 1][QPochhammer][-1, r*s] - 2*s*Derivative[0, 1][QPochhammer][r*s, r*s]) / (2*QPochhammer[r*s])) == 1}, {r, 1/8}, {s, 2}, WorkingPrecision -> 1000]; {N[1/r /. eq, 120], val = Sqrt[(1 - r*s)*Log[r*s]^2*(QPochhammer[r*s] / (Pi*(-r*s*(-1 + r*s) * Log[r*s]*(4*(2*ArcTanh[1 - 2*r*s] + QPolyGamma[0, 1, r*s])* Derivative[0, 1][QPochhammer][r*s, r*s] + r*Log[r*s]*(Derivative[0, 2][QPochhammer][-1, r*s] - 2*s*Derivative[0, 2][QPochhammer][r*s, r*s])) + 2*QPochhammer[r*s] * (4*r*s*ArcTanh[1 - 2*r*s] + 2*(-1 + (-1 + r*s)*ArcTanh[1 - 2*r*s])*Log[1 - r*s] - (-1 + r*s)*(-2 + Log[r*s] - 2*Log[1 - r*s])*QPolyGamma[0, 1, r*s] + (-1 + r*s) * QPolyGamma[0, 1, r*s]^2 + (-1 + r*s)*(QPolyGamma[1, 1, r*s] - 2*r*s*Log[r*s]* Derivative[0, 0, 1][QPolyGamma][0, 1, r*s])))))] /. eq; N[Chop[val], -Floor[Log[10, Abs[Im[val]]]] - 3]} (* Vaclav Kotesovec, Oct 03 2023 *)

a(n) ~ c * d^n / sqrt(n), where d = 7.862983395705905261519347909953827161057584... and c = 0.299856802806668079413694689903953367699319...

a(n) = [x^n] 1/theta_4(x)^n, where theta_4() is the Jacobi theta function. - Ilya Gutkovskiy, Nov 03 2017

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

Original entry on oeis.org

1, 1, 0, 1, -1, 0, 1, -2, -1, 0, 1, -3, -1, 0, 0, 1, -4, 0, 2, 0, 0, 1, -5, 2, 5, 1, 1, 0, 1, -6, 5, 8, 0, 2, 0, 0, 1, -7, 9, 10, -5, 0, -2, 1, 0, 1, -8, 14, 10, -15, -4, -7, 0, 0, 0, 1, -9, 20, 7, -30, -6, -10, 0, -2, 0, 0, 1, -10, 27, 0, -49, 0, -5, 8, 0, -2, 0, 0, 1, -11, 35, -12, -70, 21, 11, 25, 9, 0, 1, 0, 0

Offset: 0

Ilya Gutkovskiy, May 08 2017

A(n,k) number of partitions of n into an even number of distinct parts minus number of partitions of n into an odd number of distinct parts with k types of each part.

			A(3,2) = 2 because we have [2, 1], [2', 1], [2, 1'], [2', 1'] (number of partitions of 3 into an even number of distinct parts with 2 types of each part), [3], [3'] (number of partitions of 3 into an odd number of distinct parts with 2 types of each part) and 4 - 2 = 2.
Square array begins:
1,  1,  1,  1,  1,   1,  ...
0, -1, -2, -3, -4,  -5,  ...
0, -1, -1,  0,  2,   5,  ...
0,  0,  2,  5,  8,  10,  ...
0,  0,  1,  0, -5, -15,  ...
0,  1,  2,  0, -4,  -6,  ...

Seiichi Manyama, Antidiagonals n = 0..139, flattened
Index entries for expansions of Product_{k >= 1} (1-x^k)^m

Columns k=0-20 give: A000007, A010815, A002107, A010816, A000727, A000728, A000729, A000730, A000731, A010817, A010818, A010819, A000735, A010820, A010821, A010822, A000739, A010823, A010824, A010825, A010826.
Main diagonal gives A008705.
Antidiagonal sums give A299105.

A:= proc(n, k) option remember; `if`(n=0, 1, -k*
      add(numtheory[sigma](j)*A(n-j, k), j=1..n)/n)
    end:
seq(seq(A(n, d-n), n=0..d), d=0..12);  # Alois P. Heinz, Jun 21 2018

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

G.f. of column k: Product_{j>=1} (1 - x^j)^k.
G.f. of column k: (Sum_{j=-inf..inf} (-1)^j*x^(j*(3*j+1)/2))^k.
Column k is the Euler transform of period 1 sequence [-k, -k, -k, ...].

A291697 a(n) = [x^n] Product_{k>=0} ((1 + x^(2k+1))/(1 - x^(2k+1)))^n.

Original entry on oeis.org

1, 2, 8, 44, 256, 1512, 9056, 54896, 335872, 2069774, 12827888, 79875996, 499305472, 3131436856, 19694403520, 124165133424, 784478240768, 4965659813668, 31484486937512, 199923173603596, 1271192603065856, 8092551782518688, 51574780342740256, 329022223268286288, 2100934234342260736

Offset: 0

Ilya Gutkovskiy, Aug 30 2017

nonn

From Peter Bala, Apr 18 2023: (Start)
The Gauss congruences a(n*p^k) == a(n*p^(k-1)) (mod p^k) hold for all primes p and all positive integers n and k.
Conjecture: the supercongruence a(p) == 2*p + 2 (mod p^3) holds for all primes p >= 5. Cf. A270919. (End)

Vaclav Kotesovec, Table of n, a(n) for n = 0..1000

Main diagonal of A289522.

Cf. A080054, A008705, A270919, A361008, A362408.

Table[SeriesCoefficient[Product[((1 + x^(2 k + 1))/(1 - x^(2 k + 1)))^n, {k, 0, n}], {x, 0, n}], {n, 0, 24}]
Table[SeriesCoefficient[(QPochhammer[-x, x^2]/QPochhammer[x, x^2])^n, {x, 0, n}], {n, 0, 24}]
(* Calculation of constant d: *) 1/r /. FindRoot[{s == QPochhammer[-r*s, r^2*s^2] / QPochhammer[r*s, r^2*s^2], QPochhammer[r*s, r^2*s^2] + QPochhammer[r*s, r^2*s^2]*((QPolyGamma[0, Log[-r*s]/Log[r^2*s^2], r^2*s^2] - QPolyGamma[0, Log[r*s]/Log[r^2*s^2], r^2*s^2]) / Log[r^2*s^2]) + 2*r^2*s^2*Derivative[0, 1][QPochhammer][r*s, r^2*s^2] == 2*r^2*s*Derivative[0, 1][QPochhammer][-r*s, r^2*s^2]}, {r, 1/8}, {s, 1}, WorkingPrecision -> 120] (* Vaclav Kotesovec, Oct 04 2023 *)

a(n) = A289522(n,n).

a(n) ~ c * d^n / sqrt(n), where d = 6.52085730573545526010335599231748172235904... and c = 0.296494808714349908707366708893... - Vaclav Kotesovec, Aug 30 2017

A303173 a(n) = [x^n] Product_{k=1..n} (1 - x^k)^(n-k+1).

Original entry on oeis.org

1, -1, 0, 4, -7, 0, 13, 10, -92, 21, 720, -2019, 1193, 6281, -18054, 16111, 11059, -14653, -57685, -86620, 1281406, -3454742, 2383734, 9409968, -30397071, 43327680, -56130326, 128981571, -73487834, -1219918457, 5059678044, -7826243881, -4131571113, 38850603452

Offset: 0

Ilya Gutkovskiy, Apr 19 2018

sign

			a(0) = 1;
a(1) = [x^1] (1 - x) = -1;
a(2) = [x^2] (1 - x)^2*(1 - x^2) = 0;
a(3) = [x^3] (1 - x)^3*(1 - x^2)^2*(1 - x^3) = 4;
a(4) = [x^4] (1 - x)^4*(1 - x^2)^3*(1 - x^3)^2*(1 - x^4) = -7;
a(5) = [x^5] (1 - x)^5*(1 - x^2)^4*(1 - x^3)^3*(1 - x^4)^2*(1 - x^5) = 0, etc.
...
The table of coefficients of x^k in expansion of Product_{k=1..n} (1 - x^k)^(n-k+1) begins:
n = 0: (1),  0,  0,  0,    0,   0,  ...
n = 1:  1, (-1), 0,  0,    0,   0,  ...
n = 2:  1,  -2, (0), 2,   -1,   0,  ...
n = 3:  1,  -3,  1, (4),  -2,  -2,  ...
n = 4:  1,  -4,  3,  6,  (-7), -2,  ...
n = 5:  1,  -5,  6,  7,  -16,  (0), ...

Vaclav Kotesovec, Table of n, a(n) for n = 0..500

Cf. A008705, A073592, A206228, A206229, A303174.

Table[SeriesCoefficient[Product[(1 - x^k)^(n - k + 1), {k, 1, n}], {x, 0, n}], {n, 0, 33}]

A319933 A(n, k) = [x^k] DedekindEta(x)^n, square array read by descending antidiagonals, A(n, k) for n >= 0 and k >= 0.

Original entry on oeis.org

1, 0, 1, 0, -1, 1, 0, -1, -2, 1, 0, 0, -1, -3, 1, 0, 0, 2, 0, -4, 1, 0, 1, 1, 5, 2, -5, 1, 0, 0, 2, 0, 8, 5, -6, 1, 0, 1, -2, 0, -5, 10, 9, -7, 1, 0, 0, 0, -7, -4, -15, 10, 14, -8, 1, 0, 0, -2, 0, -10, -6, -30, 7, 20, -9, 1, 0, 0, -2, 0, 8, -5, 0, -49, 0, 27, -10, 1

Offset: 0

Peter Luschny, Oct 02 2018

The columns are generated by polynomials whose coefficients constitute the triangle of signed D'Arcais numbers A078521 when multiplied with n!.

			[ 0] 1,   0,   0,    0,     0,    0,     0,     0,     0,     0, ... A000007
[ 1] 1,  -1,  -1,    0,     0,    1,     0,     1,     0,     0, ... A010815
[ 2] 1,  -2,  -1,    2,     1,    2,    -2,     0,    -2,    -2, ... A002107
[ 3] 1,  -3,   0,    5,     0,    0,    -7,     0,     0,     0, ... A010816
[ 4] 1,  -4,   2,    8,    -5,   -4,   -10,     8,     9,     0, ... A000727
[ 5] 1,  -5,   5,   10,   -15,   -6,    -5,    25,    15,   -20, ... A000728
[ 6] 1,  -6,   9,   10,   -30,    0,    11,    42,     0,   -70, ... A000729
[ 7] 1,  -7,  14,    7,   -49,   21,    35,    41,   -49,  -133, ... A000730
[ 8] 1,  -8,  20,    0,   -70,   64,    56,     0,  -125,  -160, ... A000731
[ 9] 1,  -9,  27,  -12,   -90,  135,    54,   -99,  -189,   -85, ... A010817
[10] 1, -10,  35,  -30,  -105,  238,     0,  -260,  -165,   140, ... A010818
    A001489,  v , A167541, v , A319931,  v ,         diagonal: A008705
           A080956       A319930      A319932

G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. Fifth ed., Clarendon Press, Oxford, 2003.

M. Boylan, Exceptional congruences for the coefficients of certain eta-product newforms, J. Number Theory 98 (2003), no. 2, 377-389. MR1955423 (2003k:11071)
Steven R. Finch, Powers of Euler's q-Series, arXiv:math/0701251 [math.NT], 2007.
Vaclav Kotesovec, The integration of q-series
Y. Martin, Multiplicative eta-quotients, Trans. Amer. Math. Soc. 348 (1996), no. 12, 4825-4856, see page 4852 Table I.
M. Newman, A table of the coefficients of the powers of eta(tau), Nederl. Akad. Wetensch. Proc. Ser. A. 59 = Indag. Math. 18 (1956), 204-216. [Annotated scanned copy]
Tim Silverman, Counting Cliques in Finite Distant Graphs, arXiv preprint arXiv:1612.08085 [math.CO], 2016.
Michael Somos, Introduction to Ramanujan theta functions
Index entries for expansions of Product_{k >= 1} (1-x^k)^m

Transpose of A286354.

Cf. A078521, A319574 (JacobiTheta3).

# DedekindEta is defined in A000594
for n in 0:10
    DedekindEta(10, n) |> println
end

DedekindEta := (x, n) -> mul(1-x^j, j=1..n):
A319933row := proc(n, len) series(DedekindEta(x, len)^n, x, len+1):
seq(coeff(%, x, j), j=0..len-1) end:
seq(print([n], A319933row(n, 10)), n=0..10);

eta[x_, n_] := Product[1 - x^j, {j, 1, n}];
A[n_, k_] := SeriesCoefficient[eta[x, k]^n, {x, 0, k}];
Table[A[n - k, k], {n, 0, 11}, {k, n, 0, -1}] // Flatten (* Jean-François Alcover, Nov 10 2018 *)

from sage.modular.etaproducts import qexp_eta
def A319933row(n, len):
    return (qexp_eta(ZZ['q'], len+4)^n).list()[:len]
for n in (0..10):
    print(A319933row(n, 10))

A300457 a(n) = [x^n] Product_{k=1..n} (1 - x^k)^(n^k).

Original entry on oeis.org

1, -1, -3, -1, 25, 624, 9871, 170470, 3027249, 55077245, 979330606, 15079702923, 94670678245, -7958168036625, -626145997536240, -34564907982551791, -1733699815491494303, -84294315853736719077, -4067859614343931897505, -196552300464314521511610, -9519733465269825759734169

Offset: 0

Ilya Gutkovskiy, Mar 06 2018

sign

			The table of coefficients of x^k in expansion of Product_{k>=1} (1 - x^k)^(n^k) begins:
n = 0: (1),  0,    0,    0,   0,     0,  ...
n = 1:  1, (-1),  -1,    0,   0,     1,  ...
n = 2:  1,  -2,  (-3),   0,   2,    12,  ...
n = 3:  1,  -3,   -6,  (-1),  9,    63,  ...
n = 4:  1,  -4,  -10,   -4, (25),  224,  ...
n = 5:  1,  -5,  -15,  -10,  55,  (624), ...

Cf. A010815, A008705, A252654, A252782, A255672, A270917, A270922, A281266, A281267, A281268, A283333, A292805, A300456, A300458.

Table[SeriesCoefficient[Product[(1 - x^k)^(n^k), {k, 1, n}], {x, 0, n}], {n, 0, 20}]

A319456 a(n) = [x^n] Product_{k>=1} ((1 - x^k)(1 - x^(2k)))^n.

Original entry on oeis.org

1, -1, -3, 14, -11, -81, 282, -57, -2043, 5405, 2417, -46476, 94522, 110512, -943407, 1505289, 2807589, -16888311, 23645199, 46006542, -265972791, 472882620, 187884672, -3981273597, 14234579226, -19187383356, -78662039004, 502118911904, -847583768679, -2627514175002

Offset: 0

Ilya Gutkovskiy, Sep 19 2018

sign

Cf. A002171, A002288, A008705, A030204, A030211, A066535, A296043, A296044, A319457.

Table[SeriesCoefficient[Product[((1 - x^k) (1 - x^(2 k)))^n , {k, 1, n}], {x, 0, n}], {n, 0, 29}]
Table[SeriesCoefficient[(QPochhammer[x] QPochhammer[x^2])^n, {x, 0, n}], {n, 0, 29}]
Table[SeriesCoefficient[Exp[n Sum[(DivisorSigma[1, 2 k] - 4 DivisorSigma[1, k]) x^k/k, {k, 1, n}]], {x, 0, n}], {n, 0, 29}]

a(n) = [x^n] Product_{k>=1} (1 - x^(2*k))^(2*n)/(1 + x^k)^n.

a(n) = [x^n] exp(n*Sum_{k>=1} (sigma(2*k) - 4*sigma(k))*x^k/k).

A341263 Coefficient of x^(2*n) in (-1 + Product_{k>=1} (1 - x^k))^n.

Original entry on oeis.org

1, -1, 1, -1, -3, 19, -65, 181, -419, 755, -749, -1530, 12255, -47477, 141065, -343526, 660941, -770917, -911369, 9721976, -40135713, 124134772, -313463842, 631382751, -824406065, -492101356, 8192253811, -35948431288, 115087580857, -299576625051, 627027769120, -894734468883

Offset: 0

Ilya Gutkovskiy, Feb 07 2021

sign

Cf. A001482, A001483, A001484, A001485, A001486, A001487, A001488, A008705, A010815, A047654, A047655, A324595, A340987, A341265.

g:= proc(n) option remember; `if`(n=0, 1, add(add(
     -d, d=numtheory[divisors](j))*g(n-j), j=1..n)/n)
    end:
b:= proc(n, k) option remember; `if`(k=0, 1, `if`(k=1, g(n+1),
      (q-> add(b(j, q)*b(n-j, k-q), j=0..n))(iquo(k, 2))))
    end:
a:= n-> b(n$2):
seq(a(n), n=0..31);  # Alois P. Heinz, Feb 07 2021

Table[SeriesCoefficient[(-1 + QPochhammer[x, x])^n, {x, 0, 2 n}], {n, 0, 31}]
A[n_, k_] := A[n, k] = If[n == 0, 1, -k Sum[A[n - j, k] DivisorSigma[1, j], {j, 1, n}]/n]; T[n_, k_] := Sum[(-1)^i Binomial[k, i] A[n, k - i], {i, 0, k}];
Table[T[2 n, n], {n, 0, 31}]

cp's OEIS Frontend

A262308 Bisection of A008705.

Views

Author

Keywords

Links

Crossrefs

A262309 Bisection of A008705.

Views

Author

Keywords

Crossrefs

A270919 Coefficient of x^n in Product_{k>=1} ((1 + x^k) / (1 - x^k))^n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

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

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A291697 a(n) = [x^n] Product_{k>=0} ((1 + x^(2*k+1))/(1 - x^(2*k+1)))^n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

A303173 a(n) = [x^n] Product_{k=1..n} (1 - x^k)^(n-k+1).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

A319933 A(n, k) = [x^k] DedekindEta(x)^n, square array read by descending antidiagonals, A(n, k) for n >= 0 and k >= 0.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Julia

Maple

Mathematica

Sage

A300457 a(n) = [x^n] Product_{k=1..n} (1 - x^k)^(n^k).

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

A319456 a(n) = [x^n] Product_{k>=1} ((1 - x^k)*(1 - x^(2*k)))^n.

Views

Author

Keywords

Crossrefs

A291697 a(n) = [x^n] Product_{k>=0} ((1 + x^(2k+1))/(1 - x^(2k+1)))^n.

A319456 a(n) = [x^n] Product_{k>=1} ((1 - x^k)(1 - x^(2k)))^n.