OFFSET
0,3
COMMENTS
It is possible to recursively construct more of these kinds of nonrecursive automorphisms, which by default (if A057515(n) > 1) work as *A074679 and otherwise apply the previous automorphism of this construction process (here *A074679 itself) to the left subtree of a binary tree, before the whole tree is swapped with *A069770. Do the associated cycle-count sequences converge to anything interesting?
This automorphism is illustrated below, where letters A, B and C refer to arbitrary subtrees located on those nodes and () stands for an implied terminal node.
...........................B...C........A...B..............................
............................\./..........\./...............................
..B...C.....A...B........A...x............x...C...A..()...............()..A
...\./.......\./..........\./..............\./.....\./.................\./.
A...x....-->..x...C........x..()...-->..()..x.......x..()....-->....()..x..
.\./...........\./..........\./..........\./.........\./.............\./...
..x.............x............x............x...........x...............x....
LINKS
PROG
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Oct 11 2006
STATUS
approved