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.

A256236 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.

Table of values

n a(n)
1 5
2 17
3 449
4 557
5 19601
6 132857
7 4486949
8 126664001
9 2363321449
10 5229752849
11 2486195039249
12 16250570614349
13 83322586961893
14 39699586259362801
15 8042447016668335049
16 449320365877347849601
17 4376479338174582826793

List of values

[5, 17, 449, 557, 19601, 132857, 4486949, 126664001, 2363321449, 5229752849, 2486195039249, 16250570614349, 83322586961893, 39699586259362801, 8042447016668335049, 449320365877347849601, 4376479338174582826793]