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!)
A284649 Primes p such that 2^(p-1) mod p^2 < p+2. 0

%I #6 Apr 02 2017 12:45:11

%S 2,3,29,37,1093,3373,3511,2001907169

%N Primes p such that 2^(p-1) mod p^2 < p+2.

%C a(9) > 10^12. - _Giovanni Resta_, Mar 31 2017

%o (PARI) forprime(p=2, 1e10, a=lift(Mod(2, p^2)^(p-1)); if(a<p+2, print1(p", ")))

%Y Cf. A001220, A121999, A125854, A196202.

%K nonn,more

%O 1,1

%A _Gionata Neri_, Mar 31 2017

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 14 12:12 EDT 2024. Contains 372532 sequences. (Running on oeis4.)