What is the easiest way to generate $\mathrm{GL}(n,\mathbb Z)$?

James has correctly identified the elementary matrices as generating $\operatorname{GL}(n,\mathbb{Z})$. I'd like to address the why - since the relevant fact that $\mathbb{Z}$ is a Euclidean domain is not quite captured in the "from linear algebra" remark in the previous answer.

For any Euclidean domain $R$, $\operatorname{GL}(n,R)$ is generated by elementary matrices. This follows from the proof of Smith normal form. But which proof? Not the usual one that works for an arbitrary principal ideal domain, but a more algorithmic version valid for Euclidean domains only. A presentation is in Chapter 108 ("Smith Normal Form over a Euclidean Ring"; the numbering might shift) of Richard Elman's notes.

From linear algebra we know that every invertible matrix can be obtained from the identity matrix by a sequence of elementary row operations. The corresponding elementary matrices therefore generate the general linear group. Now you can find pre-images in $\mathrm {Aut}(F_{n})$ by considering Nielsen transformations, which match up fairly directly with the elementary matrices.