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.

A378298 Number of solutions that satisfy the congruence: i^2 == j^2 (mod n) with 1 <= i < j <= n.

Table of values

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

List of values

[0, 0, 1, 2, 2, 2, 3, 8, 6, 4, 5, 14, 6, 6, 15, 24, 8, 12, 9, 26, 22, 10, 11, 48, 20, 12, 27, 38, 14, 30, 15, 64, 36, 16, 41, 66, 18, 18, 43, 88, 20, 44, 21, 62, 72, 22, 23, 136, 42, 40, 57, 74, 26, 54, 67, 128, 64, 28, 29, 150, 30, 30, 105, 160, 80, 72, 33, 98]