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.

A367213 Number of integer partitions of n whose length (number of parts) is not equal to the sum of any submultiset.

Table of values

n a(n)
0 0
1 0
2 1
3 1
4 2
5 2
6 5
7 4
8 7
9 8
10 12
11 13
12 19
13 21
14 29
15 33
16 45
17 49
18 67
19 73
20 97
21 108
22 139
23 152
24 196
25 217
26 274
27 303
28 379
29 420
30 523
31 579
32 709
33 786
34 960
35 1061
36 1285
37 1423
38 1714
39 1885
40 2265
41 2498
42 2966
43 3280
44 3881
45 4268
46 5049
47 5548
48 6507
49 7170
50 8391
51 9194
52 10744
53 11778
54 13677

List of values

[0, 0, 1, 1, 2, 2, 5, 4, 7, 8, 12, 13, 19, 21, 29, 33, 45, 49, 67, 73, 97, 108, 139, 152, 196, 217, 274, 303, 379, 420, 523, 579, 709, 786, 960, 1061, 1285, 1423, 1714, 1885, 2265, 2498, 2966, 3280, 3881, 4268, 5049, 5548, 6507, 7170, 8391, 9194, 10744, 11778, 13677]