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.

A364272 Number of strict integer partitions of n containing the sum of some subset of the parts. A variation of sum-full strict partitions.

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 0
5 0
6 1
7 0
8 1
9 0
10 3
11 1
12 4
13 3
14 8
15 6
16 11
17 10
18 17
19 16
20 26
21 25
22 39
23 39
24 54
25 60
26 82
27 84
28 116
29 126
30 160
31 177
32 222
33 242
34 302
35 337
36 402
37 453
38 542
39 601
40 722
41 803
42 936
43 1057
44 1234
45 1373
46 1601
47 1793
48 2056
49 2312
50 2658
51 2950
52 3395
53 3789
54 4281
55 4814
56 5452
57 6048

List of values

[0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 3, 1, 4, 3, 8, 6, 11, 10, 17, 16, 26, 25, 39, 39, 54, 60, 82, 84, 116, 126, 160, 177, 222, 242, 302, 337, 402, 453, 542, 601, 722, 803, 936, 1057, 1234, 1373, 1601, 1793, 2056, 2312, 2658, 2950, 3395, 3789, 4281, 4814, 5452, 6048]