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

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, 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, 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

Offset: 1

Author

Clark Kimberling

Keywords

• nonn
• look
• tabl

Links

• Alois P. Heinz, Rows n = 1..361, flattened

Crossrefs

Cf. A027356.

Formula

T(n, k) = Sum_{j=1..k} A027356(n, j). - Sean A. Irvine, Oct 29 2019