A284649 Primes p such that 2^(p-1) mod p^2 < p+2.
2, 3, 29, 37, 1093, 3373, 3511, 2001907169
Offset: 1
Programs
-
PARI
forprime(p=2, 1e10, a=lift(Mod(2, p^2)^(p-1)); if(a
This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
forprime(p=2, 1e10, a=lift(Mod(2, p^2)^(p-1)); if(a
Comments