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.

A367212 Number of integer partitions of n whose length (number of parts) is equal to the sum of some submultiset.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 3
5 5
6 6
7 11
8 15
9 22
10 30
11 43
12 58
13 80
14 106
15 143
16 186
17 248
18 318
19 417
20 530
21 684
22 863
23 1103
24 1379
25 1741
26 2162
27 2707
28 3339
29 4145
30 5081
31 6263
32 7640
33 9357
34 11350
35 13822
36 16692
37 20214
38 24301
39 29300
40 35073
41 42085
42 50208
43 59981
44 71294
45 84866
46 100509
47 119206

List of values

[1, 1, 1, 2, 3, 5, 6, 11, 15, 22, 30, 43, 58, 80, 106, 143, 186, 248, 318, 417, 530, 684, 863, 1103, 1379, 1741, 2162, 2707, 3339, 4145, 5081, 6263, 7640, 9357, 11350, 13822, 16692, 20214, 24301, 29300, 35073, 42085, 50208, 59981, 71294, 84866, 100509, 119206]