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.

A364349 Number of strict integer partitions of n containing the sum of no subset of the parts.

Table of values

n a(n)
0 1
1 1
2 1
3 2
4 2
5 3
6 3
7 5
8 5
9 8
10 7
11 11
12 11
13 15
14 14
15 21
16 21
17 28
18 29
19 38
20 38
21 51
22 50
23 65
24 68
25 82
26 83
27 108
28 106
29 130
30 136
31 163
32 168
33 206
34 210
35 248
36 266
37 307
38 322
39 381
40 391
41 457
42 490
43 553
44 582
45 675
46 703
47 797
48 854
49 952
50 1000
51 1147
52 1187
53 1331
54 1437
55 1564
56 1656
57 1869

List of values

[1, 1, 1, 2, 2, 3, 3, 5, 5, 8, 7, 11, 11, 15, 14, 21, 21, 28, 29, 38, 38, 51, 50, 65, 68, 82, 83, 108, 106, 130, 136, 163, 168, 206, 210, 248, 266, 307, 322, 381, 391, 457, 490, 553, 582, 675, 703, 797, 854, 952, 1000, 1147, 1187, 1331, 1437, 1564, 1656, 1869]