If $a_{ij}=\max(i,j)$, calculate the determinant of $A$

Let $d_n$ be the determinant of the $n\times n$ matrix

We can also write it as a recurrence

By expanding on the last row (or column) we observe that all but the minors of last two columns have linear dependent columns, so we have:

$d_n=-\frac{n^2}{n-1}d_{n-1}+nd_{n-1}=-\frac{n}{n-1}d_{n-1}$

Coupled with $d_1=1$ we get $d_n=(-1)^{n-1}n$

Hint to a more artsy proof:

Whenever $\mathcal{A}$ is a logical statement, we shall write $\left[\mathcal{A}\right]$ for the integer $\begin{cases} 1, & \text{ if } \mathcal{A} \text{ is true}; \\ 0, & \text{ if } \mathcal{A} \text{ is false} \end{cases}$. (This is called the Iverson bracket notation.)

Let $B$ be the $n\times n$-matrix whose $\left(i,j\right)$-th entry is $n \left[j=n\right] - \left[i \leq j < n\right]$. Here is how $B$ looks like: $$ B = \left( \begin{array}{ccccc} -1 & -1 & \cdots & -1 & n \\ 0 & -1 & \cdots & -1 & n \\ \vdots & \vdots & \ddots & \vdots & \vdots \\ 0 & 0 & \cdots & -1 & n \\ 0 & 0 & \cdots & 0 & n \end{array} \right) . $$ The matrix $B$ is upper-triangular, and so $\det B = n \left(-1\right)^{n-1}$.

Let $C$ be the $n \times n$-matrix whose $\left(i,j\right)$-th entry is $\left[i \geq j\right]$. Here is how $C$ looks like: $$ C = \left(\begin{array}{ccccc} 1 & 0 & \cdots & 0 & 0 \\ 1 & 1 & \cdots & 0 & 0 \\ \vdots & \vdots & \ddots & \vdots & \vdots \\ 1 & 1 & \cdots & 1 & 0 \\ 1 & 1 & \cdots & 1 & 1 \end{array} \right) . $$ The matrix $C$ is lower-triangular, and so $\det C = 1$.

Now, check that $A = BC$, and conclude.