The polynomial

Q(n) = n^4 − 96n^3 + 3153n^2 − 40752n + 192307

This monic quartic integer polynomial generates a sequence of 49 consecutive prime values when evaluated at n = 0, 1, …, 48. Primality is tested on the absolute value Q(n).

Run length: L = 49

Stop (first composite):
Q(49) = 236309 = 67 × 3527

Context

Euler’s famous polynomial n^2 + n + 41 produces primes for n = 0..39 (then n=40 gives 1681 = 41^2). In terms of consecutive primes starting at n=0, the monic quartic documented here reaches L = 49.

Translation genealogy (L = 42 → 49)

The record polynomial Q(n) is obtained through repeated translations of the form:

Q(n) = P(n − 1)

If P(n) is prime for n = 0..L-1 and P(-1) is also prime, then the translation increases the run length by one: the translated polynomial produces primes for n = 0..L. Iterating this mechanism produces a genealogical chain.

Starting polynomial (L = 42)

P(n) = n^4 − 68n^3 + 1431n^2 − 9350n + 31013

For this polynomial, primality holds for n = 0..41, and the stop occurs at n = 42: P(42) = 236309 = 67 × 3527. Moreover, the negative-side values P(−1), …, P(−7) are prime, while P(−8) is composite, enabling 7 consecutive translations and leading to L = 49.

Complete genealogical table

L Monic quartic polynomial Stop
49n^4 − 96n^3 + 3153n^2 − 40752n + 192307n=49: 236309 = 67×3527
48n^4 − 92n^3 + 2871n^2 − 34730n + 154613n=48: 236309 = 67×3527
47n^4 − 88n^3 + 2601n^2 − 29260n + 122663n=47: 236309 = 67×3527
46n^4 − 84n^3 + 2343n^2 − 24318n + 95917n=46: 236309 = 67×3527
45n^4 − 80n^3 + 2097n^2 − 19880n + 73859n=45: 236309 = 67×3527
44n^4 − 76n^3 + 1863n^2 − 15922n + 55997n=44: 236309 = 67×3527
43n^4 − 72n^3 + 1641n^2 − 12420n + 41863n=43: 236309 = 67×3527
42n^4 − 68n^3 + 1431n^2 − 9350n + 31013n=42: 236309 = 67×3527
41n^4 − 64n^3 + 1233n^2 − 4688n + 23127n=41: 236309 = 67×3527
40n^4 − 60n^3 + 1047n^2 − 410n + 17539n=40: 236309 = 67×3527
39n^4 − 56n^3 + 873n^2 + 3492n + 15347n=39: 236309 = 67×3527
38n^4 − 52n^3 + 711n^2 + 7110n + 16085n=38: 236309 = 67×3527
37n^4 − 48n^3 + 561n^2 + 10352n + 20579n=37: 236309 = 67×3527
36n^4 − 44n^3 + 423n^2 + 13218n + 28557n=36: 236309 = 67×3527
35n^4 − 40n^3 + 297n^2 + 15708n + 39547n=35: 236309 = 67×3527
34n^4 − 36n^3 + 183n^2 + 17822n + 52977n=34: 236309 = 67×3527
33n^4 − 32n^3 + 81n^2 + 19560n + 68275n=33: 236309 = 67×3527
32n^4 − 28n^3 − 9n^2 + 20922n + 84769n=32: 236309 = 67×3527
31n^4 − 24n^3 − 87n^2 + 218...n + 101... n=31: 236309 = 67×3527
30n^4 − 20n^3 − 153n^2 + 22310n + 118... n=30: 236309 = 67×3527
29n^4 − 16n^3 − 207n^2 + 22392n + 135... n=29: 236309 = 67×3527
28n^4 − 12n^3 − 249n^2 + 21948n + 152... n=28: 236309 = 67×3527
27n^4 − 8n^3 − 279n^2 + 21048n + 169... n=27: 236309 = 67×3527
26n^4 − 4n^3 − 297n^2 + 196...n + 186... n=26: 236309 = 67×3527
25n^4 − 303n^2 + 181...n + 203... n=25: 236309 = 67×3527
24n^4 + 4n^3 − 297n^2 + 159...n + 220... n=24: 236309 = 67×3527
23n^4 + 8n^3 − 279n^2 + 132...n + 237... n=23: 236309 = 67×3527
22n^4 + 12n^3 − 249n^2 + 101...n + 254... n=22: 236309 = 67×3527
21n^4 + 16n^3 − 207n^2 + 65...n + 271... n=21: 236309 = 67×3527
20n^4 + 20n^3 − 153n^2 + 25...n + 288... n=20: 236309 = 67×3527
19n^4 + 24n^3 − 87n^2 − 18...n + 305... n=19: 236309 = 67×3527
18n^4 + 28n^3 − 9n^2 − 66...n + 322... n=18: 236309 = 67×3527
17n^4 + 32n^3 + 81n^2 − 118...n + 339... n=17: 236309 = 67×3527
16n^4 + 36n^3 + 183n^2 − 174...n + 356... n=16: 236309 = 67×3527
15n^4 + 40n^3 + 297n^2 − 234...n + 373... n=15: 236309 = 67×3527
14n^4 + 44n^3 + 423n^2 − 298...n + 390... n=14: 236309 = 67×3527
13n^4 + 48n^3 + 561n^2 − 366...n + 407... n=13: 236309 = 67×3527
12n^4 + 52n^3 + 711n^2 − 438...n + 424... n=12: 236309 = 67×3527
11n^4 + 56n^3 + 873n^2 − 414...n + 441... n=11: 236309 = 67×3527
10n^4 + 60n^3 + 1047n^2 − 41...n + 458... n=10: 236309 = 67×3527
9n^4 + 64n^3 + 1233n^2 + 4688n + 23127n=9: 236309 = 67×3527
8n^4 + 68n^3 + 1431n^2 + 9350n + 31013n=8: 236309 = 67×3527
7n^4 + 72n^3 + 1641n^2 + 12420n + 41863n=7: 236309 = 67×3527
6n^4 + 76n^3 + 1863n^2 + 15922n + 55997n=6: 236309 = 67×3527
5n^4 + 80n^3 + 2097n^2 + 19880n + 73859n=5: 236309 = 67×3527
4n^4 + 84n^3 + 2343n^2 + 24318n + 95917n=4: 236309 = 67×3527
3n^4 + 88n^3 + 2601n^2 + 29260n + 122663n=3: 236309 = 67×3527
2n^4 + 92n^3 + 2871n^2 + 34730n + 154613n=2: 236309 = 67×3527
1n^4 + 96n^3 + 3153n^2 + 40752n + 192307n=1: 236309 = 67×3527
Structural note: along the whole chain, the first composite (“stop”) is the same integer 236309; only the index n where it occurs changes.

List of generated prime numbers

n Q(n) is prime
0192307✔
1154613✔
2122663✔
395917✔
473859✔
555997✔
641863✔
731013✔
823027✔
917509✔
1014087✔
1112413✔
1212163✔
1313037✔
1414759✔
1517077✔
1619763✔
1722613✔
1825447✔
1928109✔
2030467✔
2132413✔
2233863✔
2334757✔
2435059✔
2534757✔
2633863✔
2732413✔
2830467✔
2928109✔
3025447✔
3122613✔
3219763✔
3317077✔
3414759✔
3513037✔
3612163✔
3712413✔
3814087✔
3917509✔
4023027✔
4131013✔
4241863✔
4355997✔
4473859✔
4595917✔
46122663✔
47154613✔
48192307✔

Computational verification

Verification is performed by evaluating the polynomial at consecutive integer values of n, testing primality on |P(n)| until the first composite occurs. Factoring the stop value makes the check transparent and reproducible.

SageMath / SageCell (online)

# Paste into https://sagecell.sagemath.org/

def Q(n):
    return n^4 - 96*n^3 + 3153*n^2 - 40752*n + 192307

for n in range(0, 200):
    v = abs(Q(n))
    if not is_prime(v):
        print("STOP n =", n, " Q(n) =", v, " factor =", factor(v))
        break

PARI/GP (online or local)

Q(n)=n^4-96*n^3+3153*n^2-40752*n+192307;
for(n=0,200,
  if(!isprime(abs(Q(n))),
    print("STOP n=",n,"  Q(n)=",abs(Q(n)),"  fact=",factor(abs(Q(n))));
    break
  )
);

Expected output: STOP n=49 Q(n)=236309 fact=67*3527.