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.

A380833 a(n) is the number of divisors d of n satisfying (-d)^n mod n = d.

Table of values

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

List of values

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