In General, $n>2$, $a_{i,j}=a_{i,j-1}+1$ and the matrix will be of the following form:
$\begin{bmatrix}1&2&3&...&n\\n+1&n+2&n+3&...&n+n\\2n+1&2n+2&2n+3&...&2n+n\\...&...&...&...&...\\(n-1)n+1&(n-1)n+2&(n-1)n+3&...&n^2\end{bmatrix}_{n \times {n}}$
I tried to show this by row operations, and I got some nice patterns but I was getting into my third page and it seemed never ending. I'm working on uploading the pictures of my scratch work.
Subtract the first row from the second and third rows, and the new rows will be linearly dependent.