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.

A325866 Number of subsets of {1..n} containing n such that every subset has a different sum.

Table of values

n a(n)
1 1
2 2
3 3
4 6
5 9
6 14
7 20
8 35
9 44
10 76
11 96
12 139
13 179
14 257
15 312
16 483
17 561
18 793
19 970
20 1459
21 1535
22 2307
23 2619
24 3503
25 4130
26 5478
27 5973
28 8165
29 9081
30 11666
31 13176
32 17738
33 18440
34 24778
35 26873
36 35187
37 38070
38 49978
39 51776
40 72457
41 74207
42 92512
43 102210
44 135571
45 136786
46 179604

List of values

[1, 2, 3, 6, 9, 14, 20, 35, 44, 76, 96, 139, 179, 257, 312, 483, 561, 793, 970, 1459, 1535, 2307, 2619, 3503, 4130, 5478, 5973, 8165, 9081, 11666, 13176, 17738, 18440, 24778, 26873, 35187, 38070, 49978, 51776, 72457, 74207, 92512, 102210, 135571, 136786, 179604]