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.

A367214 Number of strict 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 0
3 1
4 0
5 1
6 2
7 2
8 3
9 4
10 5
11 5
12 7
13 8
14 10
15 12
16 14
17 17
18 21
19 25
20 30
21 36
22 43
23 51
24 60
25 71
26 83
27 97
28 113
29 132
30 153
31 178
32 205
33 238
34 272
35 315
36 360
37 413
38 471
39 539
40 613
41 698
42 792
43 899
44 1018
45 1153
46 1302
47 1470
48 1658
49 1867
50 2100
51 2362
52 2652
53 2974
54 3335
55 3734
56 4178
57 4672

List of values

[1, 1, 0, 1, 0, 1, 2, 2, 3, 4, 5, 5, 7, 8, 10, 12, 14, 17, 21, 25, 30, 36, 43, 51, 60, 71, 83, 97, 113, 132, 153, 178, 205, 238, 272, 315, 360, 413, 471, 539, 613, 698, 792, 899, 1018, 1153, 1302, 1470, 1658, 1867, 2100, 2362, 2652, 2974, 3335, 3734, 4178, 4672]