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.

A288887 Triangle read by rows: T(n,k) is the number of times k is a member of a sum-free subset of {1, ..., n} for 1 <= k <= n.

Table of values

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

List of values

[1, 1, 1, 2, 2, 3, 3, 2, 4, 3, 5, 3, 7, 5, 7, 7, 5, 7, 8, 10, 8, 12, 8, 12, 13, 17, 13, 18, 16, 13, 17, 13, 23, 18, 25, 19, 28, 21, 30, 21, 40, 32, 43, 32, 47, 37, 29, 40, 29, 40, 45, 57, 45, 63, 43, 62, 44, 66, 45, 65, 72, 95, 71, 104, 70, 102, 85, 66, 95, 71, 89, 72, 132, 109, 139, 104, 142, 116]