MathNet 2016-part-06 — 184 problems (EN–VI) Question 23

Let $n \ge 1$ be an integer. Prove that $\sum_{0 \le k \lt n/2} \binom{n}{2k+1} 13^k$ is divisible by $2^{n-1}$.