I am trying to prove that $U_{a+b}=U_aU_b+U_{a-1}U_{b-1}$ for $a\ge1$ and $b\ge1$, where $U_a$=$\sum_k {a-k\choose k}$.
Therefore $\sum_k {a+b-k\choose k}$=$\sum_k {a-k\choose k}$$\sum_k {b-k\choose k}$ + $\sum_k {a-k-1\choose k}$$\sum_k {b-k-1\choose k}$.
How can I modify the right hand side of the equation to get the left hand side?
We derive a closed formula for a generalisation of $U_m$ which will then be used to prove the identity.
It is convenient to use the coefficient of operator $[t^m]$ to denote the coefficient of $t^m$ of a series. We start with the generating function \begin{align*} \frac{1}{1-t-zt^2} \end{align*}
Comment:
In (2) we apply the geometric series expansion.
In (3) we apply the binomial series expansion.
In (4) we use the binomial identity $\binom{-p}{q}=\binom{p+q-1}{q}(-1)^q$.
In (5) we use the linearity of the coefficient of operator and use the rule $$[t^{p+q}]A(t)=[t^p]t^{-q}A(t)$$ We also restrict the upper limit of the sum since the exponent of $t^{n-2j}$ has to be non-negative.
In (6) we select the coefficient of $t^{n-2j}$.
Next we calculate $U_aU_b$ and $U_{a-1}U_{b-1}$.
It follows by collecting equal terms