A027360 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

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

(list; table; graph; refs; listen; history; text; internal format)

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