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.

A303259 Number of ordered rooted trees with n non-root nodes such that the maximal outdegree equals ceiling(n/2).

Table of values

n a(n)
0 1
1 1
2 1
3 3
4 8
5 15
6 53
7 84
8 326
9 495
10 1997
11 3003
12 12370
13 18564
14 77513
15 116280
16 490306
17 735471
18 3124541
19 4686825
20 20030000
21 30045015
22 129024469
23 193536720
24 834451788
25 1251677700
26 5414950283
27 8122425444
28 35240152706
29 52860229080
30 229911617041
31 344867425584

List of values

[1, 1, 1, 3, 8, 15, 53, 84, 326, 495, 1997, 3003, 12370, 18564, 77513, 116280, 490306, 735471, 3124541, 4686825, 20030000, 30045015, 129024469, 193536720, 834451788, 1251677700, 5414950283, 8122425444, 35240152706, 52860229080, 229911617041, 344867425584]