A239168 -id:A239168 - cp's OEIS frontend

A238012 Number A(n,k) of partitions of k^n into parts that are at most n with at least one part of each size; square array A(n,k), n>=0, k>=0, read by antidiagonals.

0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 4, 2, 0, 0, 0, 1, 7, 48, 9, 0, 0, 0, 1, 12, 310, 3042, 119, 0, 0, 0, 1, 17, 1240, 109809, 1067474, 4935, 0, 0, 0, 1, 24, 3781, 1655004, 370702459, 2215932130, 596763, 0, 0, 0, 1, 31, 9633, 14942231, 32796849930, 13173778523786, 29012104252380, 211517867, 0, 0

Offset: 0

Alois P. Heinz, Feb 16 2014

In general, column k>=2 is asymptotic to k^(n*(n-1)) / (n!*(n-1)!). - Vaclav Kotesovec, Jun 05 2015

			Square array A(n,k) begins:
  0, 0,   0,       0,         0,           0, ...
  0, 1,   1,       1,         1,           1, ...
  0, 0,   1,       4,         7,          12, ...
  0, 0,   2,      48,       310,        1240, ...
  0, 0,   9,    3042,    109809,     1655004, ...
  0, 0, 119, 1067474, 370702459, 32796849930, ...

Alois P. Heinz, Antidiagonals n = 0..43, flattened
A. V. Sills and D. Zeilberger, Formulae for the number of partitions of n into at most m parts (using the quasi-polynomial ansatz), arXiv:1108.4391 [math.CO], 2011.

Columns k=0-10 give: A000004, A063524, A237999, A239162, A239163, A239164, A239165, A239166, A239167, A239168, A239169.
Rows n=0-2 give: A000004, A057427, A074148(k-1) for k>1.
Main diagonal gives A238001.
Cf. A238010.

A[0, 0] = 0;
A[n_, k_] := SeriesCoefficient[Product[1/(1-x^j), {j, 1, n}], {x, 0, k^n - n(n+1)/2}];
Table[A[n-k, k], {n, 0, 10}, {k, n, 0, -1}] // Flatten (* Jean-François Alcover, Aug 18 2018, after Alois P. Heinz *)

A(n,k) = [x^(k^n-n*(n+1)/2)] Product_{j=1..n} 1/(1-x^j).

A241215 Decimal expansion of Sum_{n>=1} H(n)^4/(n+1)^3 where H(n) is the n-th harmonic number.

Original entry on oeis.org

1, 8, 0, 1, 6, 1, 3, 2, 6, 8, 0, 4, 3, 4, 1, 2, 9, 0, 3, 7, 2, 9, 4, 8, 8, 9, 4, 2, 0, 2, 0, 8, 8, 8, 4, 3, 0, 3, 1, 3, 7, 7, 5, 8, 2, 7, 7, 8, 7, 8, 9, 3, 3, 0, 0, 8, 7, 3, 3, 9, 4, 9, 2, 5, 4, 8, 0, 4, 4, 4, 8, 1, 8, 8, 4, 0, 8, 9, 3, 3, 3, 7, 5, 3, 0, 9, 4, 5, 7, 4, 3, 3, 0, 4, 2, 7, 1, 9, 3, 1

Offset: 1

Jean-François Alcover, Apr 17 2014

			1.80161326804341290372948894202088843...

Philippe Flajolet and Bruno Salvy, Euler Sums and Contour Integral Representations, Experimental Mathematics 7:1 (1998), page 16.

Cf. A016627, A083680, A102886, A152648, A152649, A152651, A233033, A233090, A238166, A238167, A239168, A238169, A238181, A238182, A238183, A240264.

37/180*Pi^4*Zeta[3] - 5/6*Pi^2*Zeta[5] - 109/8*Zeta[7] // RealDigits[#, 10, 100]& // First

37/2*zeta(3)*zeta(4) - 5*zeta(2)*zeta(5) - 109/8*zeta(7) \\ Stefano Spezia, Jan 19 2025

Equals (37/2)*zeta(3)*zeta(4) - 5*zeta(2)*zeta(5) - (109/8)*zeta(7).

Equals (37/180)*Pi^4*zeta(3) - (5/6)*Pi^2*zeta(5) - (109/8)*zeta(7).

cp's OEIS Frontend

A238012 Number A(n,k) of partitions of k^n into parts that are at most n with at least one part of each size; square array A(n,k), n>=0, k>=0, read by antidiagonals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Formula