| a(2)=251 is the only prime found for n up to 10000 using The C/Gmp program in the
link which is 17 times faster than the Pari routine.
Here there are divisibility rules: If prime(n) and prime(n+1) do
not differ by 6, then n^2+n+1 is a divisor. So finding primes in
this case will be difficult since 5/6 of the numbers are composite at the on set.
If another prime exists, it is larger than 418977 digits.
| 