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.

A305191 Table read by rows: T(n,k) is the number of pairs (x,y) mod n such that x^2 + y^2 == k (mod n), for k from 0 to n-1.

Table of values

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

List of values

[1, 2, 2, 1, 4, 4, 4, 8, 4, 0, 9, 4, 4, 4, 4, 2, 8, 8, 2, 8, 8, 1, 8, 8, 8, 8, 8, 8, 8, 16, 16, 0, 8, 16, 0, 0, 9, 12, 12, 0, 12, 12, 0, 12, 12, 18, 8, 8, 8, 8, 18, 8, 8, 8, 8, 1, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 4, 32, 16, 0, 16, 32, 4, 0, 16, 8, 16, 0, 25, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12]