KöMaL 2021 B5145

Show that there are $\binom{n+1}{2k+1}$ different strings of zeros and ones of length $n$ in which it occurs exactly $k$ times that a $0$ is followed by a $1$.