A357702 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A357702

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

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

Table of n, a(n) for n=1..66.

Kevin Ryde, PARI/GP Code

FORMULA

a(n) = a(x) + a(y) + A064002(n) - 1, for n>=2, where x = A002024(n-1) and y = A002260(n-1).

EXAMPLE