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.

A365918 Number of distinct non-subset-sums of integer partitions of n.

Table of values

n a(n)
1 0
2 1
3 2
4 6
5 8
6 19
7 24
8 46
9 60
10 101
11 124
12 206
13 250
14 378
15 462
16 684
17 812
18 1165
19 1380
20 1927
21 2268
22 3108
23 3606
24 4862
25 5648
26 7474
27 8576
28 11307
29 12886
30 16652
31 19050
32 24420
33 27584
34 35225
35 39604
36 49920
37 56370
38 70540
39 78608
40 98419
41 109666
42 135212
43 151176
44 185875
45 205308

List of values

[0, 1, 2, 6, 8, 19, 24, 46, 60, 101, 124, 206, 250, 378, 462, 684, 812, 1165, 1380, 1927, 2268, 3108, 3606, 4862, 5648, 7474, 8576, 11307, 12886, 16652, 19050, 24420, 27584, 35225, 39604, 49920, 56370, 70540, 78608, 98419, 109666, 135212, 151176, 185875, 205308]