Looking at the $2 \times 2$ and $3 \times 3$ forms of this matrix, we see that:
$\det \begin{bmatrix} t & -a_0 \\ -1 & t-a_1 \end{bmatrix} = t(t-a_1) - a_0 = t^2 - a_1t - a_0$
and, by expansion along the first row:
$\det \begin{bmatrix} t & 0 & -a_0 \\ -1 & t & -a_1 \\ 0 & -1 & t-a_2 \end{bmatrix} = t \times\det \begin{bmatrix} t & -a_1 \\ -1 & t-a_2 \end{bmatrix} + (-a_0) \det\begin{bmatrix} -1 & t \\ 0 & -1 \end{bmatrix}$
$= t[t(t-a_2) - a_1] - a_0 = t^3 - a_2t^2 - a_1t - a_0 $
So it looks like:
$\det \begin{bmatrix} t & 0 & 0 & \cdots & 0 & -a_0 \\ -1 & t & 0 & \cdots & 0 & -a_1 \\ 0 & -1 & t & \cdots & 0 & -a_2 \\ 0 & 0 & -1 & \cdots & 0 & -a_3 \\ \vdots & \vdots & \vdots & \ddots & \vdots & \vdots \\ 0 & 0 & 0 & \cdots & t & -a_{n-1} \\ 0 & 0 & 0 & \cdots & -1 & t-a_n \end{bmatrix} = t^{n+1} - a_nt^n - a_{n-1}t^{n-1} - ... - a_2t^2 - a_1t - a_0$
Which we can prove by induction.
Assume that:
$\det \begin{bmatrix} t & 0 & 0 & \cdots & 0 & -a_0 \\ -1 & t & 0 & \cdots & 0 & -a_1 \\ 0 & -1 & t & \cdots & 0 & -a_2 \\ 0 & 0 & -1 & \cdots & 0 & -a_3 \\ \vdots & \vdots & \vdots & \ddots & \vdots & \vdots \\ 0 & 0 & 0 & \cdots & t & -a_{n-2} \\ 0 & 0 & 0 & \cdots & -1 & t-a_{n-1} \end{bmatrix} = t^{n} - a_{n-1}t^{n-1} - a_{n-2}t^{n-2} - ... - a_2t^2 - a_1t - a_0$
Then, by expansion along the first row:
$\det \begin{bmatrix} t & 0 & 0 & \cdots & 0 & -a_0 \\ -1 & t & 0 & \cdots & 0 & -a_1 \\ 0 & -1 & t & \cdots & 0 & -a_2 \\ 0 & 0 & -1 & \cdots & 0 & -a_3 \\ \vdots & \vdots & \vdots & \ddots & \vdots & \vdots \\ 0 & 0 & 0 & \cdots & t & -a_{n-1} \\ 0 & 0 & 0 & \cdots & -1 & t-a_n \end{bmatrix} = t \det \begin{bmatrix} t & 0 & 0 & \cdots & 0 & -a_1 \\ -1 & t & 0 & \cdots & 0 & -a_2 \\ 0 & -1 & t & \cdots & 0 & -a_3 \\ 0 & 0 & -1 & \cdots & 0 & -a_4 \\ \vdots & \vdots & \vdots & \ddots & \vdots & \vdots \\ 0 & 0 & 0 & \cdots & t & -a_{n-1} \\ 0 & 0 & 0 & \cdots & -1 & t-a_n \end{bmatrix} $
$+ (-1)^{n+1} \times (-a_0)(-1)^n $
$ = t[t^{n} - a_{n}t^{n-1} - a_{n-1}t^{n-2} - ... - a_3t^2 - a_2t - a_1] + (-1)^{2n+1} a_0$
$ = t^{n+1} - a_nt^n - a_{n-1}t^{n-1} - ... - a_2t^2 - a_1t - a_0$
Proof complete.
We can simply calculate the determinant of an opposite (lower) triangular matrix:
Let $J_n$ be the $n \times n$ matrix with $1$ on the anti-diagonal and $0$ otherwise (i.e. $J_ne_i = e_{n+1-i}$ for all $1 \leq i \leq n$, where $e_1, \dotsc, e_n$ denotes the standard basis). Given any $m \times n$-matrix $A$ the matrix $AJ_n$ originates from $A$ by vertically mirroring its colums from the middle, i.e. swapping the first column with the last, the second with the second last, etc.
If $A$ is an $n \times n$ square matrix then we get from $J_n^2 = I_n$ that
$$
\det(A) = \det(J_n) \det(AJ_n).
$$
In the case of $D_n$ we get that $D_n J_n$ is the $a_n$-scalar multiple a lower triangular matrix with diagonal entries $x-a_1, x-a_2, \dotsc, x-a_{n-1}, 1$, so
$$
\det(D_n)
= \det(J_n) \det(D_n J_n)
= \det(J_n) a_n (x-a_1) \dotsm (x-a_{n-1}).
$$
So the only difference is that we need to know $\det(J_n)$. Because $J_n$ is a permutation matrix, corresponding to $\sigma_n \in S_n$ with $\sigma(i) = n+1-i$, we have $\det(J_n) = \mathrm{sgn}(\sigma_n)$. Notice that
\begin{align*}
\sigma_{2n} &= (1 \;\; 2n) (2 \;\; n-1) \dotsm (n \;\; n+1) \\
\sigma_{2n+1} &= (1 \;\; 2n+1) (2 \;\; n-1) \dotsm (n \;\; n+2).
\end{align*}
So we can just count the number of transpositions used and get that
$$
\mathrm{sgn}(\sigma_n) =
\begin{cases}
\phantom{-}1 & \text{if $n \equiv 0,1 \bmod 4$}, \\
-1 & \text{if $n \equiv 2,3 \bmod 4$},
\end{cases}
= (-1)^{n(n-1)/2}.
$$
So alltogether we have
$$
\det(D_n) = (-1)^{n(n-1)/2} a_n (x-a_1) \dotsm (x-a_{n-1}).
$$
(The nice thing about this is that now that we have calculated $\det(J_n) = (-1)^{n(n-1)/2}$ we can use this to calculate the determinant of opposite triangular and opposite diagonal matrices more ore less in the usual way.)
Best Answer
Let $M_n$ be your matrix.
Let $\eta_n$ be the $n\times n$ matrix with entry $1$ at the superdiagonal and $0$ 4 elsewhere. If you
Subtract row $k+1$ from row $k$ for $k = 1,2,\ldots,n-1$.
This is equivalent to multiply $M_n$ by $I_n - \eta_n$ from the left
Subtract column $k-1$ from column $k$ for $k = n,n-1,\ldots,2$ (notice the order of $k$).
This is equivalent to multiply $(I_n-\eta_n)M_n$ by $I_n - \eta_n$ from the right.
After you do this, your matrix simplifies to $$(I_n - \eta_n) M_n (I_n - \eta_n) = \begin{bmatrix} n-1&-n&0&\cdots&0&0&0\\ 0&n-1&-n&\cdots&0&0&0\\ 0&0&n-1&\ddots&0&0&0\\ \vdots&\vdots&\vdots&\ddots&\ddots&\vdots&\vdots\\ 0&0&0&\cdots&n-1&-n&0\\ 0&0&0&\cdots&0&n-1&-\lambda\\ 1&0&0&\cdots&0&0&\lambda-1 \end{bmatrix}$$
From this, you can deduce
$$\det[M_n] = \det[(I_n - \eta_n)M_n(I_n - \eta_n)] = (n-1)^{n-1}(\lambda-1) + n^{n-2}\lambda$$