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.

A087782 a(n) = number of solutions to x^3 + x == 0 (mod n).

Table of values

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

List of values

[1, 2, 1, 1, 3, 2, 1, 1, 1, 6, 1, 1, 3, 2, 3, 1, 3, 2, 1, 3, 1, 2, 1, 1, 3, 6, 1, 1, 3, 6, 1, 1, 1, 6, 3, 1, 3, 2, 3, 3, 3, 2, 1, 1, 3, 2, 1, 1, 1, 6, 3, 3, 3, 2, 3, 1, 1, 6, 1, 3, 3, 2, 1, 1, 9, 2, 1, 3, 1, 6, 1, 1, 3, 6, 3, 1, 1, 6, 1, 3, 1, 6, 1, 1, 9, 2, 3, 1, 3, 6, 3, 1, 1, 2, 3, 1, 3, 2, 1, 3, 3, 6, 1, 3, 3]