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.

A262347 Number of subsets of [1..n] of maximal size that are free of 3-term arithmetic progressions.

Table of values

n a(n)
0 1
1 1
2 1
3 3
4 2
5 1
6 4
7 10
8 25
9 4
10 24
11 7
12 25
13 6
14 1
15 4
16 14
17 43
18 97
19 220
20 2
21 18
22 62
23 232
24 2
25 33
26 2
27 12
28 36
29 106
30 1
31 11
32 2
33 4
34 14
35 40
36 2
37 4
38 86
39 307
40 20
41 1
42 4
43 14
44 41
45 99
46 266
47 674
48 1505
49 3510
50 7726
51 14
52 50
53 156
54 2
55 8
56 26
57 56
58 2
59 4
60 6
61 14
62 48
63 2
64 4
65 8
66 16
67 28
68 108
69 319
70 1046
71 4
72 26
73 82
74 1
75 2

List of values

[1, 1, 1, 3, 2, 1, 4, 10, 25, 4, 24, 7, 25, 6, 1, 4, 14, 43, 97, 220, 2, 18, 62, 232, 2, 33, 2, 12, 36, 106, 1, 11, 2, 4, 14, 40, 2, 4, 86, 307, 20, 1, 4, 14, 41, 99, 266, 674, 1505, 3510, 7726, 14, 50, 156, 2, 8, 26, 56, 2, 4, 6, 14, 48, 2, 4, 8, 16, 28, 108, 319, 1046, 4, 26, 82, 1, 2]