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.

A286510 Number of primitive roots g mod prime(n) for which there is no solution to g^x == x (mod p) with 2 <= x <= prime(n)-2.

Table of values

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

List of values

[1, 1, 1, 1, 2, 1, 1, 3, 4, 2, 1, 6, 5, 2, 9, 11, 12, 5, 7, 9, 8, 8, 17, 12, 11, 16, 12, 23, 20, 16, 17, 17, 23, 17, 26, 18, 19, 25, 26, 32, 38, 21, 21, 18, 27, 25, 24, 27, 52, 30, 44, 33, 19, 44, 54, 45, 57, 14, 29, 27, 39, 58, 28, 41, 39, 62, 26, 25, 69, 48, 51, 61, 44, 47, 37, 63, 77, 55, 55, 41]