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.

A387400 Number of nonnegative s < n such that s^s == s^n (mod n).

Table of values

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

List of values

[1, 1, 1, 2, 1, 4, 2, 3, 3, 5, 1, 7, 2, 6, 8, 7, 3, 8, 2, 9, 7, 5, 2, 12, 5, 6, 9, 11, 2, 15, 3, 15, 8, 7, 9, 13, 2, 8, 8, 17, 5, 18, 3, 11, 14, 7, 2, 24, 9, 13, 10, 14, 1, 20, 11, 17, 9, 8, 1, 27, 4, 9, 19, 31, 15, 18, 3, 12, 10, 22, 2, 23, 5, 9, 17, 13, 16, 23, 4, 33, 26, 10, 1, 31, 13, 9, 12, 20, 4, 27]