$$1 + {1 \over 2} + {1 \over 3} + {1 \over 4} + \cdots \sim O(\log n)$$
$${1 \over 2} + {1 \over 3} + {1 \over 5} + {1 \over 7} + \cdots \sim O(\log\log n)$$
$$\text{???} \sim O(\log\log\log n)$$
Are there any divergent series (each of terms is greater than zero) with upper condition?
+Added] Each of terms must be a rational number.
(Sorry, I'm not familiar with English and MathJax, so there may be awkward expressions.)
Yes. Since $e^{e^e} \approx 3.8\cdot 10^6$ we would like to have our sum $1$ after, say, $3.9\cdot 10^6$ terms, so we start with $3.9 \cdot 10^6$ terms of $\frac 1{3.9\cdot 10^6}$. Then for each successive term $a_n$, take $\frac 1k$ with $k$ the smallest number possible so that the sum does not exceed $\log \log \log n$. Roughly speaking you want $a_n$ to be about $\frac 1{n \log n \log \log n}$. You can continue the pattern with more logs as far as you want.