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.

A239061 Number of integers x, 1 <= x <= n, such that x^x == 1 (mod n).

Table of values

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

List of values

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