|
|
A121270
|
|
Prime Sierpinski numbers of the first kind: primes of the form k^k+1.
|
|
11
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Sierpinski proved that k>1 must be of the form 2^(2^j) for k^k+1 to be a prime. All a(n) > 2 must be the Fermat numbers F(m) with m = j+2^j = A006127(j). [Edited by Jeppe Stig Nielsen, Jul 09 2023]
|
|
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, Mar 20 2010
|
|
LINKS
|
|
|
MATHEMATICA
|
Do[f=n^n+1; If[PrimeQ[f], Print[{n, f}]], {n, 1, 1000}]
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,bref
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|