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.

A229910 a(n) = |{0 < g < prime(n): both g and g + g^{-1} are primitive roots modulo prime(n)}|, where g^{-1} is the inverse of g modulo prime(n).

Table of values

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

List of values

[0, 0, 0, 0, 2, 0, 4, 2, 4, 4, 2, 4, 8, 6, 10, 8, 14, 4, 4, 12, 8, 6, 20, 24, 16, 16, 12, 26, 8, 16, 14, 12, 24, 14, 32, 10, 20, 18, 40, 48, 44, 4, 30, 16, 32, 18, 14, 18, 56, 8, 60, 40, 12, 40, 64, 64, 72, 20, 40, 32, 36, 80, 22, 44, 24, 72, 22, 36, 86, 32, 84, 88, 40, 24, 28, 94, 104, 28, 76, 28]