OFFSET
0
COMMENTS
LINKS
Antti Karttunen, Table of n, a(n) for n = 0..8191
FORMULA
EXAMPLE
The first six levels of the binary tree (compare also to the illustration given at A005940):
0
|
0
............../ \..............
0 1
....../ \...... ....../ \......
0 1 1 1
/ \ / \ / \ / \
/ \ / \ / \ / \
0 1 1 1 0 1 1 1
/ \ / \ / \ / \ / \ / \ / \ / \
0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
For n=0, the corresponding node in A005940(0+1) is 1, which has just one child 2, thus we set a(0) = 0.
For n=1, the corresponding node in A005940(1+1) is 2, which has children 3 and 4, in correct order, thus a(1) = 0.
Similarly for node 3, with children 5 < 6, thus a(2) = 0. But for node 4, with its children 9 > 8, we set a(3) = 1.
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Antti Karttunen, Dec 21 2014
STATUS
approved