Define a recursion $a(n,k)$ that gives the number of ways to choose $n$ items out of $k$ types of items, with the condition that we must choose $2, 4$, or $6$ items of each type.
So $2p+4q+6r = n$ and $p+q+r = k$ but as to the recursion I am lost. Any help is appreciated!