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.

A233519 The number of times x^x == x (mod prime(n)) for x in 0 < x < prime(n).

Table of values

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

List of values

[1, 1, 1, 2, 1, 2, 3, 2, 2, 2, 3, 2, 5, 3, 2, 1, 1, 4, 3, 2, 5, 4, 1, 4, 5, 3, 4, 1, 2, 5, 5, 3, 5, 4, 2, 5, 7, 3, 2, 2, 1, 5, 3, 9, 3, 7, 6, 2, 1, 2, 6, 3, 8, 5, 5, 2, 1, 8, 3, 10, 2, 1, 8, 6, 9, 1, 9, 12, 1, 5, 5, 2, 4, 6, 6, 2, 1, 4, 5, 9, 4, 4, 3, 6, 4, 5, 6]