The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A055385 Smallest prime factor of n^n + 1. 6
2, 5, 2, 257, 2, 13, 2, 97, 2, 101, 2, 89, 2, 29, 2, 274177, 2, 5, 2, 148721, 2, 5, 2, 17, 2, 53, 2, 449, 2, 17, 2, 641, 2, 13, 2, 17, 2, 5, 2, 17, 2, 5, 2, 41, 2, 29, 2, 769, 2, 41, 2, 89, 2, 13, 2, 17, 2, 5, 2, 17, 2, 5, 2, 59649589127497217, 2, 37, 2, 41, 2, 13, 2, 97, 2, 149 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
If we use the commonly accepted convention that 0^0 = 1, then a(0) = 2. - Chai Wah Wu, Jul 22 2019
REFERENCES
C. Stanley Ogilvy and John T. Anderson, Excursions in Number Theory. Dover. New York: 1988. Page 82.
LINKS
EXAMPLE
4^4 + 1 = 257 prime, so a(4) = 257;
6^6 + 1 = 13 * 37 * 97, so a(6) = 13.
MATHEMATICA
Table[FactorInteger[n^n + 1][[1, 1]], {n, 74}] (* Vincenzo Librandi, Jul 23 2013 *)
PROG
(PARI) a(n) = {if (n % 2, return (2)); return (factor(n^n + 1)[1, 1]); } \\ Michel Marcus, Jul 23 2013
CROSSREFS
Sequence in context: A328264 A170908 A229029 * A160503 A108429 A130280
KEYWORD
nonn
AUTHOR
Walter Nissen, Jun 24 2000
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 8 17:52 EDT 2024. Contains 373227 sequences. (Running on oeis4.)