A027186 Triangular array E by rows: E(n,k) = number of partitions of n into an even number of parts, the least being k.

0, 1, 0, 1, 0, 0, 2, 1, 0, 0, 2, 1, 0, 0, 0, 4, 1, 1, 0, 0, 0, 5, 1, 1, 0, 0, 0, 0, 8, 2, 1, 1, 0, 0, 0, 0, 10, 2, 1, 1, 0, 0, 0, 0, 0, 16, 3, 1, 1, 1, 0, 0, 0, 0, 0, 20, 4, 1, 1, 1, 0, 0, 0, 0, 0, 0, 29, 6, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0, 37, 7, 2, 1, 1, 1, 0, 0, 0, 0

Offset

1,7

Links

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

Formula

E(n, k) = O(n-k, k)+O(n-k, k+1)+...+O(n-k, n-k), for 2<=2k<=n, O given by A027185.

Example

 0,
 1, 0,
 1, 0, 0,
 2, 1, 0, 0,
 2, 1, 0, 0, 0,
 4, 1, 1, 0, 0, 0,
 5, 1, 1, 0, 0, 0, 0,
 8, 2, 1, 1, 0, 0, 0, 0,
10, 2, 1, 1, 0, 0, 0, 0, 0,
16, 3, 1, 1, 1, 0, 0, 0, 0, 0,
20, 4, 1, 1, 1, 0, 0, 0, 0, 0, 0,
29, 6, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0,
37, 7, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0,

Crossrefs

Cf. A027185.

Sequence in context: A124300 A154326 A330460 * A131962 A302236 A262929

Adjacent sequences: A027183 A027184 A027185 * A027187 A027188 A027189

Keyword

nonn,tabl

Author

Clark Kimberling

Status

approved