cp's OEIS Frontend

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.

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

ENIPS-transformation is explained in A122204. This automorphism permutes the top-level of a list of even length (1 ... 2n) as (2 4 6 ... 2n-2 2n 2n-1 2n-3 ... 5 3 1) and when applied to a list of odd length (1 .. 2n+1), permutes it as (2 4 6 ... 2n-2 2n 2n+1 2n-1 2n-3 ... 5 3 1). Used to construct A127288.

Automorphism *A089859 = ENIPS(*A129611). See the definition given in A122204.

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

The signature-permutation of the Catalan automorphism which is derived from *A069775 with recursion schema ENIPS (see A122204 for the definition).

This involution effects the following transformation on the binary trees (labels A,B,C,D refer to arbitrary subtrees located on those nodes and () stands for a terminal node.)

.....C...D.........B...D

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

...B...X2........A...Y2......B..().......A..()

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

.A...X1....-->.C...Y1......A...X1..-->.B...Y1

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

...X0............Y0..........X0..........Y0

Note that automorphism *A072796 = ENIPS(*A129606). See the definition given in A122204.