The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A355959 Primes p such that (p+2)^(p-1) == 1 (mod p^2). 6
 5, 45827 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(3) > 107659373057 if it exists. Primes p such that the Fermat quotient of p base 2 (A007663) is congruent to 1/2 modulo p. - Max Alekseyev, Aug 27 2023 LINKS Table of n, a(n) for n=1..2. PROG (PARI) forprime(p=1, , if(Mod(p+2, p^2)^(p-1)==1, print1(p, ", "))) CROSSREFS (p+k)^(p-1) == 1 (mod p^2): A355960 (k=5), A355961 (k=6), A355962 (k=7), A355963 (k=8), A355964 (k=9), A355965 (k=10). Cf. A007663. Sequence in context: A228547 A193148 A307492 * A165711 A167369 A259161 Adjacent sequences: A355956 A355957 A355958 * A355960 A355961 A355962 KEYWORD nonn,hard,more,bref AUTHOR Felix Fröhlich, Jul 21 2022 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.

Last modified December 6 16:13 EST 2023. Contains 367612 sequences. (Running on oeis4.)