cp's OEIS Frontend

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.

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

This page as a plain text file.
%I A284649 #10 Jul 29 2024 06:20:38
%S A284649 2,3,29,37,1093,3373,3511,2001907169
%N A284649 Primes p such that 2^(p-1) mod p^2 < p+2.
%C A284649 a(9) > 10^12. - _Giovanni Resta_, Mar 31 2017
%o A284649 (PARI)  forprime(p=2, 1e10, a=lift(Mod(2, p^2)^(p-1)); if(a<p+2, print1(p", ")))
%Y A284649 Union of A001220 and A125854.
%Y A284649 Cf. A121999, A196202.
%K A284649 nonn,more
%O A284649 1,1
%A A284649 _Gionata Neri_, Mar 31 2017