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.

A385104 Triangle read by rows: T(n,k) is the number of residue classes obtained by solving mod(x^2,n) = k for x over the integers, n >= 1, k >= 0.

Table of values

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

List of values

[1, 1, 1, 1, 2, 0, 2, 2, 0, 0, 1, 2, 0, 0, 2, 1, 2, 0, 1, 2, 0, 1, 2, 2, 0, 2, 0, 0, 2, 4, 0, 0, 2, 0, 0, 0, 3, 2, 0, 0, 2, 0, 0, 2, 0, 1, 2, 0, 0, 2, 1, 2, 0, 0, 2, 1, 2, 0, 2, 2, 2, 0, 0, 0, 2, 0, 2, 4, 0, 0, 4, 0, 0, 0, 0, 2, 0, 0, 1, 2, 0, 2, 2, 0, 0, 0, 0, 2, 2, 0, 2, 1, 2, 2, 0, 2, 0, 0, 1, 2]