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.

Showing 1-3 of 3 results.

A124121 Primes q which are the lesser of a double Wieferich prime pair. (List of known values of q in increasing order, without multiplicity.)

Original entry on oeis.org

2, 3, 5, 83, 911, 2903
Offset: 1

Views

Author

N. J. A. Sloane, following an email from Robert G. Wilson v, Nov 30 2006

Keywords

Comments

Double Wieferich prime pairs are pairs of primes (p, q) such that q^(p-1) == 1 (mod p^2) and p^(q-1) == 1 (mod q^2). This sequence gives the primes q which are the lesser member (listed second) of such pairs, in increasing order, but without multiplicity:
For example, currently there are two known double Wieferich prime pairs (p, q) with q = 5: (1645333507, 5) and (188748146801, 5). In this sequence, 5 is only listed once, as a(3), and only the lesser value p=1645333507 is listed as A124122(3).
This is just the list of known pairs: there may be gaps, i.e. missing primes.

Crossrefs

See A124122 for values of p.

Programs

  • PARI
    /* The following (highly unoptimized) code misses the value q=5 (corresponding to a very large value of p) */
    default(primelimit,1010000); forprime(q=1, default(primelimit), forprime(p=q+1, default(primelimit),  Mod(p, q^2)^(q-1)-1 & next; Mod(q, p^2)^(p-1)-1 || print1( q", ") || break))  \\ M. F. Hasler, Oct 08 2011

A124122 Least prime p such that (p,q) is a Double Wieferich prime pair for q=A124121(n).

Original entry on oeis.org

1093, 1006003, 1645333507, 4871, 318917, 18787
Offset: 1

Views

Author

N. J. A. Sloane, following an email from Robert G. Wilson v, Nov 30 2006

Keywords

Comments

Double Wieferich prime pairs are pairs of primes (p, q) such that q^(p-1) == 1 (mod p^2) and p^(q-1) == 1 (mod q^2). This sequence gives the (least) value of p corresponding to the q's listed in increasing order (and without multiplicity) in A124121.
This is just the list of known pairs: there may be gaps.
Currently there are two known double Wieferich prime pairs (p, q) with q = 5: (1645333507, 5) and (188748146801, 5). - Alexander Adamchuk, Mar 10 2007

Crossrefs

See A124121 for values of q.

Programs

  • PARI
    /* The following (highly unoptimized) code misses the value a(3) but prints all other values in less than 30 seconds. */
    default(primelimit, 1010000); forprime(q=1, default(primelimit), forprime(p=q+1, default(primelimit),  Mod(p, q^2)^(q-1)-1 & next; Mod(q, p^2)^(p-1)-1 || print1( p, ", ") || break))   \\ M. F. Hasler, Oct 08 2011
    
  • PARI
    a(n) = my(q=prime(n), p=2); while(Mod(p, q^2)^(q-1)!=1 || Mod(q, p^2)^(p-1)!=1, p=nextprime(p+1)); p \\ Felix Fröhlich, Jan 04 2016

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

Original entry on oeis.org

555383, 1767407, 2103107, 2452757, 7400567, 12836987, 14668163, 15404867, 16238303, 19572647, 22796069, 25003799, 26978663, 27370727
Offset: 1

Views

Author

M. F. Hasler, Oct 03 2011

Keywords

Comments

Computed mainly by M. Oakes and D. Broadhurst, cf. link.
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.
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

Crossrefs

Showing 1-3 of 3 results.