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.

A248890 Number of rooted trees with n nodes such that for each inner node no more than k subtrees corresponding to its children have exactly k nodes.

Table of values

n a(n)
0 0
1 1
2 1
3 1
4 2
5 4
6 8
7 16
8 34
9 75
10 166
11 374
12 849
13 1952
14 4522
15 10566
16 24840
17 58760
18 139693
19 333702
20 800412
21 1927207
22 4655997
23 11283835
24 27423930
25 66825194
26 163227234
27 399587270
28 980222058
29 2409181633
30 5931839530
31 14629639579
32 36137308192
33 89395224033

List of values

[0, 1, 1, 1, 2, 4, 8, 16, 34, 75, 166, 374, 849, 1952, 4522, 10566, 24840, 58760, 139693, 333702, 800412, 1927207, 4655997, 11283835, 27423930, 66825194, 163227234, 399587270, 980222058, 2409181633, 5931839530, 14629639579, 36137308192, 89395224033]