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.

A233521 Number of disjoint subsets s of 0..(n-1) such that, for every x in s, x^x (mod n) is in s.

Table of values

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

List of values

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