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.

A280721 a(n) is the n-th b > 1 such that p = prime(n) satisfies b^(p-1) == 1 (mod p^2).

Table of values

n a(n)
1 5
2 10
3 24
4 31
5 81
6 89
7 134
8 127
9 255
10 267
11 430
12 476
13 744
14 424
15 629
16 895
17 1105
18 1079
19 1301
20 1331
21 1440
22 2092
23 1451
24 2466
25 2488
26 2140
27 3326
28 2638
29 2815
30 3517
31 4345
32 4138
33 4505
34 4659
35 5571
36 6021
37 5383
38 5460
39 6071
40 6844
41 8434
42 7076
43 8961
44 10215
45 7522
46 9817
47 11499

List of values

[5, 10, 24, 31, 81, 89, 134, 127, 255, 267, 430, 476, 744, 424, 629, 895, 1105, 1079, 1301, 1331, 1440, 2092, 1451, 2466, 2488, 2140, 3326, 2638, 2815, 3517, 4345, 4138, 4505, 4659, 5571, 6021, 5383, 5460, 6071, 6844, 8434, 7076, 8961, 10215, 7522, 9817, 11499]