cp's OEIS Frontend

Row n is the signature permutation of the Catalan automorphism which is obtained from the n-th automorphism in the table A122204 with the recursion scheme "FORK", or equivalently row n is obtained as FORK(ENIPS(n-th row of A089840)). See A122201 and A122204 for the description of FORK and ENIPS. Moreover, each row of A122287 can be obtained as the "DEEPEN" transform of the corresponding row in A122286. (See A122283 for the description of DEEPEN). Each row occurs only once in this table. Inverses of these permutations can be found in table A122288. This table contains also all the rows of A122201 and A089840.

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.

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.

These terms form a subgroup in A089840 (A089839). Because A127301 can be computed as a fold and most of the recursive derivations of A089840 (i.e., tables A122201-A122204, A122283-A122290, A130400-A130403) are also folds, this sequence also gives the indices to those derived tables where bijections preserving A127301 occur.

These elements form a subgroup in A089840 (A089839). Such elements consists of only such clauses where each vertex stays at the same distance from the root of the binary tree and in the image tree will still be sibling to its original sibling in the pre-image tree.

Because A127302 can be computed as a fold and most of the recursive derivations of A089840 (i.e. tables A122201-A122204, A122283-A122290, A130400-A130403) are also folds, this sequence gives also the indices to those derived tables where bijections preserving A127302 occur.

These elements form a subgroup in A089840 (A089839) isomorphic to a group consisting of all finitely iterated wreath products of the form S_2 wr S_2 wr ... wr S_2 and each is an image of some finitary automorphism of an infinite binary tree. E.g. A089840(1) = *A069770 is an image of the generator A of Grigorchuk Group. See comments at A153246 and A153141.

The defining properties are propagated by all recursive transformations of A089840 which themselves do not behave differently depending whether there are internal or terminal vertices in the neighborhood of any vertex (at least the ones given in A122201-A122204, A122283-A122290, A130400-A130403), so this sequence gives also the corresponding positions in those tables.

*A130919 = DEEPEN(*A057511) = NEPEED(*A057511) = DEEPEN(DEEPEN(*A057509)) = NEPEED(NEPEED(*A057509)). See A122283, A122284 for the definitions of DEEPEN and NEPEED transforms.

*A130920 = DEEPEN(*A057512) = NEPEED(*A057512) = DEEPEN(DEEPEN(*A057510)) = NEPEED(NEPEED(*A057510)). See A122283, A122284 for the definitions of DEEPEN and NEPEED transforms.