A218787 a(n) = A014486-index for the n-th tendril of infinite beanstalk (A213730(n)), with the "lesser numbers to the left side" construction.
0, 0, 0, 0, 1, 0, 0, 1, 2, 0, 0, 0, 1, 2, 0, 8, 0, 0, 1, 0, 0, 1, 2, 0, 8, 0, 0, 1, 8, 0, 0, 3, 0, 2, 1, 0, 0, 0, 1, 2, 0, 8, 0, 0, 1, 8, 0, 0, 3, 0, 2, 1, 0, 8, 0, 0, 3, 0, 60, 0, 0, 172, 0, 2, 0, 1, 0, 0, 1, 2, 0, 8, 0, 0, 1, 8, 0, 0, 3, 0, 2, 1, 0, 8, 0, 0
Offset: 1
Keywords
Examples
A213730(9)=22, and from that branches 24 and 25 (as both A011371(24)=A011371(25)=22) and while 24 is a leaf (in A055938) the other branch 25 further branches to two leaves (as both A011371(28)=A011371(29)=25). When we construct a binary tree from this in such a fashion that the lesser numbers go to the left, we obtain: ........... ...28...29. .....\./... ..24..25... ...\ /..... ....22..... ........... and the binary tree ........ ...\./.. ....*... .\./.... ..*..... ........ is located as A014486(2) in the normal encoding order of binary trees, thus a(9)=2.
Comments