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.

A195637 Number of distinct residues of k^n (mod n), k=0..n-1.

Table of values

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

List of values

[1, 2, 3, 2, 5, 4, 7, 2, 3, 6, 11, 4, 13, 8, 15, 2, 17, 4, 19, 4, 9, 12, 23, 4, 5, 14, 3, 8, 29, 12, 31, 2, 33, 18, 35, 4, 37, 20, 15, 4, 41, 8, 43, 12, 15, 24, 47, 4, 7, 6, 51, 8, 53, 4, 15, 8, 21, 30, 59, 8, 61, 32, 9, 2, 65, 24, 67, 10, 69, 24, 71, 4, 73]