%I A132312
%S A132312 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 A132312 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 A132312 1411,3479,3980,3479,1411,189,10,1,1,11,300,4138,16293,26555,26555
%N A132312 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 A132312 T(n,k) = T(n,n-k);
%C A132312 T(n,0) = 1 for n>0;
%C A132312 A000009(n) - 1 <= T(n,1) <= A000009(n) for n>1;
%H A132312 <a href="Sindx_Pas.html#Pascal">Index entries for triangles and arrays 
               related to Pascal's triangle</a>
%e A132312 T(9,1) = A000009(9)-1 = 7;
%e A132312 A007318(5,2) = A007318(10,1) = 10:
%e A132312 T(5,2) = #{6+4, 6+3+1, 4+3+2+1} = 3,
%e A132312 but T(10,1) = A000009(10) = 10.
%Y A132312 Cf. A132311, A007318, A126257, A014631.
%Y A132312 Sequence in context: A123548 A131838 A038529 this_sequence A090431 A107336 
               A156613
%Y A132312 Adjacent sequences: A132309 A132310 A132311 this_sequence A132313 A132314 
               A132315
%K A132312 nonn,tabl
%O A132312 0,17
%A A132312 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 18 2007