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.

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

Table of values

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

List of values

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