%I A132311
%S A132311 0,1,1,1,1,1,1,2,2,1,1,4,7,4,1,1,6,28,28,6,1,1,11,117,318,117,11,1,1,14,
%T A132311 388,3344,3344,388,14,1,1,21,1757,71277,290521,71277,1757,21,1,1,29,
%U A132311 8270,2031198,53679222,53679222,2031198,8270,29,1,1,42,40243
%N A132311 Triangle read by rows: T(n,k) = number of partitions of binomial(n,k) 
               into parts of the first n rows of Pascal's triangle, 0<=k<=n.
%C A132311 T(n,k) = T(n,n-k);
%C A132311 T(n,0) = 1 for n>0;
%C A132311 A000041(n) - 1 <= T(n,1) <= A000041(n) for n>1;
%H A132311 <a href="Sindx_Pas.html#Pascal">Index entries for triangles and arrays 
               related to Pascal's triangle</a>
%e A132311 A007318(4,2) = A007318(6,1) = 6:
%e A132311 T(4,2)=#{3+3,3+2+1,3+1+1+1,2+2+2,2+2+1+1,2+1+1+1+1,1+1+1+1+1+1}=7,
%e A132311 but T(6,1) = A000041(6) = 11.
%Y A132311 Cf. A132312, A007318, A126257, A014631.
%Y A132311 Sequence in context: A140643 A108017 A133135 this_sequence A121697 A124976 
               A113021
%Y A132311 Adjacent sequences: A132308 A132309 A132310 this_sequence A132312 A132313 
               A132314
%K A132311 nonn,tabl
%O A132311 0,8
%A A132311 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 18 2007