|
%I #31 May 01 2017 14:30:39
%S 1,2,2,3,5,10,2,50,27,116,60,2,560,315,142,1730,2268,282,6123,14742,
%T 1073,30122,72180,12600,2,116908,464640,97020,32034,507277,2676366,
%U 997920,2,2492737,16400098,8751600,136853,15328119,94209206,81225144,1527528,56182092,673282610,614128515,37837800
%N Triangular array read by rows: T(n,k) is the number of set partitions of {1,2,...,n} that have exactly k distinct block sizes.
%C Column 1 = A038041.
%C Column 2 = A088142.
%C Column 3 = A133118.
%C Row sums = A000110 (Bell numbers).
%C Row n has floor([sqrt(1+8n)-1]/2) terms (number of terms increases by one at each triangular number). - _Franklin T. Adams-Watters_, Feb 26 2012
%H Alois P. Heinz, <a href="/A208437/b208437.txt">Rows n = 1..220, flattened</a>
%H Philippe Flajolet and Robert Sedgewick, <a href="http://algo.inria.fr/flajolet/Publications/AnaCombi/anacombi.html">Analytic Combinatorics</a>, Cambridge Univ. Press, 2009, page 180.
%F E.g.f.: Product_{i>=1} 1 + y *(exp(x^i/i!)-1).
%F T(n*(n+1)/2,n) = A022915(n). - _Alois P. Heinz_, Apr 08 2016
%e : 1;
%e : 2;
%e : 2, 3;
%e : 5, 10;
%e : 2, 50;
%e : 27, 116, 60;
%e : 2, 560, 315;
%e : 142, 1730, 2268;
%e : 282, 6123, 14742;
%e : 1073, 30122, 72180, 12600;
%p with(combinat):
%p b:= proc(n, i) option remember; expand(`if`(n=0, 1,
%p `if`(i<1, 0, add(multinomial(n, n-i*j, i$j)/j!*
%p b(n-i*j, i-1)*`if`(j=0, 1, x), j=0..n/i))))
%p end:
%p T:= n-> (p-> seq(coeff(p, x, i), i=1..degree(p)))(b(n$2)):
%p seq(T(n), n=1..16); # _Alois P. Heinz_, Aug 21 2014
%t nn = 15; p = Product[1 + y (Exp[x^i/i!] - 1), {i, 1, nn}];f[list_] := Select[list, # > 0 &];
%t Map[f, Drop[ Range[0, nn]! CoefficientList[Series[p, {x, 0, nn}], {x, y}], 1]] // Flatten
%Y Cf. A022915, A116608, A218868.
%K nonn,tabf
%O 1,2
%A _Geoffrey Critzer_, Feb 26 2012
|
