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.

A333570 Number of nonnegative values c such that c^n == -c (mod n).

Table of values

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

List of values

[1, 2, 1, 2, 1, 4, 1, 2, 1, 4, 1, 4, 1, 4, 3, 2, 1, 4, 1, 4, 1, 4, 1, 4, 1, 4, 1, 8, 1, 8, 1, 2, 1, 4, 3, 4, 1, 4, 3, 4, 1, 8, 1, 4, 1, 4, 1, 4, 1, 4, 3, 8, 1, 4, 3, 4, 1, 4, 1, 8, 1, 4, 1, 2, 1, 24, 1, 4, 1, 16, 1, 4, 1, 4, 3, 8, 1, 8, 1, 4, 1, 4, 1, 8, 5, 4, 3, 4, 1, 8, 7, 4, 1, 4, 3]