|
Search: id:A074966
|
|
| |
|
| 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; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Or, least k such that n^n + k is prime.
"Are there any n except 1, 2 and 4 that make n^n + 1 a prime? He [Sierpinski] 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.
|
|
MATHEMATICA
|
PrimeNextDelta[n_]:=Module[{k}, k=n+1; While[ !PrimeQ[k], k++ ]; k=k-n]; lst={}; Do[AppendTo[lst, PrimeNextDelta[n^n]], {n, 5!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Jun 11 2009]
|
|
CROSSREFS
|
Cf. A055385, A074967.
Sequence in context: A050139 A010255 A085752 this_sequence A128413 A058843 A130559
Adjacent sequences: A074963 A074964 A074965 this_sequence A074967 A074968 A074969
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Zak Seidov (zakseidov(AT)yahoo.com), Oct 03 2002
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Oct 04 2002
|
|
|
Search completed in 0.002 seconds
|
