A027354 Triangular array T read by rows: T(n,k) = number of partitions into distinct odd parts, the least being <= k.

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

Offset

1,31

Links

Table of n, a(n) for n=1..90.

Formula

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

Crossrefs

Sequence in context: A283655 A262742 A360078 * A192227 A102673 A085297

Adjacent sequences: A027351 A027352 A027353 * A027355 A027356 A027357

Keyword

nonn,tabl

Author

Clark Kimberling

Extensions

Title corrected by Sean A. Irvine, Oct 27 2019

Status

approved