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.

A384834 Number of divisors of n such that (-d)^d == -d (mod n).

Table of values

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

List of values

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