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.

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

List of values

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