Show $\sum_{k=0}^{n}2^{n-k}\binom{a+k}{k}\frac{a-k}{a+k}=\binom{a+n}{n}$ How it can be shown that:

$$\sum_{k=0}^{n}2^{n-k}\binom{a+k}{k}\frac{a-k}{a+k}=\binom{a+n}{n}$$

Where $a \ne 0$

My try:
$$\sum_{k=0}^{n}2^{n-k}\binom{a+k}{k}\frac{a-k}{a+k}=\sum_{k=0}^{n}2^{n-k}\binom{a+k}{a}\frac{a-k}{a+k}$$
$$=\frac{1}{a}\sum_{k=0}^{n}2^{n-k}\binom{a+k-1}{a-1}\left(a-k \right)$$
$$=\sum_{k=0}^{n}2^{n-k}\binom{a+k-1}{a-1}-\frac{1}{a}\color{red}{\sum_{k=0}^{n}2^{n-k}\binom{a+k-1}{a-1}k }$$
On the other hand: 
$$\color{red}{\sum_{k=0}^{n}2^{n-k}\binom{a+k-1}{a-1}k}=\sum_{k=0}^{n}\left(a+k-1\right)2^{n-k}\binom{a+k-2}{k-1}  $$
But computing these expressions takes much time and I think there should be a better way, but I cannot find that way.
Please if it's possible, then do the proof using elementary ways.

I know you would prefer a combinatorial proof and thinks that induction does not tell us anything, but since you would like to know an algebraic proof, I'll just include an inductive proof for completion's sake.
Base case $n = 0$:
$$
\sum_{k=0}^0 2^{-k}{a + k \choose k}\frac{a - k}{a + k} = 2^0 {a \choose 0}\frac{a}{a} = 1 = {a \choose 0}
$$
Assume true for $n = m$. For $n = m+1$:
\begin{align*}
\sum_{k=0}^{m+1} 2^{m+1-k}{a + k \choose k}\frac{a - k}{a + k} &= 2\sum_{k=0}^m, 2^{m-k}{a + k \choose k}\frac{a - k}{a + k} + {a + m + 1 \choose m + 1}\frac{a - m - 1}{a + m + 1} \\
&= 2{a + m \choose m} + {a + m + 1 \choose m + 1}\left(\frac{a - m - 1}{a + m + 1}\right) \\
&= 2\left(\frac{m + 1}{a + m + 1}\right){a + m + 1 \choose m + 1} + \left(\frac{a - m - 1}{a + m + 1}\right) {a + m + 1 \choose m + 1} \\
&= \left(\frac{a - m - 1 + 2(m + 1)}{a + m + 1}\right) {a + m + 1 \choose m + 1} \\
&= {a + m + 1 \choose m + 1}
\end{align*}
This completes the induction.
