for many integer sequences $x=(x_n)_n$, it is a natural question to describe the set $p_x$ of all prime numbers $p$ that divide some non-zero term of the sequence, and to quantify the `size' of $p_x$. \\ \noindent we focus on the case of linear recurrent sequences, where we have fairly complete results for recurrences of order 2 based on the chebotarev density theorem, and mostly open questions for higher order recurrences.