Let $\left(u_n\right)_{n\in\mathbb{N^*}}$ be the sequence defined $\forall n\in\mathbb{N^*}$ by : $$u_n=\sum\limits_{k=1}^{n}e^{-b^{-k}}$$ With $b\in(1,+\infty)$.
We can instictively say that when $n\to\infty$, since $\lim\limits_{k\to\infty}e^{-b^{-k}}\to 1$, it will tend to be like $\sum\limits_{k=1}^{n}1=n$, and thus I expect the dominant term of the asymptotic expansion of $\left(u_n\right)$ to be $n$ :
$$u_n=n+o(n)$$
And numerical simulation shows indeed that $u_n\sim n$ for large n.
Now, this is no demonstration ; and not only am I trying to prove it rigorously, but also (and mainly) to expand it a bit more and find out the next few terms (well, at least the second term) of the asymptotic expansion...
Any suggestion ?
Since $e^{-x}=1-x+x^2/2!-x^3/3!+\ldots$, your sum is \begin{align} \sum_{k=1}^n e^{-b^{-k}}&= n-\sum_{m=1}^\infty \frac{(-1)^{m+1}}{m!}\frac{1-b^{-mn}}{b^m-1} \\&=n-\frac{1-b^{-n}}{b-1}+\frac{1}{2}\frac{1-b^{-2n}}{b^2-1}-\frac{1}{6}\frac{1-b^{-3n}}{b^3-1}\ldots+\frac{(-1)^{m+1}}{m!}\frac{1-b^{-mn}}{b^m-1}+\ldots \end{align} Immediately, this tells us that $u_n\sim n-\sum_{m=1}^\infty \frac{(-1)^{m+1}}{m!}\frac{1}{b^m-1}$. If $b$ is large enough, then $u_n\approx_{n\to\infty} n+e^{-b^{-1}}-1\sim n -\frac{1}{b}$.