A023003 -id:A023003 - cp's OEIS frontend

A144064 Square array A(n,k), n>=0, k>=0, read by antidiagonals, where column k is Euler transform of (j->k).

1, 1, 0, 1, 1, 0, 1, 2, 2, 0, 1, 3, 5, 3, 0, 1, 4, 9, 10, 5, 0, 1, 5, 14, 22, 20, 7, 0, 1, 6, 20, 40, 51, 36, 11, 0, 1, 7, 27, 65, 105, 108, 65, 15, 0, 1, 8, 35, 98, 190, 252, 221, 110, 22, 0, 1, 9, 44, 140, 315, 506, 574, 429, 185, 30, 0, 1, 10, 54, 192, 490, 918, 1265, 1240, 810, 300, 42, 0

Offset: 0

Alois P. Heinz, Sep 09 2008

A(n,k) is also the number of partitions of n into parts of k kinds.
In general, column k > 0 is asymptotic to k^((k+1)/4) * exp(Pi*sqrt(2*k*n/3)) / (2^((3*k+5)/4) * 3^((k+1)/4) * n^((k+3)/4)) * (1 - (Pi*k^(3/2)/(24*sqrt(6)) + sqrt(3)*(k+1)*(k+3)/(8*Pi*sqrt(2*k))) / sqrt(n)). - Vaclav Kotesovec, Feb 28 2015, extended Jan 16 2017
When k is a prime power greater than 1, A(n,k) is the number of conjugacy classes of n X n matrices over a field with k elements that contain an upper-triangular matrix. - Geoffrey Critzer, Nov 11 2022

			Square array begins:
  1,   1,   1,   1,   1,   1, ...
  0,   1,   2,   3,   4,   5, ...
  0,   2,   5,   9,  14,  20, ...
  0,   3,  10,  22,  40,  65, ...
  0,   5,  20,  51, 105, 190, ...
  0,   7,  36, 108, 252, 506, ...

Alois P. Heinz, Antidiagonals n = 0..140, flattened
G. E. Bergum and V. E. Hoggatt, Jr., Numerator polynomial coefficient array for the convolved Fibonacci sequence, Fib. Quart., 14 (1976), 43-44. (Annotated scanned copy)
G. E. Bergum and V. E. Hoggatt, Jr., Numerator polynomial coefficient array for the convolved Fibonacci sequence, Fib. Quart., 14 (1976), 43-48. See Table 1.
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. 8.
N. J. A. Sloane, Transforms
Index entries for expansions of Product_{k >= 1} (1-x^k)^m

Columns k=0-24 give: A000007, A000041, A000712, A000716, A023003, A023004, A023005, A023006, A023007, A023008, A023009, A023010, A005758, A023011, A023012, A023013, A023014, A023015, A023016, A023017, A023018, A023019, A023020, A023021, A006922.
Cf. A082556 (k=30), A082557 (k=32), A082558 (k=48), A082559 (k=64).
Rows n=0-4 give: A000012, A001477, A000096, A006503, A006504.
Main diagonal gives A008485.
Antidiagonal sums give A067687.
Cf. A060642, A122768, A246935, A255961, A261718.

# DedekindEta is defined in A000594.
A144064Column(k, len) = DedekindEta(len, -k)
for n in 0:8 A144064Column(n, 6) |> println end # Peter Luschny, Mar 10 2018

with(numtheory): etr:= proc(p) local b; b:= proc(n) option remember; `if`(n=0, 1, add(add(d*p(d), d=divisors(j)) *b(n-j), j=1..n)/n) end end: A:= (n,k)-> etr(j->k)(n): seq(seq(A(n, d-n), n=0..d), d=0..14);

a[0, ] = 1; a[, 0] = 0; a[n_, k_] := SeriesCoefficient[ Product[1/(1 - x^j)^k, {j, 1, n}], {x, 0, n}]; Table[a[n - k, k], {n, 0, 11}, {k, n, 0, -1}] // Flatten (* Jean-François Alcover, Dec 06 2013 *)
etr[p_] := Module[{b}, b[n_] := b[n] = If[n==0, 1, Sum[Sum[d*p[d], {d, Divisors[j]} ]*b[n-j], {j, 1, n}]/n]; b]; A[n_, k_] := etr[k&][n]; Table[A[n, d-n], {d, 0, 14}, {n, 0, d}] // Flatten (* Jean-François Alcover, Mar 30 2015, after Alois P. Heinz *)

Mat(apply( {A144064_col(k,nMax=9)=Col(1/eta('x+O('x^nMax))^k,nMax)}, [0..9])) \\ M. F. Hasler, Aug 04 2024

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

A(n,k) = Sum_{i=0..k} binomial(k,i) * A060642(n,k-i):

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

Original entry on oeis.org

1, 1, 5, 22, 105, 506, 2492, 12405, 62337, 315445, 1605340, 8207563, 42124380, 216903064, 1119974875, 5796944357, 30068145905, 156250892610, 813310723925, 4239676354650, 22130265931900, 115654632452535, 605081974091875, 3168828466966388, 16610409114771900

Offset: 0

T. Forbes (anthony.d.forbes(AT)googlemail.com)

nonn

Number of partitions of n into parts of n kinds. - Vladeta Jovovic, Sep 08 2002
Main diagonal of A144064. - Omar E. Pol, Jun 27 2012
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) == p + 1 (mod p^2) holds for all primes p >= 3. Cf. A270913. (End)

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

Cf. A000041, A000712, A000716, A023003-A023021, A005758, A006922.

Cf. A109085, A192435, A252782, A255526, A255672, A270913, A270915, A270919.

with(numtheory): etr:= proc(p) local b; b:=proc(n) option remember; `if`(n=0, 1, add(add(d*p(d), d=divisors(j)) *b(n-j), j=1..n)/n) end end: a:= n-> etr(j->n)(n): seq(a(n), n=0..30); # Alois P. Heinz, Sep 09 2008

a[n_] := SeriesCoefficient[ Product[1/(1-x^k)^n, {k, 1, n}], {x, 0, n}]; a[1] = 1; Table[a[n], {n, 1, 24}] (* Jean-François Alcover, Feb 24 2015 *)
Table[SeriesCoefficient[1/QPochhammer[x, x]^n, {x, 0, n}], {n, 0, 20}] (* Vaclav Kotesovec, Mar 25 2016 *)
Table[SeriesCoefficient[Exp[n*Sum[x^j/(j*(1-x^j)), {j, 1, n}]], {x, 0, n}], {n, 0, 20}] (* Vaclav Kotesovec, May 19 2018 *)

{a(n)=polcoeff(prod(k=1,n,1/(1-x^k +x*O(x^n))^n),n)}

{a(n)=n*polcoeff(log(1/x*serreverse(x*eta(x+x*O(x^n)))), n)} /* Paul D. Hanna, Apr 05 2012 */

a(n) = Sum_{pi} Product_{i=1..n} binomial(k_i+n-1, k_i) where pi runs through all nonnegative solutions of k_1+2*k_2+...+n*k_n=n. a(n) = b(n, n) where b(n, m)= m/n*Sum_{i=1..n} sigma(i)*b(n-i, m) is recurrence for number of partitions of n into parts of m kinds. - Vladeta Jovovic, Sep 08 2002
Equals the logarithmic derivative of A109085, the g.f. of which is (1/x)*Series_Reversion(x*eta(x)). - Paul D. Hanna, Apr 05 2012
Let G(x) = exp( Sum_{n>=1} a(n)*x^n/n ), then G(x) = 1/Product_{n>=1} (1-x^n*G(x)^n) is the g.f. of A109085. - Paul D. Hanna, Apr 05 2012
a(n) ~ c * d^n / sqrt(n), where d = A270915 = 5.352701333486642687772415814165..., c = A327279 = 0.26801521271073331568695383828... . - Vaclav Kotesovec, Sep 10 2014

a(0)=1 prepended by Alois P. Heinz, Mar 30 2015

A000727 Expansion of Product_{k >= 1} (1 - x^k)^4.

Original entry on oeis.org

1, -4, 2, 8, -5, -4, -10, 8, 9, 0, 14, -16, -10, -4, 0, -8, 14, 20, 2, 0, -11, 20, -32, -16, 0, -4, 14, 8, -9, 20, 26, 0, 2, -28, 0, -16, 16, -28, -22, 0, 14, 16, 0, 40, 0, -28, 26, 32, -17, 0, -32, -16, -22, 0, -10, 32, -34, -8, 14, 0, 45, -4, 38, 8, 0, 0, -34, -8, 38, 0, -22, -56, 2, -28, 0, 0, -10, 20, 64, -40, -20, 44

Offset: 0

N. J. A. Sloane

Number 51 of the 74 eta-quotients listed in Table I of Martin (1996).

Ramanujan (see the link, pp. 155 and 157 Nr. 23.) conjectured the expansion coefficients called Psi_4(n) of eta^4(6*z) in powers of q = exp(2*Pi*i*z), Im(z) > 0, where i is the imaginary unit. In the Finch link on p. 5, multiplicity is used and Psi_4(p^r), called f(p^r), is given (see also b(p^e) formula given by Michael Somos, Aug 23 2006). Mordell proved this conjecture on pp. 121-122 based on Klein-Fricke, Theorie der elliptischen Modulfunktionen, 1892, Band II, p. 374. The product formula for the Dirichlet series, Mordell, eq. (7) for a=2,is used to find Psi_4(n), called f_2(n), from f_2(p) for primes p. The primes p = 2 and 3 do not appear in the product. - Wolfdieter Lang, May 03 2016

			G.f. = 1 - 4*x + 2*x^2 + 8*x^3 - 5*x^4 - 4*x^5 - 10*x^6 + 8*x^7 + 9*x^8 + ...
G.f. = q - 4*q^7 + 2*q^13 + 8*q^19 - 5*q^25 - 4*q^31 - 10*q^37 + 8*q^43 + ...

Morris 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.
J. H. Silverman, A Friendly Introduction to Number Theory, 3rd ed., Pearson Education, Inc, 2006, p. 415. Exer. 47.2.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Alois P. Heinz, Table of n, a(n) for n = 0..10000
M. Boylan, Exceptional congruences for the coefficients of certain eta-product newforms, J. Number Theory 98 (2003), no. 2, 377-389.
Amanda Clemm, Modular Forms and Weierstrass Mock Modular Forms, Mathematics, volume 4, issue 1, (2016).
S. Cooper, M. D. Hirschhorn and R. Lewis, Powers of Euler's Product and Related Identities, The Ramanujan Journal, Vol. 4 (2), 137-155 (2000).
S. R. Finch, Powers of Euler's q-Series, arXiv:math/0701251 [math.NT], 2007.
M. Koike, On McKay's conjecture, Nagoya Math. J., 95 (1984), 85-89.
Y. Martin, Multiplicative eta-quotients, Trans. Amer. Math. Soc. 348 (1996), no. 12, 4825-4856, see page 4852 Table I.
Louis J. Mordell, On Mr. Ramanujan's empirical expansions of modular functions, Proceedings of the Cambridge Philosophical Society 19 (1917), pp. 117-124.
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]
S. Ramanujan, On certain Arithmetical Functions, Trans. Cambridge Philos. Soc. 22 (1916) 159-184; also in Collected papers, eds. G. H. Hardy, P. V. Seshu Aiyar and B. M. Wilson, Chelsea publ. Comp., 1962 (reprint from CUP 1927), pp. 136-162, 340- 341.
Michael Somos, Index to Yves Martin's list of 74 multiplicative eta-quotients and their A-numbers
Robert M. Ziff, On Cardy's formula for the critical crossing probability in 2d percolation, J. Phys. A. 28, 1249-1255 (1995).
Index entries for expansions of Product_{k >= 1} (1-x^k)^m

Cf. A000731, A002107, A023003, A187076, A187150, A258404, A280328.

Powers of Euler's product: A000594, A000727 - A000731, A000735, A000739, A002107, A010815 - A010840.

# DedekindEta is defined in A000594.
L000727List(len) = DedekindEta(len, 4)
L000727List(82) |> println # Peter Luschny, Mar 09 2018

qEigenform( EllipticCurve( [0, 0, 0, 0, 1]), 493); /* Michael Somos, Jun 12 2014 */

A := Basis( ModularForms( Gamma0(36), 2), 493); A[2] - 4*A[8]; /* Michael Somos, Jun 12 2014 */

Basis( CuspForms( Gamma0(36), 2), 493)[1]; /* Michael Somos, May 17 2015 */

Coefficients(&*[(1-x^m)^4:m in [1..100]])[1..100] where x is PolynomialRing(Integers()).1; // Vincenzo Librandi, Mar 10 2018

with(numtheory): etr:= proc(p) local b; b:=proc(n) option remember; local d,j; if n=0 then 1 else add(add(d*p(d), d=divisors(j)) *b(n-j), j=1..n)/n fi end end: a:= etr(n-> -4): seq(a(n), n=0..81); # Alois P. Heinz, Sep 08 2008

etr[p_] := Module[{b}, b[n_] := b[n] = If[n == 0, 1, Sum[Sum[d*p[d], {d, Divisors[j]}]*b[n - j], {j, 1, n}]/n]; b]; a = etr[-4&]; Table[a[n], {n, 0, 81}] (* Jean-François Alcover, Mar 10 2014, after Alois P. Heinz *)
a[ n_] := SeriesCoefficient[ QPochhammer[ x]^4, {x, 0, n}]; (* Michael Somos, Jun 12 2014 *)
nmax = 80; CoefficientList[Series[Sum[Sum[(-1)^(k+m) * (2*k+1) * q^(k*(k+1)/2 + m*(3*m-1)/2), {k, 0, nmax}], {m, -nmax, nmax}], {q, 0, nmax}], q] (* Vaclav Kotesovec, Dec 06 2015 *)

{a(n) = my(A, p, e, x, y, a0, a1); if( n<0, 0, n = 6*n + 1; A = factor(n); prod( k=1, matsize(A)[1], [p, e] = A[k,]; if( p<5, 0, p%6==5, if(e%2, 0, (-1)^(e/2) * p^(e/2)), for( y=1, sqrtint(p\3), if( issquare( p - 3*y^2, &x), break)); a0=1; if( x%3!=1, x=-x); a1 = x = 2*x; for( i=2, e, y = x*a1 - p*a0; a0=a1; a1=y); a1)))}; /* Michael Somos, Aug 23 2006 */

{a(n) = if( n<0, 0, polcoeff(eta(x + x * O(x^n))^4, n))};

{a(n) = if( n<0, 0, ellak( ellinit( [0, 0, 0, 0, 1], 1), 6*n + 1))}; /* Michael Somos, Jul 01 2004 */

ModularForms( Gamma0(36), 2, prec=493).0; # Michael Somos, Jun 12 2014

Euler transform of period 1 sequence [-4, -4, ...]. - Michael Somos, Apr 02 2005
Given g.f. A(x), then B(q) = q * A(q^3)^2 satisfies 0 = f(B(q), B(q^2), B(q^4)) where f(u, v, w) = w*u^2 - v^3 + 16 * u*w^2. - Michael Somos, Apr 02 2005
a(n) = b(6*n + 1) where b() is multiplicative with b(2^e) = b(3^e) = 0^e, b(p^e) = b(p) * b(p^(e-1)) - p * b(p^(e-2)), b(p) = 0 if p == 5 (mod 6), b(p) = 2*x where p = x^2 + 3*y^2 == 1 (mod 6) and x == 1 (mod 3). - Michael Somos, Aug 23 2006
Coefficients of L-series for elliptic curve "36a1": y^2 = x^3 + 1. - Michael Somos, Jul 01 2004
a(n) = (-1)^n * A187076(n). a(2*n + 1) = -4 * A187150(n). a(25*n + 9) = a(25*n + 14) = a(25*n + 19) = a(25*n + 24) = 0. a(25*n + 4) = -5 * a(n). Convolution inverse of A023003. Convolution square of A002107. Convolution square is A000731.
a(0) = 1, a(n) = -(4/n)*Sum_{k=1..n} A000203(k)*a(n-k) for n > 0. - Seiichi Manyama, Mar 26 2017
G.f.: exp(-4*Sum_{k>=1} x^k/(k*(1 - x^k))). - Ilya Gutkovskiy, Feb 05 2018
Let M = p_1*...*p_k be a positive integer whose prime factors p_i (not necessarily distinct) are all congruent to 5 (mod 6). Then a( M^2*n + (M^2 - 1)/6 ) = (-1)^k*M*a(n). See Cooper et al., equation 4. - Peter Bala, Dec 01 2020
a(n) = b(6*n + 1) where b() is multiplicative with b(3^e) = 0^e, b(p^e) = (1 + (-1)^e)/2 * (-p)^(e/2) if p == 2 (mod 3), b(p^e) = (((x+sqrt(-3)*y)/2)^(e+1) - ((x-sqrt(-3)*y)/2)^(e+1))/x if p == 1 (mod 3) where p = x^2 + 3*y^2 and x == 1 (mod 3). - Jianing Song, Mar 19 2022

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

Original entry on oeis.org

1, 8, 36, 124, 362, 944, 2266, 5100, 10903, 22340, 44168, 84692, 158137, 288452, 515344, 903740, 1558465, 2646820, 4432964, 7329916, 11977507, 19358524, 30970444, 49077936, 77081679, 120054268, 185514428, 284540060, 433360308, 655622392, 985604644, 1472751228

Offset: 4

Ilya Gutkovskiy, Feb 07 2021

nonn

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

Column k=4 of A060642.

Cf. A000041, A023003, A048574, A327382, A341221, A341223, A341225, A341226, A341227, A341228.

b:= proc(n, k) option remember; `if`(k<2, `if`(n=0, 1-k, combinat[
      numbpart](n)), (q-> add(b(j, q)*b(n-j, k-q), j=0..n))(iquo(k, 2)))
    end:
a:= n-> b(n, 4):
seq(a(n), n=4..35);  # Alois P. Heinz, Feb 07 2021

nmax = 35; CoefficientList[Series[(-1 + Product[1/(1 - x^k), {k, 1, nmax}])^4, {x, 0, nmax}], x] // Drop[#, 4] &

a(n) ~ A023003(n). - Vaclav Kotesovec, Feb 20 2021

A193427 G.f.: Product_{k>=1} 1/(1-x^k)^(8*k).

Original entry on oeis.org

1, 8, 52, 272, 1266, 5344, 20992, 77584, 272727, 917936, 2975492, 9328736, 28391410, 84122688, 243265848, 688008048, 1906476351, 5184024112, 13851270944, 36409640400, 94255399886, 240529147072, 605574003464, 1505340071744

Offset: 0

Martin Y. Veillette, Jul 28 2011

nonn

Previous name was: Number of plane partitions of n into parts of 8 kinds.

In general, if g.f. = Product_{k>=1} 1/(1-x^k)^(m*k) and m > 0, then a(n) ~ 2^(m/36 - 1/3) * exp(m/12 + 3 * 2^(-2/3) * m^(1/3) * zeta(3)^(1/3) * n^(2/3)) * (m*zeta(3))^(m/36 + 1/6) / (A^m * sqrt(3*Pi) * n^(m/36 + 2/3)), where A = A074962 = 1.2824271291... is the Glaisher-Kinkelin constant. - Vaclav Kotesovec, Mar 01 2015

Vaclav Kotesovec, Table of n, a(n) for n = 0..1000
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. 19.

Cf. A000219 (m=1), A161870 (m=2), A255610 (m=3), A255611 (m=4), A255612 (m=5), A255613 (m=6), A255614 (m=7).
Cf. A023007, A023003, A000712.
Column k=8 of A255961.

a:= proc(n) option remember; `if`(n=0, 1, 8*add(
      a(n-j)*numtheory[sigma][2](j), j=1..n)/n)
    end:
seq(a(n), n=0..30);  # Alois P. Heinz, Mar 11 2015

ANS = Block[{kmax = 50},
  Coefficient[
   Series[Product[1/(1 - x^k)^(8 k), {k, 1, kmax}], {x, 0, kmax}], x,
   Range[0, kmax]]]
(* Second program: *)
a[n_] := a[n] = If[n==0, 1, 8*Sum[a[n-j]*DivisorSigma[2, j], {j, 1, n}]/n]; Table[a[n], {n, 0, 30}] (* Jean-François Alcover, Feb 07 2017, after Alois P. Heinz *)

Vec(prod(k=1,100\2,(1-x^k)^(-8*k),1+O(x^101))) \\ Charles R Greathouse IV, Aug 09 2011

G.f.: Product_{k>=1} (1-x^k)^(-8*k).
a(n) ~ 2^(19/18) * zeta(3)^(7/18) * exp(2/3 + 3 * 2^(1/3) * zeta(3)^(1/3) * n^(2/3)) / (A^8 * sqrt(3*Pi) * n^(8/9)), where A = A074962 = 1.2824271291... is the Glaisher-Kinkelin constant and zeta(3) = A002117 = 1.202056903... . - Vaclav Kotesovec, Feb 28 2015
G.f.: exp(8*Sum_{k>=1} x^k/(k*(1 - x^k)^2)). - Ilya Gutkovskiy, May 29 2018
Euler transform of 8*k. - Georg Fischer, Aug 15 2020

New name from Vaclav Kotesovec, Mar 12 2015

A339319 Dirichlet g.f.: Product_{k>=2} 1 / (1 - k^(-s))^4.

Original entry on oeis.org

1, 4, 4, 14, 4, 20, 4, 40, 14, 20, 4, 76, 4, 20, 20, 105, 4, 76, 4, 76, 20, 20, 4, 236, 14, 20, 40, 76, 4, 116, 4, 252, 20, 20, 20, 306, 4, 20, 20, 236, 4, 116, 4, 76, 76, 20, 4, 656, 14, 76, 20, 76, 4, 236, 20, 236, 20, 20, 4, 476, 4, 20, 76, 574, 20, 116, 4, 76, 20, 116

Offset: 1

Ilya Gutkovskiy, Nov 30 2020

nonn

Number of factorizations of n into factors (greater than 1) of 4 kinds.

Cf. A001055, A023003, A301830, A339318, A339320, A339321, A339322, A339323, A339324.

a(p^k) = A023003(k) for prime p.

A060850 Array of the coefficients A(n,k) in the expansion of Product_{i>=1} 1/(1-x^i)^n = Sum_{k>=0} A(n,k)*x^k, n >= 1, k >= 0.

Original entry on oeis.org

1, 1, 1, 1, 2, 2, 1, 3, 5, 3, 1, 4, 9, 10, 5, 1, 5, 14, 22, 20, 7, 1, 6, 20, 40, 51, 36, 11, 1, 7, 27, 65, 105, 108, 65, 15, 1, 8, 35, 98, 190, 252, 221, 110, 22, 1, 9, 44, 140, 315, 506, 574, 429, 185, 30, 1, 10, 54, 192, 490, 918, 1265, 1240, 810, 300, 42, 1, 11, 65, 255

Offset: 1

Bo T. Ahlander (ahlboa(AT)isk.kth.se), May 03 2001

Table read by antidiagonals: entry (n,k) gives number of partitions of n objects into parts of k kinds. - Franklin T. Adams-Watters, Dec 28 2006

			Table (row k, k >= 0: number of partitions of n, n >= 0, into parts of k kinds):
Array begins:
=======================================================================
k\n| 0   1   2    3     4     5      6       7       8       9       10
---|-------------------------------------------------------------------
1  | 1   1   2    3     5     7     11      15      22      30       42
2  | 1   2   5   10    20    36     65     110     185     300      481
3  | 1   3   9   22    51   108    221     429     810    1479     2640
4  | 1   4  14   40   105   252    574    1240    2580    5180    10108
5  | 1   5  20   65   190   506   1265    2990    6765   14725    31027
6  | 1   6  27   98   315   918   2492    6372   15525   36280    81816
7  | 1   7  35  140   490  1547   4522   12405   32305   80465   192899
8  | 1   8  44  192   726  2464   7704   22528   62337  164560   417140
9  | 1   9  54  255  1035  3753  12483   38709  113265  315445   841842
10 | 1  10  65  330  1430  5512  19415   63570  195910  573430  1605340
11 | 1  11  77  418  1925  7854  29183  100529  325193  997150  2919411
  ...
Triangle (row n, n >= 0: number of partitions of n into parts of n - k kinds, 0 <= k <= n) (antidiagonals of above table) (parenthesized last term on each row, which would correspond to row k = 0 in above table)
Triangle begins: (column k: n - k kinds of parts)
===================================
n\k| 0   1   2   3   4   5   6   7
---+-------------------------------
0  |(1)
1  | 1, (0)
2  | 1,  1, (0)
3  | 1,  2,  2, (0)
4  | 1,  3,  5,  3, (0)
5  | 1,  4,  9, 10,  5, (0)
6  | 1,  5, 14, 22, 20,  7, (0)
7  | 1,  6, 20, 40, 51, 36, 11, (0)
  ...

Cf. A067687 (table antidiagonal sums, triangle row sums).
Rows (table), diagonals (triangle): A000041, A000712, A000716, A023003-A023021, A006922.
Columns (table, triangle): A000012, A001477, A000096, A006503, A006504.

t[n_, k_] := CoefficientList[ Series[ Product[1/(1 - x^i)^n, {i, k}], {x, 0, k}], x][[k]]; (* Robert G. Wilson v, Aug 08 2018 *)
t[n_, k_]; = IntegerPartitions[n, {k}]; Table[ t[n - k + 1, k], {n, 12}, {k, n}] // Flatten (* Robert G. Wilson v, Aug 08 2018 *)

G.f. A(n;x) for n-th row satisfies A(n;x) = Sum_{k=1..n} A000041(k-1)*A(n-k;x)*x^(k-1), A(0;x) = 1. - Vladeta Jovovic, Jan 02 2004

More terms from Vladeta Jovovic, Jan 02 2004

A022579 Expansion of Product_{m>=1} (1+x^m)^14.

Original entry on oeis.org

1, 14, 105, 574, 2576, 10052, 35273, 113794, 342699, 974176, 2635955, 6833540, 17061345, 41197422, 96544003, 220212384, 490104727, 1066552228, 2273590095, 4755188704, 9771319068, 19751596934, 39317784863, 77150246040, 149357609184, 285497384004, 539227765104, 1006978117880

Offset: 0

N. J. A. Sloane

Seiichi Manyama, Table of n, a(n) for n = 0..10000

Column k=14 of A286335. Cf. A000707, A023003.

Coefficients(&*[(1+x^m)^14:m in [1..40]])[1..40] where x is PolynomialRing(Integers()).1; // G. C. Greubel, Feb 25 2018

nmax=50; CoefficientList[Series[Product[(1+q^m)^14,{m,1,nmax}],{q,0,nmax}],q] (* Vaclav Kotesovec, Mar 05 2015 *)

m=50; q='q+O('q^m); Vec(prod(n=1,m,(1+q^n)^14)) \\ G. C. Greubel, Feb 25 2018

a(n) ~ (7/6)^(1/4) * exp(Pi * sqrt(14*n/3)) / (256 * n^(3/4)). - Vaclav Kotesovec, Mar 05 2015
a(0) = 1, a(n) = (14/n)*Sum_{k=1..n} A000593(k)*a(n-k) for n > 0. - Seiichi Manyama, Apr 03 2017
G.f. A(x) = (1/2)*( G(sqrt(x)) + G(-sqrt(x)) )/G(x^4), where G(x) = Product_{n >= 1} 1/(1 - x^n)^4 is the g.f. of A023003 (see also A000727). - Peter Bala, Oct 05 2023

A210764 Square array T(n,k), n>=0, k>=0, read by antidiagonals in which column k gives the partial sums of column k of A144064.

Original entry on oeis.org

1, 1, 1, 1, 2, 1, 1, 4, 3, 1, 1, 7, 8, 4, 1, 1, 12, 18, 13, 5, 1, 1, 19, 38, 35, 19, 6, 1, 1, 30, 74, 86, 59, 26, 7, 1, 1, 45, 139, 194, 164, 91, 34, 8, 1, 1, 67, 249, 415, 416, 281, 132, 43, 9, 1, 1, 97, 434, 844, 990, 787, 447, 183, 53, 10, 1

Offset: 0

Omar E. Pol, Jun 27 2012

It appears that row 2 is A034856.
Observation:
Column 1 is the EULER transform of 2,1,1,1,1,1,1,1...
Column 2 is the EULER transform of 3,2,2,2,2,2,2,2...

			Array begins:
1,   1,   1,   1,   1,   1,   1,   1,   1,   1,   1,
1,   2,   3,   4,   5,   6,   7,   8,   9,  10,
1,   4,   8,  13,  19,  26,  34,  43,  53,
1,   7,  18,  35,  59,  91, 132, 183,
1,  12,  38,  86, 164, 281, 447,
1,  19,  74, 194, 416, 787,
1,  30, 139, 415, 990,
1,  45, 249, 844,
1,  67, 434,
1,  97,
1,

Alois P. Heinz, Rows n = 0..140, flattened

Columns (0-3): A000012, A000070, A000713, A210843.
Rows (0-1): A000012, A000027.
Main diagonal gives A303070.
Cf. A000007, A000041, A005758, A006922, A000712, A000716, A023003-A023021, A144064, A195825, A211970.

with(numtheory):
etr:= proc(p) local b;
        b:= proc(n) option remember; `if`(n=0, 1,
              add(add(d*p(d), d=divisors(j))*b(n-j), j=1..n)/n)
            end
      end:
A:= (n, k)-> etr(j-> k +`if`(j=1, 1, 0))(n):
seq(seq(A(d-k, k), k=0..d), d=0..14); # Alois P. Heinz, May 20 2013

etr[p_] := Module[{b}, b[n_] := b[n] = If[n == 0, 1, Sum[Sum[d*p[d], {d, Divisors[ j]}]*b[n-j], {j, 1, n}]/n]; b]; A[n_, k_] := etr[Function[{j}, k + If[j == 1, 1, 0]]][n]; Table[Table[A[d-k, k], {k, 0, d}], {d, 0, 14}] // Flatten (* Jean-François Alcover, Mar 05 2015, after Alois P. Heinz *)

A382041 Triangle read by rows: T(n, k) is the number of partitions of n with at most k parts where 0 <= k <= n, and each part is one of four kinds.

Original entry on oeis.org

1, 0, 4, 0, 4, 14, 0, 4, 20, 40, 0, 4, 30, 70, 105, 0, 4, 36, 116, 196, 252, 0, 4, 46, 170, 350, 490, 574, 0, 4, 52, 236, 556, 896, 1120, 1240, 0, 4, 62, 310, 845, 1505, 2079, 2415, 2580, 0, 4, 68, 400, 1200, 2400, 3584, 4480, 4960, 5180, 0, 4, 78, 494, 1670, 3626, 5910, 7842, 9162, 9822, 10108

Offset: 0

Peter Dolland, Mar 12 2025

Two unrestricted unary predicates on the parts set result in four kinds: The intersection, the both differences and the complement of the union.
The 1-kind case is Euler's table A026820.
The 2-kind case is A381895.
The 3-kind case is A382025.

			Triangle starts:
  0 : [1]
  1 : [0, 4]
  2 : [0, 4, 14]
  3 : [0, 4, 20,  40]
  4 : [0, 4, 30,  70,  105]
  5 : [0, 4, 36, 116,  196,  252]
  6 : [0, 4, 46, 170,  350,  490,  574]
  7 : [0, 4, 52, 236,  556,  896, 1120, 1240]
  8 : [0, 4, 62, 310,  845, 1505, 2079, 2415, 2580]
  9 : [0, 4, 68, 400, 1200, 2400, 3584, 4480, 4960, 5180]
 10 : [0, 4, 78, 494, 1670, 3626, 5910, 7842, 9162, 9822, 10108]
 ...

Main diagonal gives A023003.

Cf. A026820, A381895, A382025.

from sympy import binomial
from sympy.utilities.iterables import partitions
from sympy.combinatorics.partitions import IntegerPartition
kinds = 4 - 1   # the number of part kinds - 1
def a382041_row( n):
    if n == 0 : return [1]
    t = list( [0] * n)
    for p in partitions( n):
        p = IntegerPartition( p).as_dict()
        fact = 1
        s = 0
        for k in p :
            s += p[k]
            fact *= binomial( kinds + p[k], kinds)
        if s > 0 :
            t[s - 1] += fact
    for i in range( n - 1):
        t[i+1] += t[i]
    return [0] + t

cp's OEIS Frontend

A144064 Square array A(n,k), n>=0, k>=0, read by antidiagonals, where column k is Euler transform of (j->k).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Julia

Maple

Mathematica

PARI

Formula

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

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Formula

Extensions

A000727 Expansion of Product_{k >= 1} (1 - x^k)^4.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Julia

Magma

Magma

Magma

Magma

Maple

Mathematica

PARI

PARI

PARI

Sage

Formula

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

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A193427 G.f.: Product_{k>=1} 1/(1-x^k)^(8*k).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A339319 Dirichlet g.f.: Product_{k>=2} 1 / (1 - k^(-s))^4.

Views

Author

Keywords

Comments

Crossrefs