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.

A255705 Number of 2n+1-node rooted trees in which the maximal number of nodes in paths starting at a leaf and ending at the first branching node or at the root equals n+1.

Table of values

n a(n)
0 1
1 1
2 3
3 8
4 22
5 60
6 167
7 465
8 1306
9 3681
10 10422
11 29597
12 84313
13 240757
14 689035
15 1975753
16 5675145
17 16326198
18 47032200
19 135658367
20 391733593
21 1132357784
22 3276330780
23 9487885056
24 27497891241
25 79753806451
26 231474005120
27 672250119756
28 1953523496677
29 5680002466125

List of values

[1, 1, 3, 8, 22, 60, 167, 465, 1306, 3681, 10422, 29597, 84313, 240757, 689035, 1975753, 5675145, 16326198, 47032200, 135658367, 391733593, 1132357784, 3276330780, 9487885056, 27497891241, 79753806451, 231474005120, 672250119756, 1953523496677, 5680002466125]