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.

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

Table of values

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

List of values

[1, 2, 3, 4, 3, 6, 3, 8, 5, 6, 3, 12, 3, 6, 9, 12, 3, 10, 3, 12, 9, 6, 3, 24, 7, 6, 11, 12, 3, 18, 3, 20, 9, 6, 9, 20, 3, 6, 9, 24, 3, 18, 3, 12, 15, 6, 3, 36, 9, 14, 9, 12, 3, 22, 9, 24, 9, 6, 3, 36, 3, 6, 15, 36, 9, 18, 3, 12, 9, 18, 3, 40, 3, 6, 21]