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.

A334894 Number of maximal subsets of [n] avoiding 3-term arithmetic progressions and containing n if n>0.

Table of values

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

List of values

[1, 1, 1, 2, 2, 1, 3, 6, 15, 4, 20, 7, 18, 6, 1, 3, 10, 29, 54, 123, 2, 16, 44, 170, 2, 31, 2, 10, 24, 70, 1, 10, 2, 2, 10, 26, 2, 2, 82, 221, 20, 1, 3, 10, 27, 58, 167, 408, 831, 2005, 4216, 14, 36, 106, 2, 6, 18, 30, 2, 2, 2, 8, 34, 2, 2, 4, 8, 12, 80, 211]