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.

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

Table of values

n a(n)
1 129
2 2186
3 32318
4 82681
5 758546
6 6826318
7 21444846
8 44702922
9 178042767
10 393747520
11 1548729003
12 4741156070
13 2203471139
14 3242334565
15 16609835418
16 114175761515
17 30338830655
18 20115543070
19 114457309347
20 370162324382
21 57877856575
22 12692933349
23 280646695286
24 127762186531

List of values

[129, 2186, 32318, 82681, 758546, 6826318, 21444846, 44702922, 178042767, 393747520, 1548729003, 4741156070, 2203471139, 3242334565, 16609835418, 114175761515, 30338830655, 20115543070, 114457309347, 370162324382, 57877856575, 12692933349, 280646695286, 127762186531]