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 "RIBS".

In this recursion scheme the given automorphism is applied to all (toplevel) subtrees of the Catalan structure, when it is interpreted as a general tree. Permutations in this table form a countable group, which is isomorphic with the group in A089840. (The RIBS transformation gives the group isomorphism.)

Furthermore, row n of this table is also found as the row A123694(n) in tables A122203 and A122204. If the count of fixed points of the automorphism A089840[n] is given by sequence f, then the count of fixed points of the automorphism A089840[A123694(n)] is given by CONV(f,A000108) (where CONV stands for convolution) and the count of fixed points of the automorphism A122200[n] by INVERT(RIGHT(f)).

The associated Scheme-procedures RIBS and !RIBS can be used to obtain such a transformed automorphism from any constructively or destructively implemented automorphism.

This sequence agrees with A025581 in its initial terms, but then diverges from it. - Antti Karttunen, May 11 2008

Row n is the signature permutation of the Catalan automorphism which is obtained from the n-th automorphism in the table A122202 with the recursion scheme "KROF", or equivalently row n is obtained as KROF(KROF(n-th row of A089840)). See A122202 for the description of KROF. Each row occurs only once in this table. Inverses of these permutations can be found in table A122289.

Row n is the signature permutation of the Catalan automorphism which is obtained from the n-th automorphism in the table A122201 with the recursion scheme "FORK", or equivalently row n is obtained as FORK(FORK(n-th row of A089840)). See A122201 for the description of FORK. Each row occurs only once in this table. Inverses of these permutations can be found in table A122290.

Deutsch shows in his 1998 paper that this automorphism maps the number of returns of Dyck path to the height of the last peak, i.e., that A057515(n) = A080237(A057503(n)) holds for all n, thus the two parameters have the same distribution.

From the recursive forms of A057161 and A057503 it is seen that both can be viewed as a convergent limits of a process where either the left or right side argument of A085201 in formula for A057501 is "iteratively recursivized", and on the other hand, both of these can then in turn be made to converge towards A057505, when the other side of the formula is also "recursivized" in the same way. - Antti Karttunen, Jun 06 2014

Recursive transformation SPINE for Catalan bijections has a well-defined inverse (see the definition & comments at A122203). For all Catalan bijections in A089840 that inverse produces a bijection which is itself in A089840. This sequence gives the indices to those positions where each ("primitive", non-recursive bijection) of A089840(n) occurs "atavistically" amongst the more complex recursive bijections in A122203. I.e. A122203(a(n)) = A089840(n). Similarly, other "atavistic forms" resurface as: A122288(a(n)) = A122202(n), A122285(a(n)) = A122204(n) and A122201(a(n)) = A122283(n). See also comments at A153832.

Other known terms: a(17)-a(44): 65352, 65359, 65604, 65739, 251, 1656303, 1656426, 1656552, 1656628, 1656479, 1661655, 1661816, 1666720, 1684006, 1684221, 1667042, 1667007, 1684152, 1661799, 1661676, 1666759, 1684081, 1684437, 1667151, 1684509, 1667187, 1661961, 1661944.

This self-inverse automorphism is obtained as either SPINE(*A129608) or ENIPS(*A129608). See the definitions given in A122203 and A122204.