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.

A318865 Number of rooted trees with n nodes such that eight equals the maximal number of isomorphic subtrees extending from the same node.

Table of values

n a(n)
8 0
9 1
10 1
11 3
12 8
13 22
14 60
15 167
16 465
17 1307
18 3682
19 10422
20 29593
21 84291
22 240663
23 688685
24 1974519
25 5670969
26 16312391
27 46987389
28 135514781
29 391278211
30 1130924824
31 3271850658
32 9473951229
33 27454745755
34 79620703854
35 231064697016
36 670994912068
37 1949683485967
38 5668279789793

List of values

[0, 1, 1, 3, 8, 22, 60, 167, 465, 1307, 3682, 10422, 29593, 84291, 240663, 688685, 1974519, 5670969, 16312391, 46987389, 135514781, 391278211, 1130924824, 3271850658, 9473951229, 27454745755, 79620703854, 231064697016, 670994912068, 1949683485967, 5668279789793]

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

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