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.

A060594 Number of solutions to x^2 == 1 (mod n), that is, square roots of unity modulo n.

Table of values

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

List of values

[1, 1, 2, 2, 2, 2, 2, 4, 2, 2, 2, 4, 2, 2, 4, 4, 2, 2, 2, 4, 4, 2, 2, 8, 2, 2, 2, 4, 2, 4, 2, 4, 4, 2, 4, 4, 2, 2, 4, 8, 2, 4, 2, 4, 4, 2, 2, 8, 2, 2, 4, 4, 2, 2, 4, 8, 4, 2, 2, 8, 2, 2, 4, 4, 4, 4, 2, 4, 4, 4, 2, 8, 2, 2, 4, 4, 4, 4, 2, 8, 2, 2, 2, 8, 4, 2, 4, 8, 2, 4, 4, 4, 4, 2, 4, 8, 2, 2, 4, 4, 2, 4, 2]