Show that $x_{n+2} = \frac{1}{3} x_{n + 1} + \frac{1}{6} x_n + 1$ is bounded, monotone, and find its limit Prove that $x_1 = 0, x_2 = 0, x_{n+2} = \frac{1}{3} x_{n + 1} + \frac{1}{6} x_n + 1$ is bounded and monotonic. Then find its limit.
My attempt at boundedness:
(Using induction) For the base case we have $0 \leq x_1 = 0 \leq 2$. Assume that the sequence is bounded for $n = k$. Then,
\begin{align*}
0 \leq x_k &\leq 2 \\
\vdots \\
\text{lower bound } \leq x_{k + 1} &\leq \text{upper bound}
\end{align*}
I am thrown off by the term $x_{n + 2}$ in the recursive formula and I can't see the algebra to produce the above steps without getting $x_{n + 2}$ in the expression of the upper / lower bound.
Thank you.
Update:
I have added this to the prove:
We have $0 \leq x_1 = 0 \leq 2$ and $0 \leq x_2 = 0 \leq 2$. Assume that the sequence is bounded for $k+1$,
\begin{align*}
0 &\leq x_{k + 1} \leq 2 \\
0 &\leq x_k + x_{k+1} \leq 4 \\
0 &\leq x_k + \frac{1}{3} x_{k+1} \leq 4 \\
0 &\leq \frac{1}{6} x_{k} + \frac{1}{3} x_{k+1} \leq 4 \\
0 &\leq x_{k+2} \leq 4 
\end{align*}
Therefore, by the principle of mathematical induction, the sequence is bounded.
Is this valid?

No, your argument is not valid. You show that
$$x_{k+1}\le 2\implies x_{k+2}\le 4.$$
If you apply induction, this leads to
$$x_{k+m}\le 2^{m+1}$$ which is not bounded.

But you can use
$$x_k,x_{k+1}\le2\implies x_{k+2}=\frac{x_k}{3}+\frac{x_{k+1}}6+1\le\frac23+\frac26+1=2.$$
