

A357702


Path length (total depths of vertices) of the rooted binary tree with ColijnPlazzotta tree number n.


2



0, 2, 6, 10, 12, 16, 22, 18, 22, 28, 34, 20, 24, 30, 36, 38, 26, 30, 36, 42, 44, 50, 34, 38, 44, 50, 52, 58, 66, 28, 32, 38, 44, 46, 52, 60, 54, 34, 38, 44, 50, 52, 58, 66, 60, 66, 42, 46, 52, 58, 60, 66, 74, 68, 74, 82, 50, 54, 60, 66, 68, 74, 82, 76, 82, 90
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

In a rooted binary tree each vertex has 0 or 2 children.
All terms are even since each pair of 2 child vertices are at the same depth.


LINKS



FORMULA



EXAMPLE

For n=3, tree number 3 and the depth of each of its vertices is
0 root
/ \
1 1 total depths
/ \ a(3) = 0 + 1+1 + 2+2 = 6
2 2


PROG

(PARI) See links.


CROSSREFS



KEYWORD

nonn,easy


AUTHOR



STATUS

approved



