|
%I #20 May 06 2020 05:00:46
%S 1,1,3,10,47,246,1602,11271,93767,847846,8618738,94966191,1149277802,
%T 14946737339,210112991441,3152429219400,50538450211103,
%U 859238687076542,15481605986593038,294161321911723167,5886118362589143742,123610854463260840735,2720101086040978435931
%N Sum of all distinct multinomial coefficients M(n;lambda), where lambda ranges over the partitions of n.
%C Differs from A005651 first at n = 7: a(n) = 11271 < 11481 = A005651(7).
%H Alois P. Heinz, <a href="/A325308/b325308.txt">Table of n, a(n) for n = 0..90</a>
%H Milton Abramowitz and Irene A. Stegun, <a href="http://www.cs.bham.ac.uk/~aps/research/projects/as/book.php">Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables</a>, National Bureau of Standards (Applied Mathematics Series, 55), 1964; see pp. 831-832 for the multinomial coefficients of integer partitions of n = 1..10.
%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>.
%p g:= proc(n, i) option remember; `if`(n=0 or i=1, {n!}, {map(x->
%p binomial(n, i)*x, g(n-i, min(n-i, i)))[], g(n, i-1)[]})
%p end:
%p a:= n-> add(i, i=g(n$2)):
%p seq(a(n), n=0..23);
%t g[n_, i_] := g[n, i] = If[n == 0 || i == 1, {n!}, Union[Map[Function[x, Binomial[n, i] x], g[n - i, Min[n - i, i]]], g[n, i - 1]]];
%t a[n_] := Total[g[n, n]];
%t a /@ Range[0, 23] (* _Jean-François Alcover_, May 06 2020, after Maple *)
%Y Column k=1 of A325305.
%Y Cf. A005651.
%K nonn
%O 0,3
%A _Alois P. Heinz_, Sep 05 2019
|
