5229752849

Appears in sequences

• Smallest b > 1 such that the first n primes p (i.e., A000040(1)-A000040(n)) all satisfy b^(p-1) == 1 (mod p^2), i.e., smallest base b larger than 1 such that any member of the set of first n primes is a base-b Wieferich prime.at n=9A256236
• Triangle read by rows: T(n, k) = smallest base b > 1 such that p = prime(n) is the k-th base-b Wieferich prime for k = 1, 2, 3, ..., n.at n=54A258787
• Smallest b such that the k consecutive primes starting with prime(n) are all base-b Wieferich primes, i.e., satisfy b^(p-1) == 1 (mod p^2). Square array A(n, k), read by antidiagonals downwards.at n=45A286816
• Smallest b such that the k consecutive primes starting with prime(n) are all base-b Wieferich primes, i.e., satisfy b^(p-1) == 1 (mod p^2). Square array A(n, k), read by antidiagonals downwards.at n=46A286816