|
|
A179751
|
|
Maximum depth/height of binary trees encoded by A014486.
|
|
6
|
|
|
0, 1, 2, 2, 3, 3, 2, 3, 3, 4, 4, 3, 4, 4, 3, 3, 3, 4, 4, 3, 3, 4, 4, 5, 5, 4, 5, 5, 4, 4, 4, 5, 5, 4, 4, 5, 5, 4, 4, 3, 4, 4, 3, 3, 4, 5, 5, 4, 4, 5, 5, 3, 3, 3, 4, 4, 4, 4, 5, 5, 4, 4, 4, 5, 5, 6, 6, 5, 6, 6, 5, 5, 5, 6, 6, 5, 5, 6, 6, 5, 5, 4, 5, 5, 4, 4, 5, 6, 6, 5, 5, 6, 6, 4, 4, 4, 5, 5, 5, 5, 6, 6
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
Each integer n appears first at position given by A014137.
|
|
LINKS
|
|
|
EXAMPLE
|
The terms A014486[1..8] encode the following rooted plane binary trees:
.1.......2.......3.......4.......5........6.......7.......8..
...........................\/....\/...............\/....\/...
..........\/....\/........\/......\/....\/ \/....\/......\/..
.\/......\/......\/......\/......\/......\_/......\/......\/.
thus a(1)=1, a(2)=2, a(3)=2, a(4)=3, a(5)=3, a(6)=2, a(7)=3, a(8)=3.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|