cp's OEIS Frontend

Row n is the signature permutation of the Catalan automorphism which is obtained from the n-th nonrecursive automorphism in the table A089840 with the recursion scheme "ENIPS". In this recursion scheme the algorithm first recurses down to the right-hand side branch of the binary tree, before the given automorphism is applied at its root. This corresponds to the fold-right operation applied to the Catalan structure, interpreted e.g. as a parenthesization or a Lisp-like list, where (lambda (x y) (f (cons x y))) is the binary function given to fold, with 'f' being the given automorphism. The associated Scheme-procedures ENIPS and !ENIPS can be used to obtain such a transformed automorphism from any constructively or destructively implemented automorphism. Each row occurs only once in this table. Inverses of these permutations can be found in table A122203.

Because of the "universal property of folds", the recursion scheme ENIPS has a well-defined inverse, that is, it acts as a bijective mapping on the set of all Catalan automorphisms. Specifically, if g = ENIPS(f), then (f s) = (g (cons (car s) (g^{-1} (cdr s)))), that is, to obtain an automorphism f which gives g when subjected to recursion scheme ENIPS, we compose g with its own inverse applied to the cdr-branch of a S-expression (i.e. the right subtree in the context of binary trees). This implies that for any non-recursive automorphism f in the table A089840, ENIPS^{-1}(f) is also in A089840, which in turn implies that the rows of table A089840 form a (proper) subset of the rows of this table.

This automorphism either swaps (if A057515(n) > 1) the first two toplevel elements (of a general plane tree, like *A072796 does) and otherwise (if n > 1, A057515(n)=1) swaps the sides of the left hand side subtree of the S-expression (when viewed as a binary tree, like *A089854 does). This 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...C............A...B...........B...A

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

.A...x.....-->.....B...x................x..()....-->....x..()

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

...x....(A072796)....x....................x...(A089854)...x

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

This is the first multiclause automorphism in table A089840 which cannot be represented as a composition of two smaller nonrecursive automorphisms, the property which is also shared by *A123499 and *A123500.

This is the signature-permutation of Catalan automorphism which is derived from nonrecursive Catalan automorphism *A123503 with the recursion schema SPINE (defined in A122203).

The number of fixed points in range [A014137(n-1)..A014138(n-1)] of this permutation begins as 1,1,2,1,3,1,4,1,8,1,16,1,47,..., the LCM of cycle sizes as 1,1,1,2,12,12,120,120,840,840,5040,5040,55440,... (cf. A089423) and the cycle-count sequence seems to be A045629. (To be proved.)