|
%I #26 Mar 11 2022 09:55:23
%S 0,1,3,10,24,59,136,309,682,1493,3223,6904,14675,31013,65202,136512,
%T 284748,592082,1227709,2539516,5241640,10798133,22206568,45597489,
%U 93495667,191464970,391636718,800233551,1633530732,3331568080,6789078236,13824212219,28129459098
%N Sum of parts, counted without multiplicity, in all compositions of n.
%H Alois P. Heinz, <a href="/A336516/b336516.txt">Table of n, a(n) for n = 0..1000</a>
%e a(4) = 1 + 1 + 2 + 1 + 2 + 1 + 2 + 2 + 1 + 3 + 3 + 1 + 4 = 24: (1)111, (1)1(2), (1)(2)1, (2)(1)1, (2)2, (1)(3), (3)(1), (4).
%p b:= proc(n, i, p) option remember; `if`(n=0, [p!, 0],
%p `if`(i<1, 0, add((p-> [0, `if`(j=0, 0, p[1]*i)]+p)(
%p b(n-i*j, i-1, p+j)/j!), j=0..n/i)))
%p end:
%p a:= n-> b(n$2, 0)[2]:
%p seq(a(n), n=0..38);
%t b[n_, i_, p_] := b[n, i, p] = If[n == 0, {p!, 0},
%t If[i < 1, {0, 0}, Sum[Function[{0, If[j == 0, 0, #[[1]]*i]} + #][
%t b[n - i*j, i - 1, p + j]/j!], {j, 0, n/i}]]];
%t a[n_] := b[n, n, 0][[2]];
%t Table[a[n], {n, 0, 38}] (* _Jean-François Alcover_, Mar 11 2022, after _Alois P. Heinz_ *)
%Y Cf. A001787 (all parts), A014153 (the same for partitions), A336511, A336512, A336579, A336875.
%K nonn
%O 0,3
%A _Alois P. Heinz_, Jul 24 2020
|
