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.

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

List of values

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