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.

A087688 a(n) = number of solutions to x^3 - x == 0 (mod n).

Table of values

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

List of values

[1, 2, 3, 3, 3, 6, 3, 5, 3, 6, 3, 9, 3, 6, 9, 5, 3, 6, 3, 9, 9, 6, 3, 15, 3, 6, 3, 9, 3, 18, 3, 5, 9, 6, 9, 9, 3, 6, 9, 15, 3, 18, 3, 9, 9, 6, 3, 15, 3, 6, 9, 9, 3, 6, 9, 15, 9, 6, 3, 27, 3, 6, 9, 5, 9, 18, 3, 9, 9, 18]