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.

A301756 Number of ways to choose disjoint strict rooted partitions of each part in a strict rooted partition of n.

Table of values

n a(n)
1 1
2 1
3 1
4 2
5 3
6 5
7 7
8 10
9 15
10 22
11 30
12 42
13 60
14 85
15 114
16 155
17 206
18 286
19 394
20 524
21 683
22 910
23 1187
24 1564
25 2090
26 2751
27 3543
28 4606
29 5917
30 7598
31 9771
32 12651
33 16260
34 20822
35 26421
36 33525
37 42463
38 53594
39 67337
40 85299

List of values

[1, 1, 1, 2, 3, 5, 7, 10, 15, 22, 30, 42, 60, 85, 114, 155, 206, 286, 394, 524, 683, 910, 1187, 1564, 2090, 2751, 3543, 4606, 5917, 7598, 9771, 12651, 16260, 20822, 26421, 33525, 42463, 53594, 67337, 85299]