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

0, 1, 1, 0, 1, 1, 1, 2, 3, 3, 0, 1, 2, 3, 3, 1, 2, 4, 5, 6, 6, 0, 2, 3, 5, 6, 7, 7, 1, 3, 6, 8, 10, 11, 12, 12, 0, 2, 5, 8, 10, 12, 13, 14, 14, 1, 3, 8, 12, 16, 18, 20, 21, 22, 22, 0, 3, 7, 13, 17, 21, 23, 25, 26, 27, 27, 1, 4, 11, 18, 25, 30, 34, 36, 38

Offset: 1

Author

Clark Kimberling

Keywords

• nonn
• tabl

Links

• Paul Barry, Extensions of Riordan Arrays and Their Applications, Mathematics (2025) Vol. 13, No. 2, 242. See p. 20.

Crossrefs

Cf. A026921.

Formula

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