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.

A385729 Number of nonnegative values s < n such that (-s) == (-s)^s == s^s (mod n).

Table of values

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

List of values

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