cp's OEIS Frontend

This Catalan bijection rotates binary trees left, if possible, otherwise applies Catalan bijection A069767.

This is the signature-permutation of Catalan automorphism which is derived from the automorphism *A123492 with the recursion schema KROF (defined in A122202). Like automorphisms *A057163 and *A069767/*A069768 these automorphisms are closed with respect to the subset of "zigzagging" binary trees (i.e., those binary trees where there are no nodes with two nonempty branches, or equivalently, those ones for which Stanley's interpretation (c) forms a non-branching line) and thus induce a permutation of binary strings. That is, starting from the root of such a binary tree, the turns taken by nonempty branches are interpreted as binary digits 0 or 1, depending on whether the tree grows to the left or right. In this manner, the Catalan automorphisms *A123494 and *A123493 induce the Binary Reflected Gray Code (see A003188 and A006068).

This subset of integers is closed by the actions of A069770, A057163, A069767, A069768, A122353, A122354, A122301, A122302, etc. (meaning, e.g., that A069767(a(n)) is a member from this sequence for all n), that is, by any Catalan bijection which is an image of some element of the automorphism group of infinite binary tree (the latter in a sense given by Grigorchuk, et al., being isomorphic to an infinitely iterated wreath product of cyclic groups of two elements). See the comments about the isomorphism "psi" given at A153141.

a(n) could be probably computed directly from the binary expansion of n by using a (somewhat) similar ranking function as given in A209640, but utilizing A009766 instead of A007318.

The signature-permutation of the Catalan automorphism which is derived from the third non-recursive Catalan automorphism *A089850 with recursion schema SPINE (see A122203 for the definition). This automorphism is also produced when automorphism *A069767 is applied to the right-hand side subtree of the given binary tree, with the left side left intact.

This automorphism of rooted plane binary trees switches the two descendant trees for every other vertex as it descends along the 111... ray, but not starting swapping until at the right-hand side child of the root, leaving the root itself fixed. Specifically, *A154450 = psi(A154440), where the isomorphism psi is given in A153141 (see further comments there).

This automorphism of rooted plane binary trees switches the two descendant trees for every other vertex as it descends along the 111... ray, starting swapping already at the root. Specifically, *A154452 = psi(A154442), where the isomorphism psi is given in A153141 (see further comments there).

This automorphism of rooted plane binary trees switches the two descendant trees for every other vertex as it returns back toward the root, after descending down to the leftmost tip of the tree along the 000... ray, so that the last vertex whose descendants are swapped, is the left-hand side child of the root and the root itself is fixed. Specifically, *A154453 = psi(A154443), where the isomorphism psi is given in A153141 (see further comments there).

This automorphism of rooted plane binary trees switches the two descendant trees for every other vertex as it returns back toward the root, after descending down to the leftmost tip of the tree along the 000... ray, so that the last vertex whose descendants are swapped is the root node of the tree. Specifically, *A154455 = psi(A154445), where the isomorphism psi is given in A153141 (see further comments there).

Fixed points of permutations A069767 and A069768.