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.

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

Table of values

n a(n)
1 1
2 1
3 1
4 3
5 4
6 7
7 9
8 15
9 21
10 32
11 45
12 59
13 89
14 117
15 162
16 225
17 309
18 394
19 538
20 707
21 929
22 1240
23 1613
24 2055
25 2677
26 3517
27 4439
28 5724
29 7288
30 9222
31 11671
32 14809
33 18480
34 23226
35 29138
36 36501
37 45373
38 56438
39 69920
40 86426
41 106715
42 131171
43 161428
44 197717
45 242301
46 295888

List of values

[1, 1, 1, 3, 4, 7, 9, 15, 21, 32, 45, 59, 89, 117, 162, 225, 309, 394, 538, 707, 929, 1240, 1613, 2055, 2677, 3517, 4439, 5724, 7288, 9222, 11671, 14809, 18480, 23226, 29138, 36501, 45373, 56438, 69920, 86426, 106715, 131171, 161428, 197717, 242301, 295888]