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.

A060839 Number of solutions to x^3 == 1 (mod n).

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 3, 1, 3, 1, 1, 1, 3, 3, 1, 1, 1, 3, 3, 1, 3, 1, 1, 1, 1, 3, 3, 3, 1, 1, 3, 1, 1, 1, 3, 3, 3, 3, 3, 1, 1, 3, 3, 1, 3, 1, 1, 1, 3, 1, 1, 3, 1, 3, 1, 3, 3, 1, 1, 1, 3, 3, 9, 1, 3, 1, 3, 1, 1, 3, 1, 3, 3, 3, 1, 3, 3, 3, 3, 1, 3, 1, 1, 3, 1, 3, 1, 1, 1, 3, 9, 1, 3, 1, 3, 1, 3, 3, 3, 1, 1, 1, 3, 3, 3]