This site is supported by donations to The OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A178871 2nd Wieferich prime base prime(n). 6
 3511, 1006003, 20771, 491531 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS 2nd prime p such that p^2 divides prime(n)^(p-1) - 1. 2nd prime p such that p divides the Fermat quotient q_p(p_n) = ((p_n)^(p-1) - 1)/p, where p_n = prime(n). a(5) is unknown: 71 is the only known prime p that divides q_p(11). If a(5) is found, the sequence continues a(6) = 863, a(7) = 3, a(8) = 7, a(9) = 2481757. See additional comments, references, links, and cross-refs in A039951 and A174422. LINKS Wikipedia, Generalized Wieferich primes EXAMPLE a(1) = 3511 is the 2nd Wieferich prime A001220(2). a(2) = 1006003 is the 2nd Mirimanoff prime A014127(2). PROG (PARI) {default(primelimit, 10^7); for(n=1, 9, a=prime(n); c=0; forprime(p=2, 10^7, if(Mod(a, p^2)^(p-1)==1, c++; if(c==2, print1(p, ", "); next(2)))); print1(">10^7, "))} \\ Jens Kruse Andersen, Jun 18 2014 CROSSREFS Cf. A039951 = smallest prime p such that p^2 divides n^(p-1) - 1, A174422 = first Wieferich prime base prime(n). Sequence in context: A281002 A273472 A268352 * A317162 A306174 A205071 Adjacent sequences:  A178868 A178869 A178870 * A178872 A178873 A178874 KEYWORD hard,more,nonn AUTHOR Jonathan Sondow, Jun 20 2010, Jun 24 2010 STATUS approved

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

Last modified March 19 04:34 EDT 2019. Contains 321311 sequences. (Running on oeis4.)