When treating sequences of reals, one does not deal strictly speaking with L'Hopital's formula (which applies to derivable functions) but with its discrete counterpart, namely the Cesaro-Stolz criterion. Set $b=\frac{1}{a}>1$; in your particular case, you can apply this criterion to the sequence of ratios:
$$\left(\frac{n}{b^n}\right)_{n \in \mathbb{N}}$$
which reduces finding the limit of this said sequence to that of the sequence
$$\frac{1}{b^{n+1}-b^n}=\frac{1}{b^{n}(b-1)} \xrightarrow {n \to \infty} 0$$
assuming of course you know what the asymptotic behaviour of the exponential sequence is.
One can also consider a different argument based on an inequality both powerful and very fundamental to Analysis. In it's most general form it can be stated as:
Generalised Bernoulli inequality: for $a \in (0, \infty)\setminus \{1\}$ and $x, y \in \mathbb{R}^{*},\ x<y$ it holds that
$$\frac{a^x-1}{x}<\frac{a^y-1}{y}$$
We are going to focus on a particular version of this, easily established by induction, which claims that:
Simplified version: for $a>1$ and $n \in \mathbb{N}, n \geqslant 2$ one has
$$a^n>1+n(a-1)$$
This can be used in a crafty way to derive:
$$a^n=(\sqrt[k]{a}\ ^{n})^k>(1+n(\sqrt[k]{a}-1))^k>n^k(\sqrt[k]{a}-1)^{k}$$
for arbitrary $k \in \mathbb{N}^*$. Can you see how this entails that an exponential of strictly superunitary (strictly above $1$) base asymptotically dominates powers?