Show $\binom{n}{[n/2]} = \binom{n-1}{[(n-1)/2]} + \sum_{i=0}^{[n/2] - 1} \frac{1}{i+1} \binom{2i}{i} \binom{n-2i-2}{[n/2]- i - 1}$ The identity
$$\binom{n}{\lfloor n/2\rfloor} = \binom{n-1}{\lfloor (n-1)/2\rfloor} + \sum_{i=0}^{\lfloor n/2\rfloor - 1} \frac{1}{i+1} \binom{2i}{i} \binom{n-2i-2}{\lfloor n/2\rfloor - i - 1}$$
came up in a certain combinatorial calculation. Here $n \in \mathbb{Z}_{\geq 0}$. Surely this must be listed in some reference work, though I didn't see it when looking through various sources (Wikpedia, Gould's combinatorial identities, MathWorld, etc.).
It looks to me like a discrete fundamental theorem of calculus identity. It may also be related to the Gamma function at half-integers, e.g. Mathematica simplifies the sum when $n=2k$ to
$$2^{2k-1} \frac{\Gamma\left(\frac{1}{2} + k\right)}{k!}.$$

In trying to evaluate
$$\sum_{q=0}^{\lfloor n/2 \rfloor -1}
\frac{1}{q+1} {2q\choose q}
{n-2q-2\choose \lfloor n/2 \rfloor - q - 1}$$
we get for $n=2m$
$$\sum_{q=0}^{m -1}
\frac{1}{q+1} {2q\choose q}
{2m-2q-2\choose m - q - 1}
\\ = [z^{m-1}] (1+z)^{2m-2} \sum_{q=0}^{m -1}
\frac{1}{q+1} {2q\choose q}
z^q (1+z)^{-2q}.$$
We will use formal power series throughout.
Here the coefficient extractor enforces the range and we recognize the
Catalan number OGF
$$C(w) = \frac{1-\sqrt{1-4w}}{2w}$$
so that we obtain
$$ [z^{m-1}] (1+z)^{2m-2}\sum_{q\ge 0}
\frac{1}{q+1} {2q\choose q}
z^q (1+z)^{-2q}
\\ = [z^{m-1}] (1+z)^{2m-2}
\frac{1-\sqrt{1-4z/(1+z)^2}}{2z/(1+z)^2}
\\ = [z^{m-1}] (1+z)^{2m-1}
\frac{1+z-\sqrt{(1+z)^2-4z}}{2z}
\\ = [z^{m-1}] (1+z)^{2m-1}
\frac{1+z-(1-z)}{2z}
= [z^{m-1}] (1+z)^{2m-1} = {2m-1\choose m-1}.$$
Similarly for $n=2m+1$ we get
$$\sum_{q=0}^{m -1}
\frac{1}{q+1} {2q\choose q}
{2m+1-2q-2\choose m - q - 1} = {2m\choose m-1}.$$
Joining these two we get the closed form
$$\bbox[5px,border:2px solid #00A000]{
{n-1\choose  \lfloor n/2 \rfloor - 1}.}$$
We still have to verify two cases, from the given formula for the sum
which is
$${n\choose \lfloor n/2\rfloor}-{n-1\choose \lfloor (n-1)/2\rfloor}$$
first for $n=2m$
$${2m\choose m} - {2m-1\choose m-1} = {2m-1\choose m-1}$$
which is $\frac{2m}{m} {2m-1\choose m-1} = 2 {2m-1\choose m-1}$
and holds by inspection and second for $n=2m+1$
$${2m+1\choose m} - {2m\choose m} = {2m\choose m-1}$$
which also holds by inspection.

