Given your boundary conditions, if we open up the recurrence relation then we discover an $m$-step process, where at each step we change $n$ by $0$ or $\pm 1$. For every walk that ends up at $0$, we "score" one point.

How many such walks exist? There is an equal number $k$ of $+1$s and $-1$s, and so we get