%I #7 Mar 30 2012 18:56:11
%S 1,0,1,0,1,2,0,0,1,2,0,0,1,2,3,0,0,1,2,3,4,0,0,0,2,3,4,5,0,0,0,1,3,4,
%T 5,6,0,0,0,1,3,5,6,7,8,0,0,0,1,3,5,7,8,9,10,0,0,0,0,2,5,7,9,10,11,12,
%U 0,0,0,0,2,5,8,10,12,13,14,15,0,0,0,0,1,4,8,11
%N Triangular array T read by rows: T(n,k) = number of partitions of n into distinct parts <= k, for k=1,2,...n.
%Y Cf. A026836.
%Y Differs from A079126 in having fewer zeros at the ends of the rows.
%K nonn,tabl
%O 1,6
%A _Clark Kimberling_