

A074966


a(n) = least k such that n^n + k is prime.


10



1, 1, 2, 1, 12, 7, 4, 43, 10, 19, 62, 35, 16, 27, 28, 13, 74, 107, 18, 91, 32, 87, 14, 95, 96, 43, 68, 135, 120, 19, 58, 7, 58, 63, 54, 31, 42, 115, 10, 157, 110, 13, 4, 403, 122, 457, 534, 37, 18, 31, 226, 253, 20, 193, 102, 177, 392, 45, 194, 257, 102, 79, 454, 231, 306
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,3


COMMENTS

"Are there any n except 1, 2 and 4 that make n^n + 1 a prime? He [Sierpiński] has shown that if such a prime exists it is greater than 10^30000."  Ogilvy and Anderson


REFERENCES

C. Stanley Ogilvy and John T. Anderson, Excursions in Number Theory. Dover. New York: 1988. Page 82.


LINKS



MATHEMATICA

Array[Block[{k = 1}, While[! PrimeQ[k + #], k++]; k] &[#^#] &, 65] (* Michael De Vlieger, Jul 06 2018 *)


PROG



CROSSREFS



KEYWORD

nonn


AUTHOR



EXTENSIONS



STATUS

approved



