Let $n \geq 4$ be an even integer and let $k$ be an integer with $1 \leq k \leq n/2$. Consider
strings consisting of $n$ characters, such that
-
each character is an element of $\{a, b, c\}$,
-
the number of $a$'s is equal to $k$, and
-
each $a$ is at an even position.
How many such strings are there?