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.

A249275 a(n) is the smallest b > 1 such that p = prime(n) satisfies b^(p-1) == 1 (mod p^3).

Table of values

n a(n)
1 9
2 26
3 57
4 18
5 124
6 239
7 158
8 333
9 42
10 1215
11 513
12 691
13 1172
14 3038
15 295
16 1468
17 2511
18 15458
19 3859
20 6372
21 923
22 1523
23 5436
24 1148
25 412
26 4943
27 4432
28 5573
29 476
30 68
31 21304
32 30422
33 6021
34 8881
35 33731
36 25667
37 3868
38 3170
39 17987
40 26626
41 43588
42 7296
43 14628
44 22076
45 138057

List of values

[9, 26, 57, 18, 124, 239, 158, 333, 42, 1215, 513, 691, 1172, 3038, 295, 1468, 2511, 15458, 3859, 6372, 923, 1523, 5436, 1148, 412, 4943, 4432, 5573, 476, 68, 21304, 30422, 6021, 8881, 33731, 25667, 3868, 3170, 17987, 26626, 43588, 7296, 14628, 22076, 138057]