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.

A365922 Number of non-subset-sums of strict integer partitions of n.

Table of values

n a(n)
1 0
2 1
3 2
4 4
5 8
6 11
7 18
8 25
9 38
10 51
11 70
12 93
13 122
14 159
15 206
16 263
17 328
18 420
19 514
20 645
21 776
22 967
23 1154
24 1413
25 1686
26 2042
27 2414
28 2890
29 3394
30 4062
31 4732
32 5598
33 6494
34 7652
35 8836
36 10329
37 11884
38 13833
39 15830
40 18376
41 20936
42 24131
43 27476
44 31547
45 35780
46 40966
47 46292
48 52737

List of values

[0, 1, 2, 4, 8, 11, 18, 25, 38, 51, 70, 93, 122, 159, 206, 263, 328, 420, 514, 645, 776, 967, 1154, 1413, 1686, 2042, 2414, 2890, 3394, 4062, 4732, 5598, 6494, 7652, 8836, 10329, 11884, 13833, 15830, 18376, 20936, 24131, 27476, 31547, 35780, 40966, 46292, 52737]