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.

A301763 Number of ways to choose a constant 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 4
6 4
7 8
8 5
9 8
10 13
11 14
12 5
13 32
14 7
15 20
16 64
17 26
18 6
19 92
20 7
21 126
22 199
23 22
24 5
25 352
26 252
27 41
28 581
29 394
30 7
31 1832
32 9
33 292
34 2119
35 31
36 3216
37 4946
38 10
39 40
40 8413
41 7708
42 9
43 20656
44 9
45 2324
46 53546
47 24
48 5
49 70040
50 16395
51 59361
52 131204
53 9503
54 7
55 266780
56 178180
57 82086

List of values

[1, 1, 2, 3, 4, 4, 8, 5, 8, 13, 14, 5, 32, 7, 20, 64, 26, 6, 92, 7, 126, 199, 22, 5, 352, 252, 41, 581, 394, 7, 1832, 9, 292, 2119, 31, 3216, 4946, 10, 40, 8413, 7708, 9, 20656, 9, 2324, 53546, 24, 5, 70040, 16395, 59361, 131204, 9503, 7, 266780, 178180, 82086]