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.

A065295 Number of values of s, 0 < s <= n-1, such that s^s == s (mod n).

Table of values

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

List of values

[0, 1, 1, 2, 1, 4, 2, 4, 3, 4, 1, 7, 2, 5, 7, 6, 3, 8, 2, 9, 7, 5, 2, 13, 5, 8, 3, 11, 2, 14, 3, 6, 8, 8, 9, 13, 2, 7, 9, 17, 5, 18, 3, 11, 13, 5, 2, 19, 9, 12, 11, 13, 1, 8, 11, 18, 9, 7, 1, 27, 4, 7, 20, 10, 16, 18, 3, 13, 8, 21, 2, 23, 5, 6, 16, 14, 13, 23, 4, 27, 9, 11, 1, 31, 13, 10, 12, 20]