I am trying to prove the following equality $$ \sum_{r=k}^{n}\binom{2n+1}{2r+1}\binom{r}{k}=\binom{2n-k}{k}2^{2n-2k}~~;~k\le n. $$ I noticed that for $k=0$ it becomes $$ \sum_{r=0}^{n}\binom{2n+1}{2r+1}=2^{2n}, $$ which is well known equality. Also have I tried to use the equality $$ \sum_{r=k}^{n}\binom{n}{r}\binom{r}{k}=\binom{n}{k}2^{n-k}, $$ but with no success.
Any hints and suggestions would be appreciated.
Thanks!
We have: $$ \sum_{r=0}^{n}\binom{2n+1}{2r+1}z^{2r} = \frac{(1+z)^{2n+1}-(1-z)^{2n+1}}{2z}\tag{1}$$ so the given identity can be proved by replacing $z$ with $\sqrt{w}$: $$ \sum_{r=0}^{n}\binom{2n+1}{2r+1}w^{r} = \frac{(1+\sqrt{w})^{2n+1}-(1-\sqrt{w})^{2n+1}}{2\sqrt{w}}\tag{2}$$ and differentiating $k$ times both sides of $(2)$, then evaluating in $w=1$. Notice that the RHS of $(2)$ is someway related to Fibonacci-like numbers; if we set: $$ A_{2n+1}(w)\triangleq\frac{(1+\sqrt{w})^{2n+1}-(1-\sqrt{w})^{2n+1}}{2\sqrt{w}} $$ we have: $$ A_0(w)=0,\qquad A_1(w)=1,\qquad A_{n+2}(w) = 2\cdot A_{n+1}(w)-(1-w)\cdot A_n(w).\tag{3}$$