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.

A124882 Maximum number of distinct squares in arithmetic progression modulo prime(n).

Table of values

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

List of values

[2, 2, 3, 3, 3, 4, 5, 4, 5, 4, 4, 4, 5, 5, 5, 6, 5, 6, 6, 7, 9, 6, 7, 6, 9, 7, 7, 6, 10, 5, 7, 8, 6, 5, 6, 7, 6, 6, 6, 6, 6, 6, 7, 9, 7, 6, 7, 7, 7, 6, 7, 7, 13, 7, 6, 7, 9, 7, 10, 7, 9, 9, 7, 11, 9, 7, 8, 9, 8, 6, 8, 8, 9, 6, 8, 8, 8, 8, 9, 13, 8, 12, 7, 9, 10, 8, 9, 9, 8, 8, 11, 13, 8, 8, 10, 8, 9, 8, 10, 10]