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.

A318818 Number of rooted trees with n nodes such that three equals the maximal number of subtrees of the same size extending from the same node.

Table of values

n a(n)
3 0
4 1
5 1
6 3
7 9
8 23
9 60
10 166
11 447
12 1219
13 3344
14 9214
15 25493
16 70853
17 197150
18 550259
19 1539767
20 4314746
21 12112304
22 34063256
23 95904943
24 270375031
25 763193304
26 2156328194
27 6098563949
28 17264760959
29 48912296290
30 138683094562
31 393514686620
32 1117304554815
33 3174397805762

List of values

[0, 1, 1, 3, 9, 23, 60, 166, 447, 1219, 3344, 9214, 25493, 70853, 197150, 550259, 1539767, 4314746, 12112304, 34063256, 95904943, 270375031, 763193304, 2156328194, 6098563949, 17264760959, 48912296290, 138683094562, 393514686620, 1117304554815, 3174397805762]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.