Y by UpvoteFarm, Adventure10, Mango247
Show that there is a unique sequence of integers
with ![\[a_{1}=1, \; a_{2}=2, \; a_{4}=12, \; a_{n+1}a_{n-1}=a_{n}^{2}\pm1 \;\; (n \ge 2).\]](//latex.artofproblemsolving.com/e/2/b/e2be03be0ee99cb49056b1ee09b3e707bbdf93ea.png)

![\[a_{1}=1, \; a_{2}=2, \; a_{4}=12, \; a_{n+1}a_{n-1}=a_{n}^{2}\pm1 \;\; (n \ge 2).\]](http://latex.artofproblemsolving.com/e/2/b/e2be03be0ee99cb49056b1ee09b3e707bbdf93ea.png)
We have your learning goals covered with Spring and Summer courses available. Enroll today!
Something appears to not have loaded correctly.