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.

A117658 Number of solutions to x^(k+1) = x^k mod n for some k >= 1.

Table of values

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

List of values

[1, 2, 2, 3, 2, 4, 2, 5, 4, 4, 2, 6, 2, 4, 4, 9, 2, 8, 2, 6, 4, 4, 2, 10, 6, 4, 10, 6, 2, 8, 2, 17, 4, 4, 4, 12, 2, 4, 4, 10, 2, 8, 2, 6, 8, 4, 2, 18, 8, 12, 4, 6, 2, 20, 4, 10, 4, 4, 2, 12, 2, 4, 8, 33, 4, 8, 2, 6, 4, 8, 2, 20, 2, 4, 12]