OFFSET
0,3
COMMENTS
This involution effects the following transformation on the binary trees (labels A,B,C,D refer to arbitrary subtrees located on those nodes and () stands for a terminal node.)
.A..B.C..D.....D..C.B..A.......B...C...C...B........A...B............B...A
..\./.\./.......\./.\./.........\./.....\./..........\./..............\./.
...x...x....-->..x...x.......()..x..-->..x..()........x..()...-->..()..x..
....\./...........\./.........\./.........\./..........\./..........\./...
.....x.............x...........x...........x............x............x....
LINKS
PROG
(Constructive and destructive Scheme implementation of this automorphism. These act on S-expressions, i.e. list-structures:)
CROSSREFS
a(n) = A069770(A089864(n)) = A089864(A069770(n)). The number of cycles and the number of fixed points in range [A014137(n-1)..A014138(n-1)] of this involution are given by the same sequences as is the case for example with A069770, A057163 and A122351, that is, A007595 and zero-interspersed A000108.
KEYWORD
nonn
AUTHOR
Antti Karttunen, May 22 2007
STATUS
approved