How to prove that OEIS A007317 Binomial transform of Catalan numbers $a_{n}: 1, 2, 5, 15, 51, 188, 731, 2950, 12235, 51822, .. (n = 1, 2, ..)$ has a recurrence formula: $(n+2)a_{n+2} = (6n+4)a_{n+1} - (5n)a_{n}$ ?
The sequence is defined as: $a_{n+1} = \sum_{k=0}^{n} \binom{n}{k}c_{k}$ where $c_{n} = \frac{1}{n+1}\binom{2n}{n}$ is OIES A000108 Catalan numbers: $1, 1, 2, 5, 14, 42, 132, 429, 1430, 4862, .. (n = 0, 1, ..)$
We prove the recurrence formula with the help of generating functions. Let $A(z)$ be the generating functions of the $a_n$ \begin{align*} A(z)=\sum_{n=1}^\infty a_nz^n=\sum_{n=0}^\infty a_{n+1}z^{n+1} =\sum_{n=0}^\infty \left(\sum_{k=0}^n\binom{n}{k}C_k \right)z^{n+1} \end{align*} and let $C(z)$ be the (well-known) generating function of the Catalan numbers $C_n$ \begin{align*} C(z)&=\sum_{n=0}^{\infty} C_nz^n=\sum_{n=0}^{\infty} \frac{1}{n+1}\binom{2n}{n}=\frac{1}{2z}\left(1-\sqrt{1-4z}\right) \end{align*}
We prove the claim in three steps. Since the $a_n$ are a binomial transform of $C_n$, we derive at first a corresponding functional equation between $A(z)$ and $C(z)$. From this functional equation we obtain an explicit expression of $A(z)$. In the last step we use $A(z)$ to show that the corresponding generating function of the left hand and the right hand side of the recurrence relation coincide.
Comment:
In (2) we use the binomial series
In (3) we use the relation $\binom{-p}{q}=\binom{p+q-1}{q}(-1)^q$
In (4) we multiply the series (Cauchy product)
In (5) we replace $l$ with $n-k$
$$ $$
We take the left hand and right hand side of the recurrence relation, use an Ansatz with the generating function \begin{align*} A(z)=\sum_{n=1}^{\infty}a_n z^n=\frac{1}{2}\left(1-\sqrt{\frac{1-5z}{1-z}}\right) \end{align*} and show that both sides coincide. We will also use the derivative of $A(z)$ \begin{align*} \frac{d}{dz}A(z)=\sqrt{\frac{1-z}{1-5z}}\frac{1}{(1-z)^2} \end{align*}