There is binomial expression(s) written as $$\sum_{n\geqslant0}\frac{(-3n+2k-3)n!^2}{2(2n+1)(k-1)!^2(n-k+1)!^2 \binom{2n}{n}}=\begin{cases} 0 & \text{if $k=0$,} \\ -1 & \text{if $k\geqslant1$,} \end{cases}$$
which simplifies to $$\sum_{n\geqslant0}\frac{(3n-2k+1)\binom{n}{k}^2}{(2n+1) \binom{2n}{n}}=2\quad\text{for all $k\geqslant0$.}$$ Logically this looks like a physical impossibility. Would anyone believe that there is any way this could be true and if so how would one go about proving this paradox or seemingly impossibility.