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.

A301768 Number of ways to choose a strict 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 2
5 4
6 3
7 6
8 5
9 11
10 8
11 14
12 11
13 32
14 16
15 36
16 32
17 70
18 33
19 104
20 47
21 168
22 130
23 178
24 90
25 521
26 155
27 369
28 383
29 902
30 223
31 1562
32 297
33 1952
34 1392
35 1474
36 1665
37 6297
38 669
39 2878
40 4241
41 12401
42 1114
43 17474
44 1427
45 19436
46 20754
47 9971
48 2305
49 80110
50 19295
51 51942
52 36428

List of values

[1, 1, 2, 2, 4, 3, 6, 5, 11, 8, 14, 11, 32, 16, 36, 32, 70, 33, 104, 47, 168, 130, 178, 90, 521, 155, 369, 383, 902, 223, 1562, 297, 1952, 1392, 1474, 1665, 6297, 669, 2878, 4241, 12401, 1114, 17474, 1427, 19436, 20754, 9971, 2305, 80110, 19295, 51942, 36428]