Consider the sequence $a:=(a_{n})_{n\in\mathbb{N}_{\geq 1}}$ given by
$$a_{n} = \begin{cases}
\;\;1 &\text{ for } 2^{k}\leq n < 2^{k+1}, k \text{ even} \\
-1 &\text{ for } 2^{k}\leq n < 2^{k+1}, k \text{ odd.} \\
\end{cases}$$
(Hanul Jeon gave this as an example in: Bounded sequence with divergent Cesaro means) Define the Cesàro mean $C(a):=(c_{n})_{n\in\mathbb{N}_{\geq 1}}$:
$$c_{n}:= \frac{1}{n}\sum_{k=1}^{n} a_{k} $$
Then via the geometric series we have
$$c_{2^{n}-1}=\frac{1}{2^{n}-1}\sum_{k=1}^{2^{n}-1} a_{k} = \frac{1}{2^{n}-1}\sum_{k=0}^{n-1} (-2)^{k}=\frac{(-2)^{n}-1}{(-3)\cdot(2^{n}-1)}.$$
As noted in the previous post, this is a divergent subsequence of C(a) and thus, the Cesàro mean diverges also. I would suspect that the Cesàro mean of the Cesàro mean $C^{2}(a)$ converges to zero (since $C(a)$ "oscillates smoothly" between $\frac{1}{3}$ and $-\frac{1}{3}$), but I might be wrong and I don't have time for a proof right now. Maybe you can try yourself. I'd be interested!
EDIT: The requirement that the sequence be positive is unnecessary because if it's bounded by $K$ you can always just add $K$ to every member of the sequence and the Cesàro mean of $a$ will be $C(a)+K$. But still, it remains to be proved that for the above sequence $C^{2}(a)\to 0$.