|
%I #10 Oct 02 2020 11:59:27
%S 0,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,2,3,3,2,1,1,4,7,6,7,4,1,1,4,11,14,14,
%T 11,4,1,1,5,28,57,56,57,28,5,1,1,7,73,273,434,434,273,73,7,1,1,10,189,
%U 1411,3479,3980,3479,1411,189,10,1,1,11,300,4138,16293,26555,26555,16293,4138,300,11,1
%N Triangle read by rows: T(n,k) = number of partitions of binomial(n,k) into distinct parts of the first n rows of Pascal's triangle, 0<=k<=n.
%C T(n,k) = T(n,n-k);
%C T(n,0) = 1 for n>0;
%C A000009(n) - 1 <= T(n,1) <= A000009(n) for n>1;
%H Alois P. Heinz, <a href="/A132312/b132312.txt">Rows n = 0..28, flattened</a>
%H <a href="/index/Pas#Pascal">Index entries for triangles and arrays related to Pascal's triangle</a>
%e T(9,1) = A000009(9)-1 = 7;
%e A007318(5,2) = A007318(10,1) = 10:
%e T(5,2) = #{6+4, 6+3+1, 4+3+2+1} = 3,
%e but T(10,1) = A000009(10) = 10.
%t T[n_] := T[n] = Table[Binomial[m, k], {m, 0, n-1}, {k, 0, m}] // Flatten // Union;
%t T[n_, k_] /; k <= n/2 := T[n, k] = Select[ IntegerPartitions[ Binomial[n, k], Length[T[n]], T[n]], Length[#] == Length[Union[#]]&] // Length;
%t T[n_, k_] /; k > n/2 := T[n, k] = T[n, n-k];
%t Table[Print["T[", n, ",", k, "] = ", T[n, k]]; T[n, k], {n, 0, 11}, {k, 0, n}] // Flatten (* _Jean-François Alcover_, Oct 02 2020 *)
%Y Cf. A132311, A007318, A126257, A014631.
%K nonn,tabl
%O 0,17
%A _Reinhard Zumkeller_, Aug 18 2007
|
