I have a Diophantine equation of the form: $$ax^2 + bx + c = y^2, \quad x, y \in \mathbb{Z^+}$$ Is it true that there will always be a linear recurrence formula that generates all the solutions for $x$, of the form: $$x_n = \alpha_1x_{n-1} + \alpha_2x_{n-2} + \alpha_3,$$ for some constants $\alpha_1, \alpha_2, \alpha_3 \in \mathbb{Z^+}$ (where plugging integers into $n$ generates the next $x$ that solves the Diophantine equation)?
If so, is it possible to prove this?
And if so, is it possible to show how these constants $\alpha_1, \alpha_2, \alpha_3$ are found?