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.

A229296 Number of solutions to x^2 + y^2 == n (mod 2*n) for x,y in [0, 2*n).

Table of values

n a(n)
1 2
2 4
3 2
4 8
5 18
6 4
7 2
8 16
9 18
10 36
11 2
12 8
13 50
14 4
15 18
16 32
17 66
18 36
19 2
20 72
21 2
22 4
23 2
24 16
25 130
26 100
27 18
28 8
29 114
30 36
31 2
32 64
33 2
34 132
35 18
36 72
37 146
38 4
39 50
40 144
41 162
42 4
43 2
44 8
45 162
46 4
47 2
48 32
49 98
50 260
51 66
52 200
53 210
54 36
55 18
56 16
57 2
58 228
59 2
60 72
61 242
62 4
63 18
64 128
65 450
66 4
67 2

List of values

[2, 4, 2, 8, 18, 4, 2, 16, 18, 36, 2, 8, 50, 4, 18, 32, 66, 36, 2, 72, 2, 4, 2, 16, 130, 100, 18, 8, 114, 36, 2, 64, 2, 132, 18, 72, 146, 4, 50, 144, 162, 4, 2, 8, 162, 4, 2, 32, 98, 260, 66, 200, 210, 36, 18, 16, 2, 228, 2, 72, 242, 4, 18, 128, 450, 4, 2]