A026840 Triangular array T read by rows: T(n,k) = number of partitions of n into distinct parts <= k, for k=1,2,...n.

1, 0, 1, 0, 1, 2, 0, 0, 1, 2, 0, 0, 1, 2, 3, 0, 0, 1, 2, 3, 4, 0, 0, 0, 2, 3, 4, 5, 0, 0, 0, 1, 3, 4, 5, 6, 0, 0, 0, 1, 3, 5, 6, 7, 8, 0, 0, 0, 1, 3, 5, 7, 8, 9, 10, 0, 0, 0, 0, 2, 5, 7, 9, 10, 11, 12, 0, 0, 0, 0, 2, 5, 8, 10, 12, 13, 14, 15, 0, 0, 0, 0, 1, 4, 8, 11

Offset

1,6

Links

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

Crossrefs

Cf. A026836.

Differs from A079126 in having fewer zeros at the ends of the rows.

Sequence in context: A130731 A287240 A025875 * A357648 A025873 A208589

Adjacent sequences: A026837 A026838 A026839 * A026841 A026842 A026843

Keyword

nonn,tabl

Author

Clark Kimberling

Status

approved