Let $(a_n)_{n\in\mathbb{N}}$ be a positive sequence. Assume, that
- $\lim_{n \to \infty} a_n = \infty$.
- $\forall\ \zeta > 0, \exists\ n=n(\zeta) \geq 1: a_n < \zeta.$
From 1. we know, that $\forall\ C > 0, \exists\ N = N(C) \geq 1: a_n \geq C, \forall\ n \geq N.$
The difference $N(C) - n(\zeta)$ can be interpreted as the 'recovery time', i.e. the time the sequence needs from being arbitrarily small to become larger than an arbitrary positive constant $C$ for the rest of its existence.
Question: Can somebody think of an example where $\forall\ C > 0: N(C) - n(\zeta)$ is arbitrarily large? (Is this even possible?)
There is no sequence satisfying both of your conditions 1 and 2. Proof: given that $a_n \to \infty$, there is a constant $N = N(1)$ such that $a_n \geq 1$ for all $n \geq N$. Then there are only finitely many terms smaller than 1, and you can choose $\zeta$ to be smaller than any of these.