A075172 Number of edges in each rooted plane tree produced with the binary run length unranking algorithm presented in A075171.

0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 5, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7

Offset

0,3

Comments

Also the digital length of A075171(n)/ 2. Each value v occurs A000108(v) times.

Links

Table of n, a(n) for n=0..104.

Crossrefs

Permutation of A072643.

Sequence in context: A174199 A072660 A237720 * A347643 A237261 A004258

Adjacent sequences: A075169 A075170 A075171 * A075173 A075174 A075175

Keyword

nonn

Author

Antti Karttunen, Sep 13 2002

Status

approved