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.

A133154 a(n) is the smallest m<=p-1 such that p-1 is the only value of j in 1<=j<=2p for which m^j+j==0 (mod p), where p is the n-th prime.

Table of values

n a(n)
1 0
2 0
3 0
4 2
5 7
6 11
7 2
8 5
9 3
10 8
11 5
12 26
13 2
14 2
15 9
16 16
17 6
18 14
19 9
20 9
21 3
22 10
23 3
24 10
25 4
26 2
27 5
28 2
29 13
30 2
31 3
32 2
33 3
34 21
35 8
36 22
37 2
38 3
39 2
40 5
41 5
42 2
43 3
44 2
45 4
46 2
47 2
48 7
49 44
50 7
51 16
52 3
53 4
54 3
55 2
56 19
57 22
58 3
59 3
60 26
61 7
62 16
63 12
64 2
65 9
66 6
67 2
68 14
69 3
70 4
71 9
72 6
73 4
74 19
75 15
76 6
77 4
78 6
79 16
80 5
81 11
82 9
83 5
84 4
85 2
86 3
87 18
88 3
89 7
90 9
91 18
92 16
93 3
94 8

List of values

[0, 0, 0, 2, 7, 11, 2, 5, 3, 8, 5, 26, 2, 2, 9, 16, 6, 14, 9, 9, 3, 10, 3, 10, 4, 2, 5, 2, 13, 2, 3, 2, 3, 21, 8, 22, 2, 3, 2, 5, 5, 2, 3, 2, 4, 2, 2, 7, 44, 7, 16, 3, 4, 3, 2, 19, 22, 3, 3, 26, 7, 16, 12, 2, 9, 6, 2, 14, 3, 4, 9, 6, 4, 19, 15, 6, 4, 6, 16, 5, 11, 9, 5, 4, 2, 3, 18, 3, 7, 9, 18, 16, 3, 8]