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.

A301935 Number of positive subset-sum trees whose composite a positive subset-sum of the integer partition with Heinz number n.

Table of values

n a(n)
1 0
2 1
3 1
4 2
5 1
6 3
7 1
8 10
9 2
10 3
11 1
12 21
13 1
14 3
15 3
16 58
17 1
18 21
19 1
20 21
21 3
22 3
23 1
24 164
25 2
26 3
27 10
28 21
29 1
30 34
31 1
32 373
33 3
34 3
35 3
36 218
37 1
38 3
39 3
40 161
41 1
42 7
43 1
44 5
45 5
46 3
47 1
48 1320
49 2
50 5
51 3
52 5
53 1
54 7
55 3
56 7
57 3
58 3
59 1
60 7
61 1
62 3
63 4
64 2558
65 3
66 7
67 1
68 5
69 3
70 6
71 1
72 7

List of values

[0, 1, 1, 2, 1, 3, 1, 10, 2, 3, 1, 21, 1, 3, 3, 58, 1, 21, 1, 21, 3, 3, 1, 164, 2, 3, 10, 21, 1, 34, 1, 373, 3, 3, 3, 218, 1, 3, 3, 161, 1, 7, 1, 5, 5, 3, 1, 1320, 2, 5, 3, 5, 1, 7, 3, 7, 3, 3, 1, 7, 1, 3, 4, 2558, 3, 7, 1, 5, 3, 6, 1, 7]