|
|
A218788
|
|
a(n) = A014486-index for the n-th tendril of infinite beanstalk (A213730(n)), with the "lesser numbers to the right side" construction.
|
|
12
|
|
|
0, 0, 0, 0, 1, 0, 0, 1, 3, 0, 0, 0, 1, 3, 0, 4, 0, 0, 1, 0, 0, 1, 3, 0, 4, 0, 0, 1, 4, 0, 0, 2, 0, 3, 1, 0, 0, 0, 1, 3, 0, 4, 0, 0, 1, 4, 0, 0, 2, 0, 3, 1, 0, 4, 0, 0, 2, 0, 37, 0, 0, 110, 0, 3, 0, 1, 0, 0, 1, 3, 0, 4, 0, 0, 1, 4, 0, 0, 2, 0, 3, 1, 0, 4, 0, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,9
|
|
COMMENTS
|
"Tendrils" of the beanstalk are the finite side-trees sprouting from its infinite trunk (see A179016) at the numbers given by A213730.
|
|
LINKS
|
|
|
EXAMPLE
|
When we construct a binary tree from this in such a fashion that the larger numbers go to the left, we obtain:
..........
29...28...
..\./.....
...25..24.
....\./...
.....22...
..........
and the binary tree
.......
.\./...
..*....
...\./.
....*..
.......
is located as A014486(3) in the normal encoding order of binary trees, thus a(9)=3.
|
|
PROG
|
(Scheme with Antti Karttunen's memoization macro definec):
(definec (Aux_for218788 n) (cond ((zero? (A079559 n)) 0) ((not (zero? (A213719 n))) -1) (else (A072764bi (Aux_for218788 (A213724 n)) (Aux_for218788 (A213723 n))))))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|