The idea is to write $x+\frac{1}{x}$ in terms of
$x^n+\frac{1}{x^n}$ and $x^{n+1}+\frac{1}{x^{n+1}}$. A domino-sum does the job here.
Put $w_n=x^n+\frac{1}{x^n}$. Then, the fundamental identity is
$$
w_{i}w_{j}=w_{i-j}+w_{i+j} \ (i,j\in{\mathbb Z}) \tag{1}
$$
Say that a number $i$ is nice when $w_i\in{\mathbb Q}$. Note that
$0$ is nice since $w_0=2$. It follows then from (1) (with $j=i$)
that if $i$ is nice then $2i$ is nice also. Using (1) again
(with $j=2i$) we see that $3i$ is nice also. More generally, by induction
we have that any multiple of a nice integer is nice.
Next, look at those identities : (they all follow from (1))
$$
\begin{array}{lclclclcl}
w_{n+1}w_{n} &=& w_1 &+& w_{2n+1} & & & & \\
w_{n+1}w_{3n} &=& & & w_{2n-1} &+& w_{4n+1} & & \\
w_{n+1}w_{5n} &=& & & & & w_{4n-1} &+& w_{6n+1} \\
\end{array}\tag{2}
$$
If we look at terms in the same column, the sum is a multiple
of $w_1$ : $w_{2n+1}+w_{2n-1}=w_1w_{2n}$, $w_{4n+1}+w_{4n-1}=w_1w_{4n}$
etc. Formally, we have for any $r>0$,
$$
w_{n+1}\bigg(\sum_{j=1}^r w_{(2j-1)n}\bigg)=
w_1+\sum_{j=1}^{r-1} w_1w_{2jn} +w_{2rn+1} \tag{3}
$$
We can rewrite this as
$$
w_1=\frac{w_{n+1}\bigg(\sum_{j=1}^r w_{(2j-1)n}\bigg)-w_{2rn+1}}{1+\sum_{j=1}^{r-1} w_{2jn}} \tag{4}
$$
In the RHS of (4), all the variables are rational numbers, except possibly
$w_{2rn+1}$. When $n$ is even, for suitable $r$ (for example $r=\frac{n+1}{2}$), $2rn+1$ will be divisible by $n+1$, so $w_{2rn+1}$ is rational also, which finishes the proof (note that the denominator is nonzero because it is positive). Similarly, when $n$ is even one can use the identity
$$
w_1=\frac{w_{n+1}\bigg(1+\sum_{j=2}^r w_{2jn}\bigg)-w_{2rn+n+1}}{1+\sum_{j=2}^{r} w_{(2j-1)n}} \tag{4'}
$$
and take a suitable value of $r$ so that $2rn$ is a multiple of $n+1$. To derive (4'), notice that $d_j=w_{n+1}w_{2jn}-w_1w_{(2j-1)n}$ can be simplified to $d_j=u_{j}-u_{j-1}$
where $u_{j}=w_{2jn+n+1}$. Then $\sum_{j=1}^r d_j = u_{r}-u_{0}$, and (4') follows.