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.

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

Table of values

n a(n)
10 0
11 1
12 1
13 3
14 8
15 22
16 60
17 167
18 465
19 1306
20 3681
21 10423
22 29598
23 84313
24 240753
25 689013
26 1975659
27 5674795
28 16324964
29 47028023
30 135644560
31 391688795
32 1132214229
33 3275875477
34 9486452270
35 27493411521
36 79739873360
37 231430860268
38 672117013805
39 1953114161607
40 5678747123701

List of values

[0, 1, 1, 3, 8, 22, 60, 167, 465, 1306, 3681, 10423, 29598, 84313, 240753, 689013, 1975659, 5674795, 16324964, 47028023, 135644560, 391688795, 1132214229, 3275875477, 9486452270, 27493411521, 79739873360, 231430860268, 672117013805, 1953114161607, 5678747123701]

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

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