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.

A259234 Smallest b > 1 not occurring earlier in the sequence such that p = prime(n) satisfies b^(p-1) == 1 (mod p^2).

Table of values

n a(n)
1 5
2 8
3 7
4 18
5 3
6 19
7 38
8 28
9 42
10 14
11 115
12 76
13 51
14 75
15 53
16 338
17 137
18 264
19 143
20 11
21 306
22 31
23 99
24 184
25 107
26 181
27 43
28 164
29 96
30 68
31 62
32 58
33 161
34 328
35 313
36 78
37 226
38 65
39 253
40 259
41 532
42 298
43 176
44 276
45 284
46 174
47 165
48 69
49 330
50 44
51 33
52 332
53 94
54 263
55 48
56 79
57 171
58 747
59 731

List of values

[5, 8, 7, 18, 3, 19, 38, 28, 42, 14, 115, 76, 51, 75, 53, 338, 137, 264, 143, 11, 306, 31, 99, 184, 107, 181, 43, 164, 96, 68, 62, 58, 161, 328, 313, 78, 226, 65, 253, 259, 532, 298, 176, 276, 284, 174, 165, 69, 330, 44, 33, 332, 94, 263, 48, 79, 171, 747, 731]