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.

A117660 Number of solutions to x^(k+3)=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 4
8 5
9 6
10 4
11 2
12 6
13 4
14 8
15 4
16 9
17 2
18 12
19 4
20 6
21 8
22 4
23 2
24 10
25 6
26 8
27 12
28 12
29 2
30 8
31 4
32 17
33 4
34 4
35 8
36 18
37 4
38 8
39 8
40 10
41 2
42 16
43 4
44 6
45 12
46 4
47 2
48 18
49 10
50 12
51 4
52 12
53 2
54 24
55 4
56 20
57 8
58 4
59 2
60 12
61 4
62 8
63 24
64 33
65 8
66 8
67 4
68 6
69 4
70 16
71 2
72 30
73 4
74 8
75 12
76 12
77 8
78 16
79 4

List of values

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