cp's OEIS Frontend

A210237 Triangle of distinct values M(n) of multinomial coefficients for partitions of n in increasing order of n and M(n).

%I A210237 #33 Aug 26 2019 17:53:31
%S A210237 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,
%T A210237 180,360,720,1,7,21,35,42,105,140,210,420,630,840,1260,2520,5040,1,8,
%U A210237 28,56,70,168,280,336,420,560,840,1120,1680,2520,3360,5040,6720
%N A210237 Triangle of distinct values M(n) of multinomial coefficients for partitions of n in increasing order of n and M(n).
%C A210237 Differs from A036038 after a(37). To illustrate where the difference comes from, consider 4,1,1,1 and 3,2,2 are two different partitions of 7 having the same value of multinomial coefficient M(n)=n!/(m1!*m2!*...*mk!)=210.
%C A210237 There is no known formula for M(n) sequence, however the asymptotic behavior has been studied, see the paper by Andrews, Knopfmacher, and Zimmermann.
%C A210237 The number of terms per row (for each value of n starting with n=1) forms sequence A070289.
%H A210237 Alois P. Heinz, <a href="/A210237/b210237.txt">Rows n = 1..29, flattened</a>
%H A210237 George E. Andrews, Arnold Knopfmacher, and Burkhard Zimmermann, <a href="http://arxiv.org/abs/math/0509470">On the Number of Distinct Multinomial Coefficients</a>, arXiv:math/0509470 [math.CO], 2005.
%H A210237 Sergei Viznyuk, <a href="http://phystech.com/ftp/s_A210237.c">C-program</a> for the sequence
%e A210237 Trianglebegins:
%e A210237   1;
%e A210237   1, 2;
%e A210237   1, 3,  6;
%e A210237   1, 4,  6, 12, 24;
%e A210237   1, 5, 10, 20, 30,  60, 120;
%e A210237   1, 6, 15, 20, 30,  60,  90, 120, 180, 360, 720;
%e A210237   1, 7, 21, 35, 42, 105, 140, 210, 420, 630, 840, 1260, 2520, 5040;
%e A210237   ...
%e A210237 Thus for n=4 (fourth row) the distinct values of multinomial coefficients are:
%e A210237   4!/(4!) = 1
%e A210237   4!/(3!1!) = 4
%e A210237   4!/(2!2!) = 6
%e A210237   4!/(2!1!1!) = 12
%e A210237   4!/(1!1!1!1!) = 24
%p A210237 b:= proc(n, i) option remember; `if`(n=0 or i<2, {1},
%p A210237       {seq(map(x-> x*i!^j, b(n-i*j, i-1))[], j=0..n/i)})
%p A210237     end:
%p A210237 T:= n-> sort([map(x-> n!/x, b(n, n))[]])[]:
%p A210237 seq(T(n), n=1..10);  # _Alois P. Heinz_, Aug 13 2012
%t A210237 b[n_, i_] := b[n, i] = If[n==0 || i<2, {1}, Union[Flatten @ Table[(#*i!^j&) /@ b[n-i*j, i-1], {j, 0, n/i}]]]; T[n_] := Sort[Flatten[n!/#& /@ b[n, n]] ]; Table[T[n], {n, 1, 10}] // Flatten (* _Jean-François Alcover_, Feb 05 2017, after _Alois P. Heinz_ *)
%Y A210237 Cf. A036038, A210238, A078760, A209936, A080577, A070289.
%K A210237 nonn,tabf
%O A210237 1,3
%A A210237 _Sergei Viznyuk_, Mar 18 2012