This work documents a monic quartic polynomial with integer coefficients that generates a run of 49 consecutive prime values when evaluated at consecutive integers starting from n=0Primality is tested on the absolute value ∣P(n)∣ The polynomial is obtained through a sequence of translation steps of the formQ(n)=P(n−1)within the framework of the Borghi Genealogical Method for prime-generating polynomials. The resulting polynomial Q(n)= n4 −96n3 + 3153n2 − 40752n + 192307 is prime for all n=0,1,…,48 and the first composite value occurs at n=49, where Q(49)=236309=67×3527. This establishes a run length L=49, exceeding the classical bound of Euler’s quadratic polynomial and representing a new documented structural record within the class of monic quartic prime-generating polynomials. The paper includes: a detailed description of the genealogical construction, full computational verification, and the complete table of the 49 consecutive prime values generated by the polynomial. All results are fully reproducible using PARI/GP or SageMath.
Paolo Borghi (Sat,) studied this question.