$x_n^2-2y_n^2=-1\iff (y_n^2)^4-(\sqrt{x_n})^4=(y_n^4-1)^2$.
And this equation is the form of $x^4-y^4=z^2$ and it's famous that it only has solutions (1,1)
ProofSuppose the equation has a solution in positive integers, and choose a solution that minimizes $x^2+y^2$. Note that $x,y$, and $z$ are pairwise coprime, since otherwise we could divide out by their common divisor to get a smaller solution. Thus
\[z^2 + (y^2)^2 = (x^2)^2\]
so that $z, y^2, x^2$ form a pythagorean triple. There are thus positive integers $p,q$ of opposite parity (and coprime since $x, y$, and $z$ are) such that $x^2 = p^2+q^2$ and either $y^2 = p^2-q^2$ or $y^2 = 2pq$.
Factoring the original equation, we get
\[(x^2-y^2)(x^2+y^2)=z^2\]
If $y^2 = p^2-q^2$, then $(xy)^2 = p^4-q^4$, and clearly $p^2+q^2 = x^2 < x^2+y^2$, so we have found a solution smaller than the assumed minimal solution.
Assume therefore that $y^2 = 2pq$. Now, $x^2 = p^2+q^2$; we may assume by relabeling if necessary that $q$ is even and $p$ odd. Then $p, q, x$ are pairwise coprime and form a pythagorean triple; thus there are $P>Q>0$ of opposite parity and coprime such that
\[
q = 2PQ,\quad p=P^2-Q^2,\quad x=P^2+Q^2
\]
Then
\[
PQ(P^2-Q^2) = \frac{1}{2}pq = \frac{y^2}{4}
\]
is a square; it follows that $P, Q$, and $P^2-Q^2$ are all (nonzero) squares since they are pairwise coprime. Write
\[
P = R^2,\quad Q=S^2,\quad P^2-Q^2=T^2
\]
for positive integers $R,S,T$. Then $T^2=R^4-S^4$, and
\[
R^2+S^2 = P+Q < (P+Q)(PQ)(P-Q) = \frac{1}{2}pq = \frac{y^2}{4}\leq y^2 < x^2+y^2
\]
We have thus found a smaller solution in positive integers, contradicting the hypothesis. |