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.

A301761 Number of ways to choose a rooted partition of each part in a constant rooted partition of n.

Table of values

n a(n)
1 1
2 1
3 2
4 3
5 5
6 6
7 13
8 12
9 26
10 31
11 57
12 43
13 150
14 78
15 224
16 293
17 484
18 232
19 1190
20 386
21 2260
22 2087
23 2558
24 1003
25 11154
26 4701
27 7889
28 13597
29 30041
30 3719
31 83248
32 5605
33 95006
34 84486
35 63506
36 251487
37 654394
38 17978
39 169864
40 490741
41 2290336
42 37339
43 4079503
44 53175
45 3979370

List of values

[1, 1, 2, 3, 5, 6, 13, 12, 26, 31, 57, 43, 150, 78, 224, 293, 484, 232, 1190, 386, 2260, 2087, 2558, 1003, 11154, 4701, 7889, 13597, 30041, 3719, 83248, 5605, 95006, 84486, 63506, 251487, 654394, 17978, 169864, 490741, 2290336, 37339, 4079503, 53175, 3979370]