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.

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.

Table of values

n a(n)
1 5
2 17
3 19
4 233
5 293
6 977
7 1451
8 1693
9 33301
10 308093

List of values

[5, 17, 19, 233, 293, 977, 1451, 1693, 33301, 308093]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.