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.

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

Table of values

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

List of values

[1, 2, 2, 3, 2, 3, 2, 4, 3, 3, 2, 4, 2, 3, 4, 4, 2, 5, 2, 4, 4, 3, 2, 5, 3, 3, 4, 4, 2, 5, 2, 5, 4, 3, 4, 7, 2, 3, 4, 5, 2, 5, 2, 4, 6, 3, 2, 6, 3, 5, 4, 4, 2, 7, 4, 5, 4, 3, 2, 6, 2, 3, 6, 6, 4, 5, 2, 4, 4, 5, 2, 9, 2, 3, 6, 4, 4, 5, 2, 6, 5, 3, 2, 6, 4, 3, 4, 5, 2, 8, 4, 4, 4, 3, 4, 7, 2, 5, 6, 7]