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.

A380656 a(n) is the number of divisors d such that -d^n mod n = d.

Table of values

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

List of values

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