A027360 Triangular array T read by rows: T(n,k) = number of partitions of n into distinct odd parts, the greatest being >= k.

1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 1, 1, 0, 2, 2, 2, 2, 2, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 1, 1, 0, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 0, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1

Offset: 1

Author

Clark Kimberling

Keywords

• nonn
• tabl

Formula

T(n, k) = A000700(n) - A027359(n, k-1). - Sean A. Irvine, Oct 29 2019