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.

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

Table of values

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

List of values

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