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.

A108499 Number of values of k (1<=k<=n) where k^(n+1) = k mod n, or equivalently where sum_i{1<=i<=n} k^i = 0 mod n.

Table of values

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

List of values

[1, 2, 2, 3, 2, 6, 2, 5, 4, 6, 2, 9, 2, 6, 4, 9, 2, 14, 2, 15, 8, 6, 2, 15, 6, 6, 10, 9, 2, 18, 2, 17, 4, 6, 4, 21, 2, 6, 8, 25, 2, 42, 2, 9, 8, 6, 2, 27, 8, 22, 4, 15, 2, 38, 12, 15, 8, 6, 2, 45, 2, 6, 16, 33, 4, 18, 2, 15, 4, 18, 2, 35, 2, 6, 12, 9, 4, 42, 2, 45, 28, 6, 2, 63, 4, 6, 4, 15, 2, 42, 4]