The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A309972 Product of multinomial coefficients M(n;lambda), where lambda ranges over all partitions of n. 3

%I

%S 1,1,2,18,6912,216000000,1632586752000000000,

%T 498266101635303733401600000000000,

%U 1140494258799407218656986754465090350453096448000000000000000

%N Product of multinomial coefficients M(n;lambda), where lambda ranges over all partitions of n.

%H Alois P. Heinz, <a href="/A309972/b309972.txt">Table of n, a(n) for n = 0..14</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Multinomial_theorem#Multinomial_coefficients">Multinomial coefficients</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_(number_theory)">Partition (number theory)</a>

%F a(n) = Product_{k=1..A000041(n)} A036038(n,k).

%F a(n) = A309951(n,A000041(n)).

%e a(3) = M(3;3) * M(3;2,1) * M(3;1,1,1) = 1 * 3 * 6 = 18.

%p b:= proc(n, i) option remember; `if`(n=0 or i=1, [n!], [map(t->

%p binomial(n, i)*t, b(n-i, min(n-i, i)))[], b(n, i-1)[]])

%p end:

%p a:= n-> mul(i, i=b(n\$2)):

%p seq(a(n), n=0..9); # _Alois P. Heinz_, Aug 25 2019

%t b[n_, i_] := b[n, i] = If[n == 0 || i == 1, {n!}, Join[Binomial[n, i] #& /@ b[n - i, Min[n - i, i]], b[n, i - 1]]];

%t a[n_] := Times @@ b[n, n];

%t a /@ Range[0, 9] (* _Jean-François Alcover_, Dec 07 2020, after _Alois P. Heinz_ *)

%Y Rightmost terms in rows of A309951.

%Y Cf. A000041, A005651, A036038, A078760, A210237.

%K nonn

%O 0,3

%A _Alois P. Heinz_, Aug 25 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 12 08:13 EDT 2021. Contains 344943 sequences. (Running on oeis4.)