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.

A353942 Smallest b > 1 such that b^(p-1) == 1 (mod p^9) for p = prime(n).

Table of values

n a(n)
1 513
2 19682
3 280182
4 14906455
5 676386984
6 822557039
7 8185328614
8 1835323405
9 147534349327
10 430099398783
11 746688111476
12 3054750102760
13 9430469115218
14 42562034654367
15 92084372092298
16 28307243117603
17 17362132628379
18 430275700643181
19 478910674129864
20 69114209866295

List of values

[513, 19682, 280182, 14906455, 676386984, 822557039, 8185328614, 1835323405, 147534349327, 430099398783, 746688111476, 3054750102760, 9430469115218, 42562034654367, 92084372092298, 28307243117603, 17362132628379, 430275700643181, 478910674129864, 69114209866295]