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.

A376756 Number of pairs 0 <= x <= y <= n-1 such that x^2 + x*y + y^2 == 0 (mod n).

Table of values

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

List of values

[1, 1, 3, 3, 1, 3, 7, 3, 6, 1, 1, 9, 13, 7, 3, 10, 1, 6, 19, 3, 21, 1, 1, 9, 15, 13, 18, 27, 1, 3, 31, 10, 3, 1, 7, 21, 37, 19, 39, 3, 1, 21, 43, 3, 6, 1, 1, 30, 70, 15, 3, 51, 1, 18, 1, 27, 57, 1, 1, 9, 61, 31, 60, 36, 13, 3, 67, 3, 3, 7, 1, 21, 73, 37, 45, 75, 7, 39, 79, 10, 45, 1, 1, 81, 1, 43, 3, 3, 1, 6, 163, 3, 93, 1, 19, 30, 97]