|
Search: id:A121270
|
|
|
| A121270 |
|
Primes of the form n^n+1 or prime Sierpinski numbers of the first kind A014566[n]. |
|
+0
2
|
| |
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Sierpinski proved that n must be of the form 2^2^k for n^n+1 to be a prime. All a(n) must be the Fermat numbers F(m) with m = k+2^k = A006127[k].
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics. Sierpinski Numberof the First Kind
|
|
MATHEMATICA
|
Do[f=n^n+1; If[PrimeQ[f], Print[{n, f}]], {n, 1, 1000}]
|
|
CROSSREFS
|
Cf. A014566, A048861, A006127, A000215.
Sequence in context: A135724 A137068 A137066 this_sequence A085603 A042341 A016088
Adjacent sequences: A121267 A121268 A121269 this_sequence A121271 A121272 A121273
|
|
KEYWORD
|
nonn,bref
|
|
AUTHOR
|
Alexander Adamchuk (alex(AT)kolmogorov.com), Aug 23 2006
|
|
|
Search completed in 0.002 seconds
|
