|
|
|
|
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, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0
|
|
COMMENTS
|
a(n) tells whether the n-th node in A005940 (here counted with offset 0) has a pair of children where the left child is larger than the right child, see illustration in A005940 and one below.
|
|
LINKS
|
|
|
FORMULA
|
Other identities. For all n >= 1:
|
|
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.
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|