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.

A246565 Number of rooted ordered trees with n non-root nodes such that the branch lengths are weakly increasing.

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 6
5 9
6 20
7 31
8 67
9 115
10 238
11 406
12 880
13 1494
14 3118
15 5568
16 11408
17 20092
18 41938
19 73687
20 151529
21 272359
22 552611
23 987277
24 2033173
25 3617167
26 7371745
27 13318869
28 26991289
29 48496985
30 99264686
31 177917588
32 362349258
33 655925568
34 1331038563
35 2401097768
36 4913906801
37 8844673793
38 18046697901
39 32720071992
40 66666578597

List of values

[1, 1, 2, 3, 6, 9, 20, 31, 67, 115, 238, 406, 880, 1494, 3118, 5568, 11408, 20092, 41938, 73687, 151529, 272359, 552611, 987277, 2033173, 3617167, 7371745, 13318869, 26991289, 48496985, 99264686, 177917588, 362349258, 655925568, 1331038563, 2401097768, 4913906801, 8844673793, 18046697901, 32720071992, 66666578597]

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

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