|
| |
|
|
A121270
|
|
Known primes of the form n^n+1 or prime Sierpinski numbers of the first kind A014566[n].
|
|
2
| | |
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| 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].
|
|
|
REFERENCES
| See e.g. pp. 156-157 in M. Krizek, F. Luca & L. Somer, 17 Lectures on Fermat Numbers, Springer-Verlag NY 2001. - Walter Nissen (nissen(AT)gtcinternet.com), Mar 20 2010
|
|
|
LINKS
| Eric Weisstein's World of Mathematics, Sierpinski Number of 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: A137068 A137066 A175977 * A085603 A042341 A016088
Adjacent sequences: A121267 A121268 A121269 * A121271 A121272 A121273
|
|
|
KEYWORD
| nonn,bref
|
|
|
AUTHOR
| Alexander Adamchuk (alex(AT)kolmogorov.com), Aug 23 2006
|
|
|
EXTENSIONS
| Definition rewritten by Walter Nissen (nissen(AT)gtcinternet.com), Mar 20 2010
|
| |
|
|
