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.

A376646 Number of solutions to x + y == x^2 + y^2 (mod n) with x <= y.

Table of values

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

List of values

[1, 3, 3, 6, 3, 10, 5, 10, 7, 10, 7, 20, 7, 18, 10, 18, 9, 26, 11, 20, 18, 26, 13, 36, 11, 26, 19, 36, 15, 36, 17, 34, 26, 34, 18, 52, 19, 42, 26, 36, 21, 68, 23, 52, 26, 50, 25, 68, 29, 42, 34, 52, 27, 74, 26, 68, 42, 58, 31, 72, 31, 66, 50, 66, 26, 100, 35, 68, 50, 68]