A027359 - OEIS

%I #17 Oct 29 2019 22:01:38

%S 1,0,0,0,0,1,0,0,1,1,0,0,0,0,1,0,0,0,0,1,1,0,0,0,0,0,0,1,0,0,0,0,1,1,

%T 2,2,0,0,0,0,1,1,1,1,2,0,0,0,0,0,0,1,1,2,2,0,0,0,0,0,0,1,1,1,1,2,0,0,

%U 0,0,0,0,1,1,2,2,3,3,0,0,0,0,0,0,1,1,2,2,2,2,3,0,0,0,0,0,0,0,0,1,1,2,2,3,3,0,0,0,0,0,0,1,1,2,2,3,3,3,3,4

%N Triangular array T read by rows: T(n,k) = number of partitions of n into distinct odd parts, all <= k.

%H Alois P. Heinz, <a href="/A027359/b027359.txt">Rows n = 1..361, flattened</a>

%F T(n, k) = Sum_{j=1..k} A027356(n, j). - _Sean A. Irvine_, Oct 29 2019

%Y Cf. A027356.

%K nonn,look,tabl

%O 1,35

%A _Clark Kimberling_