|
%I #14 Oct 28 2019 03:17:22
%S 1,0,0,0,0,1,1,1,1,1,0,0,0,0,1,1,1,1,1,1,1,0,0,0,0,0,0,1,1,1,2,2,2,2,
%T 2,2,1,1,1,1,1,1,1,1,2,1,1,2,2,2,2,2,2,2,2,1,1,1,1,1,1,1,1,1,1,2,1,1,
%U 2,2,3,3,3,3,3,3,3,3,2,2,2,2,2,2,2,2,2,2,2,2
%N Triangular array T read by rows: T(n,k) = number of partitions into distinct odd parts, the least being <= k.
%F T(n, k) = Sum_{j=1..k} A027345(n, j). - _Sean A. Irvine_, Oct 27 2019
%K nonn,tabl
%O 1,31
%A _Clark Kimberling_
%E Title corrected by _Sean A. Irvine_, Oct 27 2019
|
