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.

A326498 Number of maximal subsets of {1..n} containing no sums of distinct elements.

Table of values

n a(n)
0 1
1 1
2 1
3 3
4 3
5 6
6 11
7 16
8 20
9 32
10 53
11 78
12 107
13 149
14 206
15 292
16 391
17 556
18 782
19 1062
20 1451
21 1929
22 2564
23 3404
24 4431
25 5853
26 7672
27 9999
28 12973
29 16922
30 22194
31 28655
32 36734
33 47036
34 60375
35 76866
36 97892
37 123627
38 157008
39 196633
40 248221
41 311442
42 390859
43 488327
44 610685

List of values

[1, 1, 1, 3, 3, 6, 11, 16, 20, 32, 53, 78, 107, 149, 206, 292, 391, 556, 782, 1062, 1451, 1929, 2564, 3404, 4431, 5853, 7672, 9999, 12973, 16922, 22194, 28655, 36734, 47036, 60375, 76866, 97892, 123627, 157008, 196633, 248221, 311442, 390859, 488327, 610685]