A123499 Signature permutation of a nonrecursive Catalan automorphism: rotate a binary tree left if possible, otherwise apply *A089863.

0, 1, 3, 2, 6, 7, 8, 5, 4, 14, 15, 16, 17, 18, 19, 20, 21, 12, 13, 22, 11, 9, 10, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 31, 32, 59, 34, 35, 36, 60, 61, 62, 30, 33, 63, 28, 23, 24, 64, 29, 25, 26, 27, 107, 108, 109, 110, 111

Offset: 0

Author

Antti Karttunen, Oct 11 2006

Keywords

• nonn

Comments

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...........A...B.............B...A

....\./.................\./.............\./...............\./.

.A...x........-->........x...C...........x..()...-->...()..x..

..\./.....................\./.............\./...........\./...

...x.......................x...............x.............x....

(a . (b . c)) --> ((a . b) . c) / ((a . b) . ()) --> (() . (b . a))

This automorphism cannot be represented as a composition of two smaller nonrecursive automorphisms. Cf. A123503.

Links

• A. Karttunen, Prolog-program which illustrates the construction of this and other similar nonrecursive Catalan automorphisms.
• Index entries for signature-permutations of Catalan automorphisms

Crossrefs

Inverse: A123500. Row 258 of A089840. Variant of A074679.