Lattice paths inside a table, II

Daniel Yaqubi, Mohammad Farrokhi Derakhshandeh Ghouchan, Mohamad Zamani khademanlu

Consider an $m\times n$ table $T$ and latices paths ${\nu }_1,\dots ,{\nu }_k$ in $T$ such that each step ${\nu }_{i+1}-{\nu }_i=(1,1)$, $(1,0)$ or $(1,-1)$. The number of paths from the $(1,i)$-blank…