Let Qk(x)=∑i=0ka(i,2k−2i)xi. According to the recurrence relation for a(m,n), we get
Pk(x)Qk(x)=xPk−1(x)+Qk(x)=xQk−1(x)+Pk−1(x).
So Qk(x)=Pk(x)−xPk−1(x) and therefore, Pk(x)−xPk−1(x)=x(Pk−1(x)−xPk−1(x))+Pk−1(x). Finally, we get
Pk(x)=(2x+1)Pk−1(x)−x2Pk−1(x).
Hence we get a recurrence relation for Pk+1(x) where k≥2, P1(x)=3x+1 and P2(x)=5x2+5x+1.
Claim. For each positive integer k≥2 all of the roots of Pk(x) and Pk−1(x) are real and distinct. Furthermore, if a1<a2<⋯<ak−1 and b1<b2<⋯<bk are roots of Pk−1 and Pk, respectively, we have
b1<a1<b2<a2<⋯<ak−1<bk.
Proof. We proceed by induction. For the base case k=2, −31 is the only root of P1 and P2(−31)<0 so −31 lies between the two roots of P2(x).
Suppose that Pk−1(x) and Pk(x) satisfy the induction hypothesis. We know Pk+1(x)=(2x+1)Pk(x)−x2Pk−1(x). Now, we consider the signs of Pk and Pk−1 on different real numbers. First suppose that k is even.
xPkx2Pk−1−∞+−b10−a1−0b20+a2+0⋯⋯⋯bk−10−ak−1−0bk0++∞++
Since Pk+1(x)=(2x+1)Pk(x)−x2Pk−1(x), for the sign of Pk+1 in respective bi's we have
xPk+1−∞−b1+a1−b2−a2−⋯⋯bk−1+ak−1−bk−+∞+
According to the change of signs of Pk+1(x) and by the Mean Value Theorem, for each 1≤i≤k−1, Pk+1 has a root between bi and bi+1. Also, it has one root less than b1 and one root greater than bk, which completes the proof for even values of k. The case where k is an odd number is similar, the only difference being the signs of b1 and −∞.
Note that
(i) 0 is not a root of any of the Pk's. Because Pk(0)=a(0,2k+1)=1, Pk−1(x) and x2Pk−1(x) have the same sign.
(ii) The coefficient of xk in Pk(x) equals a(2k,1)>0, so Pk(+∞)>0 and the sign of Pk(−∞) is related to the parity of k. □