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.

A248865 Primes p that set a new record for the number of bases 1 < b < p for which p is a base-b Wieferich prime.

Original entry on oeis.org

2, 11, 269, 487, 653, 1093, 3511, 1006003
Offset: 1

Views

Author

Felix Fröhlich, Mar 07 2015

Keywords

Comments

Primes p where A242830(i) reaches record values, where i is the index of p in A000040.
The corresponding number of bases are 0, 2, 3, 4, 5, 10, 11, 12. - Jianing Song, Feb 07 2019
From Jeppe Stig Nielsen, Sep 06 2020: (Start)
Note that for a(6) and a(7), all the b values (bases) that are counted are powers of 2; and for a(8) all are powers of 3.
See A334048 for a version where bases b that are powers are not allowed.
One candidate for a(9) is 1645333507; it has 14 bases, the first 13 of which are powers of 5. However, excluding all numbers under 1645333507 as candidates for a(9) may be difficult to do.
(End)

Crossrefs

Subsequence of A175932. Apart from the first term, subsequence of A134307.

Programs

  • PARI
    my(r=-1); forprime(p=2, , my(b=2, i=0); while(b < p, if(Mod(b, p^2)^(p-1)==1, i++); b++); if(i > r, print1(p, ", "); r=i)) \\ changed to include a(1) = 2 by Jianing Song, Feb 07 2019

Extensions

a(1) = 2 inserted by Jianing Song, Feb 07 2019

A252232 a(n) = smallest prime q where exactly n primes p exist such that p < q and q^(p-1) == 1 (mod p^2), i.e., smallest prime base q having exactly n Wieferich primes less than q.

Original entry on oeis.org

5, 17, 19, 233, 293, 977, 1451, 1693, 33301, 308093
Offset: 1

Views

Author

Felix Fröhlich, Dec 15 2014

Keywords

Comments

From Robert G. Wilson v, Mar 11 2015: (Start)
n b p
1: 5 {2}
2: 17 {2, 3}
3: 19 {3, 7, 13}
4: 233 {2, 3, 11, 157}
5: 293 {2, 5, 7, 19, 83}
6: 977 {2, 11, 17, 109, 239, 401}
7: 1451 {5, 7, 11, 13, 83, 173, 1259}
8: 1693 {2, 3, 5, 11, 31, 37, 61, 109}
9: 33301 {2, 3, 5, 7, 43, 293, 317, 383, 1627}
10: 308093 {2, 5, 7, 11, 31, 47, 89, 167, 523, 619}
... (End)

Examples

			a(5) = 293, because q = 293 is the smallest prime for which there are exactly five primes p with p < q such that q^(p-1) == 1 (mod p^2), namely 2, 5, 7, 19 and 83.
		

Crossrefs

For the values of p, see A252582.

Programs

  • PARI
    for(n=1, 10, q=2; while(q > 1, q=nextprime(q+1); i=0; forprime(p=2, q, if(Mod(q, p^2)^(p-1)==1, i++); if(i==n, print1(q, ", "); break({2})))))

A334048 Primes p that set a new record for the number of bases 1 < b < p for which p is a base-b Wieferich prime and b is not a perfect power.

Original entry on oeis.org

2, 11, 71, 269, 653, 5107, 103291, 728471, 2544079
Offset: 1

Views

Author

Jeppe Stig Nielsen, Sep 06 2020

Keywords

Comments

p is a base-b Wieferich prime iff b^(p-1) == 1 (mod p^2).
Records in A248865 sometimes arise when all the b values (bases) are powers of the same small integer. By excluding powers, we find primes that are Wieferich in many "independent" ways.

Examples

			Prime 5107 is Wieferich to six bases (under 5107), namely 560, 1209, 1779, 2621, 4295, 4361, none of which are perfect powers. A prime such as 1093 is Wieferich to ten bases, namely 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024; however, when dismissing perfect powers, only one of the ten bases is left. In fact, no prime less than 5107 has six or more bases when perfect powers are dismissed, so 5107 sets a record and is included in this sequence.
		

Crossrefs

Programs

  • PARI
    r=-oo; forprime(p=2,, i=sum(b=2,p-1,!ispower(b) && Mod(b,p^2)^(p-1)==1); if(i>r, print1(p, ", "); r=i))

Extensions

a(8)-a(9) from Kellen Shenton added by Jeppe Stig Nielsen, Sep 12 2020
Showing 1-3 of 3 results.