We have,
f2n(x)−fn−1(x)fn+1(x)=1=f2n−1(x)−fn−2(x)fn(x).
∴fn(x)(fn(x)+fn−2(x))=fn−1(fn−1(x)+fn+1(x)).
We write this as
fn−1(x)+fn+1(x)fn(x)=fn−2(x)+fn(x)fn−1(x).
Using induction, we get
fn−1(x)+fn+1(x)fn(x)=f0(x)+f2(x)f1(x).
Observe that
f2(x)=f21(x)−1f0(x)=x2−1.
Hence
fn−1(x)+fn+1(x)fn(x)=1+(x2−1)x=x.
Thus we obtain
fn+1(x)=xfn(x)−fn−1(x).
Since f0(x),f1(x)andf2(x) are polynomials with integer coefficients, induction again shows that fn(x) is a polynomial with integer coefficients.
Note: We can get fn(x) explicitly:
fn(x)=xn−(n−11)xn−2+(n−22)xn−4−(n−33)xn−6+…