# Sum of binomial coefficients with index divisible by 4

I am trying to obtain a closed form expression for $$\sum {n \choose 4k}$$

I am trying to use the binomial expansion of $$(1 + i)^n$$ and $$(1 - i)^n$$. $$(1 + i)^n + (1 - i)^n = 2\left(\sum {n \choose 4k} -\sum {n \choose 4k + 2}\right)$$ Stuck at this now. I can't come up with a way to simplify the second term on RHS. Any help would be appreciated.

• Brute-force on the small N and find this sequence on the OEIS? – kotomord Nov 8 '16 at 12:23
• oeis.org/… - your sequence – kotomord Nov 8 '16 at 12:36

We have the followings :

$$(1+1)^n=\binom n0+\binom n1+\binom n2+\binom n3+\binom n4+\binom n5+\cdots$$ $$(1-1)^n=\binom n0-\binom n1+\binom n2-\binom n3+\binom n4-\binom n5+\cdots$$ $$(1+i)^n=\binom n0+\binom n1i-\binom n2-\binom n3i+\binom n4+\binom n5i-\cdots$$ $$(1-i)^n=\binom n0-\binom n1i-\binom n2+\binom n3i+\binom n4-\binom n5i-\cdots$$

Adding these gives $$(1+1)^n+(1-1)^n+(1+i)^n+(1-i)^n=4\left(\binom n0+\binom n4+\binom n8+\cdots\right)$$ I think that you can continue from here.

• I came up with a slightly different way to approach this. But your way of visualizing is helpful as well. – Deepankar Arya Nov 8 '16 at 12:45

After posting this question, it struck me that

RHS = $4\sum {n \choose 4k} -2\sum {n \choose 4k} -2\sum {n \choose 4k + 2}) = 4\sum {n \choose 4k} - 2 \sum {n \choose 2k} = 4\sum {n \choose 4k} - 2 * 2^{n - 1} = 4\sum {n \choose 4k} - 2^{n} \implies \sum {n \choose 4k} = \frac{(1 + i)^n + (1 - i)^n + 2^n}{4}$


Note tat it yields the correct value when $$\ds{n = 0}$$.

• What is $\delta$ here? – YiFan Feb 7 at 23:10
• @YiFan $\displaystyle\texttt{Kronecker Delta}$: $\displaystyle \delta_{n0} = 1$ if $\displaystyle n = 0$ and $\displaystyle = 0$ otherwise. – Felix Marin Feb 8 at 23:13