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!)
A196511 Primes q for which there are primes b < c < p such that b^p == c^p == 1 (mod q^2). 4

%I #23 Nov 12 2019 11:33:06

%S 555383,1767407,2103107,2452757,7400567,12836987,14668163,15404867,

%T 16238303,19572647,22796069,25003799,26978663,27370727

%N Primes q for which there are primes b < c < p such that b^p == c^p == 1 (mod q^2).

%C Computed mainly by M. Oakes and D. Broadhurst, cf. link.

%C For all the listed terms, except for a(4)=2452757 and a(11)=22796069, p=(q-1)/2, which implies that they are "safe primes", cf. A005385. For a(4) and a(11), p=(q-1)/4.

%C The subsequence of terms of the form q=2p+1 is A196733. As of today it is complete up to its 51st term, ~2e8. - _M. F. Hasler_, Oct 05 2011

%H D. J. Broadhurst et al., <a href="http://groups.yahoo.com/group/primenumbers/message/23313">Re: Square factors of b^p-1</a> on yahoo group "primenumbers", Sept.-Oct. 2011

%H David Broadhurst and others, <a href="/A196511/a196511.txt">Square factors of b^p-1</a>, digest of 81 messages in primenumbers Yahoo group, Sep 22 - Nov 29, 2011.

%Y Cf. A196733, A124121, A124122, A005384, A005385.

%K nonn,more

%O 1,1

%A _M. F. Hasler_, Oct 03 2011

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 April 23 02:53 EDT 2024. Contains 371906 sequences. (Running on oeis4.)