OFFSET
1,1
COMMENTS
The Mathematica program tests for probable primality. It is unclear which of the numbers k^k - k + 1 have been proved prime. - Dean Hickerson, Apr 26 2003
The first four terms result from deterministic primality tests, while terms >= 156 currently correspond to probable primes. - Giuseppe Coppoletta, Dec 26 2014
If it exists, a(9) > 32000. - Dmitry Petukhov, Sep 12 2021
LINKS
Eric Weisstein's World of Mathematics, Primality Test
MAPLE
select(n -> isprime(n^n-n+1), [$1..3000]); # Robert Israel, Dec 29 2014
MATHEMATICA
Do[If[PrimeQ[n^n-n+1], Print[n]], {n, 1, 3000}]
PROG
(Sage) [n for n in (1..155) if (n^n-n+1).is_prime(proof=True)]
# deterministic test
(Sage) [n for n in (1..5000) if (n^n-n+1).is_prime(proof=False)]
# probabilistic test Giuseppe Coppoletta, Dec 26 2014
(PARI) is(n)=ispseudoprime(n^n-n+1) \\ Charles R Greathouse IV, Jun 13 2017
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Robert G. Wilson v, Dec 05 2001
EXTENSIONS
More terms from John Sillcox (JMS21187(AT)aol.com), Apr 23 2003
STATUS
approved