Consider this sum: for context sake, the summand appears in the counting of the possible ways to have one cigarette box empty and the other having left N cigarettes when both boxes start with N cigarettes in the Banach cigarette problem ; so there is a combinatorial explanation which I do not consider here.
$$ \sum_{i=0}^{N} \binom{2N-i}{N} 2^i = 2^{2N} $$
I wish to know how one would go about finding this closed form using generating functions. More precisely, how would you evaluate
$$ \sum_{N \geq i} \binom{2N-i}{N} x^N $$
Thanks!