Counts the number of words (without inverse generators) of length n whose
reduced form in the product of Z2-s (that is, for each generator x we have x^2=1)
has length k
(clearly n and k must have the same parity for this to be nonzero):