Consider $P\_n(x)$ polynomials defined through the recurrence relations
$$P\_n(x)=2(1-x)P\_{n-1}(x)-(1+x)^2P\_{n-2}(x),$$ with $P\_0(x)=1$ and $P\_1(x)=1-3x$.
In fact, the explicit solution of these recurrence relations is given by the formula
$$P\_n(x)=\frac{1}{2}\left[ (1+i\sqrt{x})^{2n+1}+(1-i\sqrt{x})^{2n+1}\right].$$
What condition(s) should satisfy the number $n$, the polynomial $P\_n(x)$ to be reducible? I have checked, that $P\_n(x)$ is reducible for $n=4,7,10,12,13,16,17,19,\ldots$ What is special about these numbers?


Another question: given a number $n$, for what numbers $0<m<n$ the polynomial $P\_n(x)$ is divisible by $P\_m(x)$? For example, $P\_4$ is divisible by $P\_1$; $P\_7$ is divisible by $P\_1$ and $P\_2$; $P\_{10}$ is divisible by $P\_1$ and $P\_3$;
$P\_{12}$ is divisible by $P\_2$; $P\_{13}$ is divisible by $P\_1$; $P\_{16}$ is divisible by $P\_1$ and $P\_5$; $P\_{17}$ is divisible by $P\_2$ and $P\_3$; $P\_{19} $ is divisible by $P\_1$ and $P\_6$.


These polynomials emerged in the solution of the certain collision problem (hence the name) from the book: David Morin, Introduction to Classical Mechanics With Problems and Solutions (Cambridge University Press, 2007). See problem 5.88 on page 192. It can be also found here (the problem for Week 19. The solution is also provided there, which, however, does not use the collision polynomials):


<http://www.physics.harvard.edu/academics/undergrad/problems.html>



Collision polynomials
Writing $P\_n(x)=\frac{1}{2}\left[ (i\sqrt{x}+1)^{2n+1}-(i\sqrt{x}-1)^{2n+1}\right]$ and using that $x^u-y^u$ divides $x^v-y^v$ once $u$ divides $v$ easily shows that $P\_m$ divides $P\_n$ once $2m+1$ divides $2n+1$. With a little more effort, one should see that this sufficient condition is necessary, too.


I'm not sure whether your first question would like to see an answer why $P\_n$ is irreducible over $\mathbb Q$ when $2n+1$ is a prime. Anyway, this is the case because the reciprocal $x^nP(1/x)$ is an Eisenstein polynomial with respect to the prime $2n+1$. 


