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.

A316975 a(n) is the minimum number of occurrences of the same value (r0-r1+n) mod n for all pairs (r0,r1) of quadratic residues mod n.

Table of values

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

List of values

[1, 2, 1, 1, 1, 2, 2, 1, 1, 2, 3, 1, 3, 4, 1, 1, 4, 2, 5, 1, 2, 6, 6, 1, 2, 6, 2, 2, 7, 2, 8, 1, 3, 8, 2, 1, 9, 10, 3, 1, 10, 4, 11, 3, 1, 12, 12, 1, 8, 4, 4, 3, 13, 4, 3, 2, 5, 14, 15, 1, 15, 16, 2, 1, 3, 6, 17, 4, 6, 4, 18, 1, 18, 18, 2, 5, 6, 6, 20, 1, 4, 20]