|
%I #17 Jul 24 2020 21:59:50
%S 1,1,1,2,1,2,1,4,1,4,6,1,6,6,1,6,12,1,8,18,1,8,24,24,1,10,30,24,1,10,
%T 42,48,1,12,48,72,1,12,60,120,1,14,72,144,120,1,14,84,216,120,1,16,96,
%U 264,240,1,16,114,360,360,1,18,126,432,600,1,18,144,552,840
%N Triangular array read by rows: T(n,k) is the number of compositions of n into exactly k distinct parts.
%C Same as A072574, with zeros dropped. [_Joerg Arndt_, Oct 20 2012]
%C Row sums = A032020.
%C Row n contains A003056(n) = floor((sqrt(8*n+1)-1)/2) terms (number of terms increases by one at each triangular number).
%H Alois P. Heinz, <a href="/A216652/b216652.txt">Rows n = 1..500, flattened</a>
%H B. Richmond and A. Knopfmacher, <a href="http://dx.doi.org/10.1007/BF01827930">Compositions with distinct parts</a>, Aequationes Mathematicae 49 (1995), pp. 86-97.
%F G.f.: Sum_{i>=0} Product_{j=1..i} y*j*x^j/(1-x^j).
%F T(n,k) = A008289(n,k)*k!.
%e Triangle starts:
%e [ 1] 1;
%e [ 2] 1;
%e [ 3] 1, 2;
%e [ 4] 1, 2;
%e [ 5] 1, 4;
%e [ 6] 1, 4, 6;
%e [ 7] 1, 6, 6;
%e [ 8] 1, 6, 12;
%e [ 9] 1, 8, 18;
%e [10] 1, 8, 24, 24;
%e [11] 1, 10, 30, 24;
%e [12] 1, 10, 42, 48;
%e [13] 1, 12, 48, 72;
%e [14] 1, 12, 60, 120;
%e [15] 1, 14, 72, 144, 120;
%e [16] 1, 14, 84, 216, 120;
%e [17] 1, 16, 96, 264, 240;
%e [18] 1, 16, 114, 360, 360;
%e [19] 1, 18, 126, 432, 600;
%e [20] 1, 18, 144, 552, 840;
%e T(5,2) = 4 because we have: 4+1, 1+4, 3+2, 2+3.
%p b:= proc(n, k) option remember; `if`(n<0, 0, `if`(n=0, 1,
%p `if`(k<1, 0, b(n, k-1) +b(n-k, k))))
%p end:
%p T:= (n, k)-> b(n-k*(k+1)/2, k)*k!:
%p seq(seq(T(n, k), k=1..floor((sqrt(8*n+1)-1)/2)), n=1..24); # _Alois P. Heinz_, Sep 12 2012
%t nn=20;f[list_]:=Select[list,#>0&];Map[f,Drop[CoefficientList[Series[ Sum[Product[j y x^j/(1-x^j),{j,1,k}],{k,0,nn}],{x,0,nn}],{x,y}],1]]//Flatten
%Y Cf. A003056, A008289, A072574, A097910.
%K nonn,tabf
%O 1,4
%A _Geoffrey Critzer_, Sep 12 2012
|
