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.

A364755 Number of subsets of {1..n} containing n but not containing the sum of any two distinct elements.

Table of values

n a(n)
0 0
1 1
2 2
3 3
4 6
5 9
6 15
7 24
8 41
9 60
10 99
11 149
12 236
13 355
14 552
15 817
16 1275
17 1870
18 2788
19 4167
20 6243
21 9098
22 13433
23 19718
24 28771
25 42137
26 60652
27 88603
28 127555
29 185200
30 261781
31 382931
32 541022
33 783862
34 1096608
35 1595829
36 2217467
37 3223064
38 4441073
39 6465800
40 8893694

List of values

[0, 1, 2, 3, 6, 9, 15, 24, 41, 60, 99, 149, 236, 355, 552, 817, 1275, 1870, 2788, 4167, 6243, 9098, 13433, 19718, 28771, 42137, 60652, 88603, 127555, 185200, 261781, 382931, 541022, 783862, 1096608, 1595829, 2217467, 3223064, 4441073, 6465800, 8893694]