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.

A341584 Size of the largest subset of the numbers [1..n] which does not contain a 3-term arithmetic progression modulo n.

Table of values

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

List of values

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