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

Links

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

Formula

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

Crossrefs

Sequence in context: A231713 A340945 A224898 * A037806 A038082 A107740

Adjacent sequences: A027357 A027358 A027359 * A027361 A027362 A027363

Keyword

nonn,tabl

Author

Clark Kimberling

Status

approved