Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Thank you for your answer. We have also tried this method, but the sign pattern of $P_n$ is $--++\cdots $, and the existing results cannot seem to get $P_n+Q_n \in RZ$
Thanks for Timothy Chow and Ira Gessel's answers, amazing construction! At first, we tried to use the Sturm sequence to prove the real zeros, but it seem to be impossible :(
Thanks for your comment! I'm sorry that I forgot to indicate the $n \geq 1$. Based on your comment, then by the generating function of $f_n(x)$, we get the recurrence relation of $f_n(x)$, that is $f_n(x)=xf_{n-1}(x)+x^2f_{n-3}+x^2f_{n-4}$ (for $n \geq 5$).