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.

A213920 Number of rooted trees with n nodes such that no more than two subtrees corresponding to children of any node have the same number of nodes.

Table of values

n a(n)
0 0
1 1
2 1
3 2
4 3
5 7
6 15
7 34
8 79
9 190
10 457
11 1132
12 2823
13 7126
14 18136
15 46541
16 120103
17 312109
18 815012
19 2137755
20 5632399
21 14895684
22 39519502
23 105198371
24 280815067
25 751490363
26 2016142768
27 5420945437
28 14604580683
29 39425557103
30 106618273626
31 288792927325
32 783516425820

List of values

[0, 1, 1, 2, 3, 7, 15, 34, 79, 190, 457, 1132, 2823, 7126, 18136, 46541, 120103, 312109, 815012, 2137755, 5632399, 14895684, 39519502, 105198371, 280815067, 751490363, 2016142768, 5420945437, 14604580683, 39425557103, 106618273626, 288792927325, 783516425820]