A183610 -id:A183610 - cp's OEIS frontend

A036038 Triangle of multinomial coefficients.

1, 1, 2, 1, 3, 6, 1, 4, 6, 12, 24, 1, 5, 10, 20, 30, 60, 120, 1, 6, 15, 20, 30, 60, 90, 120, 180, 360, 720, 1, 7, 21, 35, 42, 105, 140, 210, 210, 420, 630, 840, 1260, 2520, 5040, 1, 8, 28, 56, 70, 56, 168, 280, 420, 560, 336, 840, 1120, 1680, 2520, 1680, 3360, 5040, 6720

Offset: 1

N. J. A. Sloane

The number of terms in the n-th row is the number of partitions of n, A000041(n). - Amarnath Murthy, Sep 21 2002
For each n, the partitions are ordered according to A-St: first by length and then lexicographically (arranging the parts in nondecreasing order), which is different from the usual practice of ordering all partitions lexicographically. - T. D. Noe, Nov 03 2006
For this ordering of the partitions, for n >= 1, see the remarks and the C. F. Hindenburg link given in A036036. - Wolfdieter Lang, Jun 15 2012
The relation (n+1) * A134264(n+1) = A248120(n+1) / a(n) where the arithmetic is performed for matching partitions in each row n connects the combinatorial interpretations of this array to some topological and algebraic constructs of the two other entries. Also, these seem (cf. MOPS reference, Table 2) to be the coefficients of the Jack polynomial J(x;k,alpha=0). - Tom Copeland, Nov 24 2014
The conjecture on the Jack polynomials of zero order is true as evident from equation a) on p. 80 of the Stanley reference, suggested to me by Steve Kass. The conventions for denoting the more general Jack polynomials J(n,alpha) vary. Using Stanley's convention, these Jack polynomials are the umbral extensions of the multinomial expansion of (s_1*x_1 + s_2*x_2 + ... + s_(n+1)*x_(n+1))^n in which the subscripts of the (s_k)^j in the symmetric monomial expansions are finally ignored and the exponent dropped to give s_j(alpha) = j-th row polynomial of A094638 or |A008276| in ascending powers of alpha. (The MOPS table has some inconsistency between n = 3 and n = 4.) - Tom Copeland, Nov 26 2016

			1;
1, 2;
1, 3,  6;
1, 4,  6, 12, 24;
1, 5, 10, 20, 30, 60, 120;
1, 6, 15, 20, 30, 60,  90, 120, 180, 360, 720;

Abramowitz and Stegun, Handbook, p. 831, column labeled "M_1".

David W. Wilson, Table of n, a(n) for n = 1..11731 (rows 1 through 26).
Milton Abramowitz and Irene A. Stegun, editors, Multinomials: M_1, M_2 and M_3, Handbook of Mathematical Functions, December 1972, pp. 831-2.
T. Copeland, Witt Differential Generator for Special Jack Symmetric Functions / Polynomials, 2016.
I. Dumitriu, A. Edelman, G. Schuman, MOPS: Multivariate orthogonal polynomials (symbolically), arxiv:0409066 [math-ph], 2004.
Wolfdieter Lang, First 10 rows and more.
R. Stanley, Some combinatorial properties of Jack symmetric functions, Adv. in Math., 77, p. 76-115, 1989.

Cf. A036036-A036040. Different from A078760. Row sums give A005651.
Cf. A183610 is a table of sums of powers of terms in rows.
Cf. A134264 and A248120.
Cf. A008275, A008276, A094638, A248927.
Cf. A096162 for connections to A130561.

nmax:=7: with(combinat): for n from 1 to nmax do P(n):=sort(partition(n)): for r from 1 to numbpart(n) do B(r):=P(n)[r] od: for m from 1 to numbpart(n) do s:=0: j:=0: while sA036038(n, m) := n!/ (mul((t!)^q(t), t=1..n)); od: od: seq(seq(A036038(n, m), m=1..numbpart(n)), n=1..nmax); # Johannes W. Meijer, Jul 14 2016

Flatten[Table[Apply[Multinomial, Reverse[Sort[IntegerPartitions[i],  Length[ #1]>Length[ #2]&]], {1}], {i,9}]] (* T. D. Noe, Nov 03 2006 *)

def ASPartitions(n, k):
    Q = [p.to_list() for p in Partitions(n, length=k)]
    for q in Q: q.reverse()
    return sorted(Q)
def A036038_row(n):
    return [multinomial(p) for k in (0..n) for p in ASPartitions(n, k)]
for n in (1..10): print(A036038_row(n))
# Peter Luschny, Dec 18 2016, corrected Apr 30 2022

The n-th row is the expansion of (x_1 + x_2 + ... + x_(n+1))^n in the basis of the monomial symmetric polynomials (m.s.p.). E.g., (x_1 + x_2 + x_3 + x_4)^3 = m[3](x_1,..,x_4) + 3*m[1,2](x_1,..,x_4) + 6*m[1,1,1](x_1,..,x_4) = (Sum_{i=1..4} x_i^3) + 3*(Sum_{i,j=1..4;i != j} x_i^2 x_j) + 6*(Sum_{i,j,k=1..4;i < j < k} x_i x_j x_k). The number of indeterminates can be increased indefinitely, extending each m.s.p., yet the expansion coefficients remain the same. In each m.s.p., unique combinations of exponents and subscripts appear only once with a coefficient of unity. Umbral reduction by replacing x_k^j with x_j in the expansions gives the partition polynomials of A248120. - Tom Copeland, Nov 25 2016
From Tom Copeland, Nov 26 2016: (Start)
As an example of the umbral connection to the Jack polynomials: J(3,alpha) = (Sum_{i=1..4} x_i^3)*s_3(alpha) + 3*(Sum_{i,j=1..4;i!=j} x_i^2 x_j)*s_2(alpha)*s_1(alpha)+ 6*(Sum_{i,j,k=1..4;i < j < k} x_i x_j x_k)*s_1(alpha)*s_1(alpha)*s_1(alpha) = (Sum_{i=1..4} x_i^3)*(1+alpha)*(1+2*alpha)+ 3*(sum_{i,j=1..4;i!=j} x_i^2 x_j)*(1+alpha) + 6*(Sum_{i,j,k=1..4;i < j < k} x_i x_j x_k).
See the Copeland link for more relations between the multinomial coefficients and the Jack symmetric functions. (End)

More terms from David W. Wilson and Wouter Meeussen

A183240 Sums of the squares of multinomial coefficients.

Original entry on oeis.org

1, 1, 5, 46, 773, 19426, 708062, 34740805, 2230260741, 180713279386, 18085215373130, 2188499311357525, 315204533416762046, 53270712928769375885, 10441561861586014363349, 2349364090881443819316871, 601444438364480313663234821, 173817677082622796179263021770

Offset: 0

Paul D. Hanna, Jan 03 2011

nonn

Equals sums of the squares of terms in rows of the triangle of multinomial coefficients (A036038).
Ignoring initial term, equals the logarithmic derivative of A183241; A183241 is conjectured to consist entirely of integers.
More generally, let {M(n,k), n>=0} be the sums of the k-th powers of the multinomial coefficients where k>=0 (see table A183610), then:
Sum_{n>=0} M(n,k)*x^n/n!^k = Product_{n>=1} 1/(1-x^n/n!^k).

			G.f.: A(x) = 1 + x + 5*x^2/2!^2 + 46*x^3/3!^2 + 773*x^4/4!^2 +...
A(x) = 1/((1-x)*(1-x^2/2!^2)*(1-x^3/3!^2)*(1-x^4/4!^2)*...).
...
After the initial term a(0)=1, the next several terms are
a(1) = 1^2 = 1,
a(2) = 1^2 + 2^2 = 5,
a(3) = 1^2 + 3^2 + 6^2 = 46,
a(4) = 1^2 + 4^2 + 6^2 + 12^2 + 24^2 = 773,
a(5) = 1^2 + 5^2 + 10^2 + 20^2 + 30^2 + 60^2 + 120^2 = 19426,
and continue with the sums of squares of the terms in triangle A036038.

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

Cf. A036038, A005651, A183235, A183236, A183237, A183238; A183241.

Cf. A183610 (table of sums of powers of multinomial coefficients).

b:= proc(n, i) option remember; `if`(n=0 or i=1, 1,
      b(n-i, min(n-i, i))/i!^2+b(n, i-1))
    end:
a:= n-> n!^2*b(n$2):
seq(a(n), n=0..21);  # Alois P. Heinz, Sep 11 2019

t=Table[Apply[Multinomial, Reverse[Sort[IntegerPartitions[i], Length[#1] > Length[#2] &]], {1}], {i, 30}]^2; Plus@@@t (* From Tony D. Noe *)
b[n_, i_] := b[n, i] = If[n == 0 || i == 1, 1,
     b[n - i, Min[n - i, i]]/i!^2 + b[n, i - 1]];
a[n_] := n!^2 b[n, n];
a /@ Range[0, 21] (* Jean-François Alcover, Jun 04 2021, after Alois P. Heinz *)

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

G.f.: Sum_{n>=0} a(n)*x^n/n!^2 = Product_{n>=1} 1/(1-x^n/n!^2).

a(n) ~ c * (n!)^2, where c = Product_{k>=2} 1/(1-1/(k!)^2) = 1.37391178018464563291052028168404977854977270679629932106310942272080844... . - Vaclav Kotesovec, Feb 19 2015

Terms following a(7) computed by T. D. Noe.

A326322 Square array A(n,k), n>=0, k>=0, read by antidiagonals: A(n,k) = sum of the k-th powers of multinomials M(n; mu), where mu ranges over all compositions of n.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 1, 3, 4, 1, 1, 5, 13, 8, 1, 1, 9, 55, 75, 16, 1, 1, 17, 271, 1077, 541, 32, 1, 1, 33, 1459, 19353, 32951, 4683, 64, 1, 1, 65, 8263, 395793, 2699251, 1451723, 47293, 128, 1, 1, 129, 48115, 8718945, 262131251, 650553183, 87054773, 545835, 256

Offset: 0

Alois P. Heinz, Sep 11 2019

For k>=1, A(n,k) is the number of k-tuples (p_1,p_2,...,p_k) of ordered set partitions of [n] such that the sequence of block lengths in each ordered partition p_i is identical. Equivalently, A(n,k) is the number of chains from s to t where [s,t] is any n-interval in the binomial poset B_k = B*B*...*B (k times), B is the lattice of all finite subsets of {1,2,...} ordered by inclusion and * is the Segre product. See Stanley reference. - Geoffrey Critzer, Dec 16 2020

			A(2,2) = M(2; 2)^2 + M(2; 1,1)^2 = 1 + 4 = 5.
Square array A(n,k) begins:
   1,   1,     1,       1,         1,           1, ...
   1,   1,     1,       1,         1,           1, ...
   2,   3,     5,       9,        17,          33, ...
   4,  13,    55,     271,      1459,        8263, ...
   8,  75,  1077,   19353,    395793,     8718945, ...
  16, 541, 32951, 2699251, 262131251, 28076306251, ...

R. P. Stanley, Enumerative Combinatorics, Vol. I, second edition, Example 3.18.3d page 322.

Alois P. Heinz, Antidiagonals n = 0..60, flattened
Wikipedia, Multinomial coefficients

Columns k=0-2 give: A011782, A000670, A102221.
Rows n=0+1, 2 give A000012, A000051.
Main diagonal gives A326321.
Cf. A183610.

b:= proc(n, k) option remember; `if`(n=0, 1,
      add(b(n-i, k)/i!^k, i=1..n))
    end:
A:= (n, k)-> n!^k*b(n, k):
seq(seq(A(n, d-n), n=0..d), d=0..12);
# second Maple program:
A:= proc(n, k) option remember; `if`(n=0, 1,
      add(binomial(n, j)^k*A(j, k), j=0..n-1))
    end:
seq(seq(A(n, d-n), n=0..d), d=0..12);

A[n_, k_] := A[n, k] = If[n==0, 1, Sum[Binomial[n, j]^k A[j, k], {j, 0, n-1}]];
Table[Table[A[n, d - n], {n, 0, d}], {d, 0, 12}] // Flatten  (* Jean-François Alcover, Dec 03 2020, after 2nd Maple program *)

Let E_k(x) = Sum_{n>=0} x^n/n!^k. Then 1/(2-E_k(x)) = Sum_{n>=0} A(n,k)*x^n/n!^k. - Geoffrey Critzer, Dec 16 2020

A215910 a(n) = sum of the n-th power of the multinomial coefficients in row n of triangle A036038.

Original entry on oeis.org

1, 1, 5, 244, 354065, 25688403126, 141528428949437282, 83257152559805973052807833, 7012360438832401192319979008881500417, 109324223115831487504443410090345278639832867784010, 396327911646787133737309113762487915762995734538047874429637296650

Offset: 0

Paul D. Hanna, Aug 26 2012

nonn

			The sums of the n-th power of multinomial coefficients in row n of triangle A036038 begin:
a(1) = 1^1 = 1;
a(2) = 1^2 + 2^2 = 5;
a(3) = 1^3 + 3^3 + 6^3 = 244;
a(4) = 1^4 + 4^4 + 6^4 + 12^4 + 24^4 = 354065;
a(5) = 1^5 + 5^5 + 10^5 + 20^5 + 30^5 + 60^5 + 120^5 = 25688403126;
a(6) = 1^6 + 6^6 + 15^6 + 20^6 + 30^6 + 60^6 + 90^6 + 120^6 + 180^6 + 360^6 + 720^6 = 141528428949437282;
a(7) = 1^7 + 7^7 + 21^7 + 35^7 + 42^7 + 105^7 + 140^7 + 210^7 + 210^7 + 420^7 + 630^7 + 840^7 + 1260^7 + 2520^7 + 5040^7 = 83257152559805973052807833; ...
which also form a logarithmic generating function of an integer series:
L(x) = x + 5*x^2/2 + 244*x^3/3 + 354065*x^4/4 + 25688403126*x^5/5 +...
where
exp(L(x)) = 1 + x + 3*x^2 + 84*x^3 + 88602*x^4 + 5137769389*x^5 +...+ A215911(n)*x^n +...

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

Cf. A183610, A036038, A036740, A005651, A183240, A183235, A183236, A183237, A183238; A215911.

Cf. A326321.

b:= proc(n, i, k) option remember; `if`(n=0 or i=1, 1,
      b(n-i, min(n-i, i), k)/i!^k+b(n, i-1, k))
    end:
a:= n-> n!^n*b(n$3):
seq(a(n), n=0..12);  # Alois P. Heinz, Sep 11 2019

b[n_, i_, k_] := b[n, i, k] = If[n == 0 || i == 1, 1, b[n - i, Min[n - i, i], k]/i!^k + b[n, i - 1, k]];
a[n_] := n!^n b[n, n, n];
a /@ Range[0, 12] (* Jean-François Alcover, Nov 01 2020, after Alois P. Heinz *)

{a(n)=n!^n*polcoeff(1/prod(m=1, n, 1-x^m/m!^n +x*O(x^n)), n)}
for(n=1,15,print1(a(n),", "))

a(n) = [x^n/n!^n] * Product_{k=1..n} 1/(1 - x^k/k!^n) for n>=1, with a(0)=1.
Logarithmic derivative of A215911, ignoring the initial term a(0).
a(n) ~ (n!)^n = A036740(n). - Vaclav Kotesovec, Feb 19 2015
a(n) ~ 2^(n/2) * Pi^(n/2) * n^(n*(2*n+1)/2) / exp(n^2 - 1/12). - Vaclav Kotesovec, Feb 19 2015

A215915 E.g.f.: exp( Sum_{n>=1} A000041(n)*x^n/n ), where A000041(n) is the number of partitions of n.

Original entry on oeis.org

1, 1, 3, 13, 79, 579, 5209, 53347, 628257, 8223481, 119473291, 1893056781, 32677209103, 606930554923, 12109058077809, 257638964244739, 5830359141736129, 139638723615395697, 3531794326401241747, 93977250969358226701, 2625647922067519041231, 76809884197769914248211

Offset: 0

Paul D. Hanna, Aug 26 2012

nonn

Note that exp( Sum_{k>=1} A183610(n,k)*x^k/k ) is an integer series for row n>=1; the partition numbers, which forms row 0 of table A183610, is the exception.

			G.f.: A(x) = 1 + x + 3*x^2/2! + 13*x^3/3! + 79*x^4/4! + 579*x^5/5! + 5209*x^6/6! +  ...
such that log(A(x)) = x + 2*x^2/2 + 3*x^3/3 + 5*x^4/4 + 7*x^5/5 + 11*x^6/6 + 15*x^7/7 + 22*x^8/8 + ... + A000041(n)*x^n/n + ...

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

Cf. A183610, A000041, A058892, A293731, A293839.

nmax = 20; CoefficientList[Series[E^Sum[PartitionsP[k]*x^k/k, {k, 1, nmax}], {x, 0, nmax}], x] * Range[0, nmax]! (* Vaclav Kotesovec, Oct 18 2017 *)

a(n):=if n=0 then 1 else (n-1)!*sum(num_partitions(i+1)*a(n-i-1)/(n-i-1)!,i,0,n-1); /* Vladimir Kruchinin, Feb 27 2015 */

{a(n)=n!*polcoeff(exp(sum(m=1,n+1,numbpart(m)*x^m/m+x*O(x^n))),n)}
for(n=0,31,print1(a(n),", "))

a(n) = (n-1)!*sum(p(i+1)*a(n-i-1)/(n-i-1)!,i,0,n-1), a(0)=1, where p(i) is the number of partitions of n. - Vladimir Kruchinin, Feb 27 2015

cp's OEIS Frontend

A036038 Triangle of multinomial coefficients.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

Sage

Formula

Extensions

A183240 Sums of the squares of multinomial coefficients.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

Extensions

A326322 Square array A(n,k), n>=0, k>=0, read by antidiagonals: A(n,k) = sum of the k-th powers of multinomials M(n; mu), where mu ranges over all compositions of n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A215910 a(n) = sum of the n-th power of the multinomial coefficients in row n of triangle A036038.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A215915 E.g.f.: exp( Sum_{n>=1} A000041(n)*x^n/n ), where A000041(n) is the number of partitions of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Maxima

PARI

Formula