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!)
A102327 Primes p such that the largest prime factor of p^5 + 1 is less than p. 0
1753, 2357, 7103, 9749, 13441, 16453, 21467, 22739, 25153, 28409, 29059, 33247, 33347, 36781, 42853, 51427, 57751, 58453, 62347, 65777, 66593, 69119, 72923, 78643, 80407, 83591, 85619, 89909, 91411, 99409, 101209, 101363, 113171, 124337 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
FORMULA
Solutions to {A006530(1 + p^5) < p} where p is a prime.
EXAMPLE
p = 1753, 1 + p^5 = 16554252702583994 = 2*41*151*691*877*1361*1621, so the largest prime factor is 1621 < p = 1753.
MATHEMATICA
<<NumberTheory`NumberTheoryFunctions` Select[Prime[Range[15000]], Max[PrimeFactorList[1 + #^5]] < # &] (* Ray Chandler, Jan 08 2005 *)
Select[Prime[Range[12000]], FactorInteger[#^5+1][[-1, 1]]<#&] (* Harvey P. Dale, Mar 14 2011 *)
PROG
(PARI) isok(p)= isprime(p) && (vecmax(factor(p^5+1)[, 1]) < p); \\ Michel Marcus, Jul 11 2018
CROSSREFS
Sequence in context: A143994 A157325 A223448 * A076809 A272326 A271747
KEYWORD
nonn
AUTHOR
Labos Elemer, Jan 05 2005
EXTENSIONS
Extended by Ray Chandler, Jan 08 2005
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 May 20 08:57 EDT 2024. Contains 372710 sequences. (Running on oeis4.)