A lattice path inside the $m\times n$ table $T$ is a sequence $ν_1,\ldots,ν_k$ of cells such that $ν_{j+1}-ν_j\in\{(1,-1),(1,0),(1,1)\}$ for all $j=1,\ldots,k-1$. The number of lattice paths in $T$ from the first column to the $(x,y)$-cell is written into that cell. We present a precise description of the minimal linear recurrences among rows, columns, and columns sums. As a result, we obtain several formulas for the number of all lattice paths from the first column to the last column of $T$, that is, the $n^{th}$ column sum. Our methods are based on three classes of operators, which will also be studied independently.