Reflection count for Dyck paths

There are $\left(\genfrac{}{}{0ex}{}{2n}{n}\right)$ paths with $n$ up steps and $n$ down steps, ignoring the height constraint. For $n\ge 1$, reflect the prefix of a bad path through its first visit to height $-1$, swapping its up and down steps. The resulting path has $n+1$ up steps and $n-1$ down steps, hence final height two. Its first visit to height one identifies the inverse reflection, so this is a bijection. There are $\left(\genfrac{}{}{0ex}{}{2n}{n+1}\right)$ bad paths. Subtracting givesThis count connects a global nonnegative-height requirement to an unrestricted binomial coefficient. The case $n=0$ is separately the unique empty path.