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.

A384781 Number of values of s, 0 < s <= n - 1, such that (-s)^s == s (mod n).

Table of values

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

List of values

[0, 1, 0, 0, 1, 2, 1, 0, 1, 4, 0, 1, 1, 3, 3, 0, 0, 4, 0, 1, 2, 3, 1, 1, 3, 6, 1, 3, 1, 6, 1, 0, 3, 2, 2, 3, 3, 3, 2, 1, 1, 6, 0, 3, 5, 3, 1, 1, 3, 8, 2, 2, 2, 4, 3, 2, 1, 5, 0, 3, 3, 3, 7, 0, 5, 6, 0, 1, 3, 8, 1, 3, 3, 8, 5, 3, 4, 6, 1, 1, 4, 3, 0, 5, 2, 4, 6, 2, 4, 10, 5, 2, 3, 3, 2, 1, 4, 8, 5, 5]