Can the recursion $x_{n+1} = 3{(x_n)}^2+2$ with $x_0 = 2$, be solved?

53 Views Asked by At

This can be solved computationally, but is there an analytical solution? I've tried to build a solution and it wasn't pretty. $$x_{n+1} = 3{(x_n)}^2+2 \qquad x_0 = 2$$