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.

A229297 Number of solutions to x^2 == n (mod 2*n) for 0 <= x < 2*n.

Table of values

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

List of values

[1, 0, 1, 2, 1, 0, 1, 0, 3, 0, 1, 2, 1, 0, 1, 4, 1, 0, 1, 2, 1, 0, 1, 0, 5, 0, 3, 2, 1, 0, 1, 0, 1, 0, 1, 6, 1, 0, 1, 0, 1, 0, 1, 2, 3, 0, 1, 4, 7, 0, 1, 2, 1, 0, 1, 0, 1, 0, 1, 2, 1, 0, 3, 8, 1, 0, 1, 2, 1, 0, 1, 0, 1, 0, 5, 2, 1, 0, 1, 4, 9, 0, 1, 2, 1, 0]