A026931 Triangular array T read by rows: T(n,k) = number of partitions of n into an odd number of parts, each <= k.

1, 0, 1, 1, 1, 2, 0, 1, 1, 2, 1, 2, 3, 3, 4, 0, 2, 3, 4, 4, 5, 1, 2, 5, 6, 7, 7, 8, 0, 2, 4, 7, 8, 9, 9, 10, 1, 3, 7, 10, 13, 14, 15, 15, 16, 0, 3, 6, 11, 14, 17, 18, 19, 19, 20, 1, 3, 9, 14, 20, 23, 26, 27, 28, 28, 29, 0, 3, 8, 16, 22, 28, 31, 34, 35, 36

Offset

1,6

Links

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

Formula

T(n, k) = Sum_{i=1..k} A026920(n, i).

Crossrefs

Sequence in context: A259920 A364334 A048881 * A339823 A127506 A353433

Adjacent sequences: A026928 A026929 A026930 * A026932 A026933 A026934

Keyword

nonn,tabl

Author

Clark Kimberling

Status

approved