|
| |
|
|
A127533
|
|
Sum of jump-lengths of all binary trees with n edges. In the preorder traversal of a binary tree, any transition from a node at a deeper level to a node on a strictly higher level is called a jump; the positive difference of the levels is called the jump distance; the sum of the jump distances in a given binary tree is called the jump-length.
|
|
2
| |
|
|
0, 0, 0, 2, 17, 100, 506, 2366, 10556, 45696, 193800, 810084, 3350479, 13748020, 56071470, 227613750, 920540040, 3711935040, 14932102320, 59951235420, 240316859250, 962056169256, 3847193657076, 15370712686252, 61364157982952
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,4
|
|
|
COMMENTS
| a(n)=Sum(A127532(n,k),k>=0). The Krandick reference is about jumps and jump-length in full binary trees.
|
|
|
REFERENCES
| W. Krandick, Trees and jumps and real roots, J. Computational and Applied Math., 162, 2004, 51-55.
|
|
|
FORMULA
| a(n)=C(2n+1,n-3)+C(2n,n-3). G.f.=z^3*C^6*(C+1)/sqrt(1-4z), where C=[1-sqrt(1-4z)]/(2z) is the Catalan function.
|
|
|
MAPLE
| seq(binomial(2*n+1, n-3)+binomial(2*n, n-3), n=0..28);
|
|
|
CROSSREFS
| Cf. A127532, A127529.
Sequence in context: A163790 A129123 A109724 * A023260 A174365 A119363
Adjacent sequences: A127530 A127531 A127532 * A127534 A127535 A127536
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Emeric Deutsch (deutsch(AT)duke.poly.edu), Jan 18 2007
|
| |
|
|
