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.

A367215 Number of strict integer partitions of n whose length (number of parts) is not equal to the sum of any subset.

Table of values

n a(n)
0 0
1 0
2 1
3 1
4 2
5 2
6 2
7 3
8 3
9 4
10 5
11 7
12 8
13 10
14 12
15 15
16 18
17 21
18 25
19 29
20 34
21 40
22 46
23 53
24 62
25 71
26 82
27 95
28 109
29 124
30 143
31 162
32 185
33 210
34 240
35 270
36 308
37 347
38 393
39 443
40 500
41 562
42 634
43 711
44 798
45 895
46 1002
47 1120
48 1252
49 1397
50 1558
51 1735
52 1930
53 2146
54 2383
55 2644
56 2930
57 3245

List of values

[0, 0, 1, 1, 2, 2, 2, 3, 3, 4, 5, 7, 8, 10, 12, 15, 18, 21, 25, 29, 34, 40, 46, 53, 62, 71, 82, 95, 109, 124, 143, 162, 185, 210, 240, 270, 308, 347, 393, 443, 500, 562, 634, 711, 798, 895, 1002, 1120, 1252, 1397, 1558, 1735, 1930, 2146, 2383, 2644, 2930, 3245]