A069770 -id:A069770 - cp's OEIS frontend

A074679 Signature permutation of a Catalan automorphism: Rotate binary tree left if possible, otherwise swap its sides.

0, 1, 3, 2, 6, 7, 8, 4, 5, 14, 15, 16, 17, 18, 19, 20, 21, 9, 10, 22, 11, 12, 13, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 23, 24, 59, 25, 26, 27, 60, 61, 62, 28, 29, 63, 30, 31, 32, 64, 33, 34, 35, 36, 107, 108, 109, 110, 111

Offset: 0

Antti Karttunen, Sep 11 2002

nonn

This automorphism effects the following transformation on the unlabeled rooted plane binary trees (letters A, B, C refer to arbitrary subtrees located on those nodes and () stands for an implied terminal node.)
...B...C.......A...B
....\./.........\./
.A...x....-->....x...C.................A..().........()..A..
..\./.............\./...................\./....-->....\./...
...x...............x.....................x.............x....
(a . (b . c)) -> ((a . b) . c) ____ (a . ()) --> (() . a)
That is, we rotate the binary tree left, in case it is possible and otherwise (if the right hand side of a tree is a terminal node) swap the left and right subtree (so that the terminal node ends to the left hand side), i.e., apply the automorphism *A069770. Look at the example in A069770 to see how this will produce the given sequence of integers.
This is the first multiclause nonrecursive automorphism in table A089840 and the first one whose order is not finite, i.e., the maximum size of cycles in this permutation is not bounded (see A089842). The cycle counts in range [A014137(n-1)..A014138(n)] of this permutation is given by A001683(n+1), which is otherwise the same sequence as for Catalan automorphisms *A057161/*A057162, but shifted once right. For an explanation, please see the notes in OEIS Wiki.

A. Karttunen, Table of n, a(n) for n = 0..2055
A. Karttunen, Introductory Survey of Catalan Automorphisms and Bijections, (an unfinished draft)
A. Karttunen, Notes on the orbits of this permutation, OEIS Wiki.
A. Karttunen, Prolog-program which illustrates the construction of this and similar nonrecursive bijections of oriented binary trees
Index entries for signature-permutations of Catalan automorphisms

This automorphism has several variants, where the first clause is same (rotate binary tree to the left, if possible), but something else is done (than just swapping sides), in case the right hand side is empty: A082335, A082349, A123499, A123695. The following automorphisms can be derived recursively from this one: A057502, A074681, A074683, A074685, A074687, A074690, A089865, A120706, A122321, A122332. See also somewhat similar ones: A069773, A071660, A071656, A071658, A072091, A072095, A072093.
Inverse: A074680.
Row 12 of A089840.
Occurs also in A073200 as row 557243 because a(n) = A073283(A073280(A072796(n))). a(n) = A083927(A123498(A057123(n))).
Number of cycles: LEFT(A001683). Number of fixed points: LEFT(A019590). Max. cycle size & LCM of all cycle sizes: A089410 (in range [A014137(n-1)..A014138(n)] of this permutation).

Description clarified Oct 10 2006

A122202 Signature permutations of KROF-transformations of non-recursive Catalan automorphisms in table A089840.

Original entry on oeis.org

0, 1, 0, 2, 1, 0, 3, 3, 1, 0, 4, 2, 2, 1, 0, 5, 8, 3, 2, 1, 0, 6, 7, 4, 3, 2, 1, 0, 7, 6, 6, 5, 3, 2, 1, 0, 8, 5, 5, 4, 5, 3, 2, 1, 0, 9, 4, 7, 6, 6, 6, 3, 2, 1, 0, 10, 22, 8, 7, 4, 5, 6, 3, 2, 1, 0, 11, 21, 9, 8, 7, 4, 4, 4, 3, 2, 1, 0, 12, 20, 14, 13, 8, 7, 5, 5, 4, 3, 2, 1, 0, 13, 18, 10, 12, 13

Offset: 0

Antti Karttunen, Sep 01 2006

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 "KROF". In this recursion scheme the algorithm first recurses down to the both branches, before the given automorphism is applied at the root of binary tree. I.e., this corresponds to the post-order (postfix) traversal of a Catalan structure, when it is interpreted as a binary tree. The associated Scheme-procedures KROF and !KROF 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 A122201.

The recursion scheme KROF is equivalent to a composition of recursion schemes ENIPS (described in A122204) and NEPEED (described in A122284), i.e., KROF(f) = NEPEED(ENIPS(f)) holds for all Catalan automorphisms f. Because of the "universal property of folds", these recursion schemes have well-defined inverses, that is, they are bijective mappings on the set of all Catalan automorphisms. Specifically, if g = KROF(f), then (f s) = (g (cons (g^{-1} (car s)) (g^{-1} (cdr s)))), that is, to obtain an automorphism f which gives g when subjected to recursion scheme KROF, we compose g with its own inverse applied to the car- and cdr-branches of a S-expression (i.e., the left and right subtrees in the context of binary trees). This implies that for any nonrecursive automorphism f of the table A089840, KROF^{-1}(f) is also in A089840, which in turn implies that all rows of table A089840 can be found also in table A122202 (e.g., row 1 of A089840 (A069770) occurs here as row 1654720) and furthermore, the table A122290 contains the rows of both tables, A122202 and A089840 as its subsets. Similar notes apply to recursion scheme FORK described in A122201. - Antti Karttunen, May 25 2007

A. Karttunen, paper in preparation, draft available by e-mail.

Index entries for signature-permutations of Catalan automorphisms

The first 22 rows of this table: row 0 (identity permutation): A001477, 1: A057163, 2: A057512, 3: A122342, 4: A122348, 5: A122346, 6: A122344, 7: A122350, 8: A082326, 9: A122294, 10: A122292, 11: A082359, 12: A074683, 13: A122358, 14: A122360, 15: A122302, 16: A122362, 17: A074682, 18: A122296, 19: A122298, 20: A122356, 21: A122354. Other rows: row 4069: A082355, row 65518: A082357, row 79361: A123494.
See also tables A089840, A122200, A122201-A122204, A122283-A122284, A122285-A122288, A122289-A122290.
Row 1654720: A069770.

A153141 Permutation of nonnegative integers: A059893-conjugate of A153151.

Original entry on oeis.org

0, 1, 3, 2, 7, 6, 4, 5, 15, 14, 12, 13, 8, 9, 10, 11, 31, 30, 28, 29, 24, 25, 26, 27, 16, 17, 18, 19, 20, 21, 22, 23, 63, 62, 60, 61, 56, 57, 58, 59, 48, 49, 50, 51, 52, 53, 54, 55, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 127, 126, 124, 125, 120, 121

Offset: 0

Antti Karttunen, Dec 20 2008

This permutation is induced by a wreath recursion a = s(a,b), b = (b,b) (i.e., binary transducer, where s means that the bits at that state are toggled: 0 <-> 1) given on page 103 of the Bondarenko, Grigorchuk, et al. paper, starting from the active (swapping) state a and rewriting bits from the second most significant bit to the least significant end, continuing complementing as long as the first 1-bit is reached, which is the last bit to be complemented.
The automorphism group of infinite binary tree (isomorphic to an infinitely iterated wreath product of cyclic groups of two elements) embeds naturally into the group of "size-preserving Catalan bijections". Scheme-function psi gives an isomorphism that maps this kind of permutation to the corresponding Catalan automorphism/bijection (that acts on S-expressions). The following identities hold: *A069770 = psi(A063946) (just swap the left and right subtrees of the root), *A057163 = psi(A054429) (reflect the whole tree), *A069767 = psi(A153141), *A069768 = psi(A153142), *A122353 = psi(A006068), *A122354 = psi(A003188), *A122301 = psi(A154435), *A122302 = psi(A154436) and from *A154449 = psi(A154439) up to *A154458 = psi(A154448). See also comments at A153246 and A153830.
a(1) to a(2^n) is the sequence of row sequency numbers in a Hadamard-Walsh matrix of order 2^n, when constructed to give "dyadic" or Payley sequency ordering. - Ross Drewe, Mar 15 2014
In the Stern-Brocot enumeration system for positive rationals (A007305/A047679), this permutation converts the denominator into the numerator: A007305(n) = A047679(a(n)). - Yosu Yurramendi, Aug 01 2020

			18 = 10010 in binary and after complementing the second, third and fourth most significant bits at positions 3, 2 and 1, we get 1110, at which point we stop (because bit-1 was originally 1) and fix the rest, so we get 11100 (28 in binary), thus a(18)=28. This is the inverse of "binary adding machine". See pages 8, 9 and 103 in the Bondarenko, Grigorchuk, et al. paper.
19 = 10011 in binary. By complementing bits in (zero-based) positions 3, 2 and 1 we get 11101 in binary, which is 29 in decimal, thus a(19)=29.

A. Karttunen, Table of n, a(n) for n = 0..2047
Ievgen Bondarenko, Rostislav Grigorchuk, Rostyslav Kravchenko, Yevgen Muntyan, Volodymyr Nekrashevych, Dmytro Savchuk, and Zoran Sunic, Classification of groups generated by 3-state automata over a 2-letter alphabet, arXiv:0803.3555 [math.GR], 2008, pp. 8--9 & 103.
S. Wolfram and R. Lamy, Discussion on the NKS Forum
Index entries for sequences that are permutations of the natural numbers

Inverse: A153142. a(n) = A059893(A153151(A059893(n))) = A059894(A153152(A059894(n))) = A154440(A154445(n)) = A154442(A154443(n)). Corresponds to A069767 in the group of Catalan bijections. Cf. also A154435-A154436, A154439-A154448, A072376.
Differs from A006068 for the first time at n=14, where a(14)=10 while A006068(14)=11.
A240908-A240910 these give "natural" instead of "dyadic" sequency ordering values for Hadamard-Walsh matrices, orders 8,16,32. - Ross Drewe, Mar 15 2014

def ok(n): return n&(n - 1)==0
def a153151(n): return n if n<2 else 2*n - 1 if ok(n) else n - 1
def A(n): return (int(bin(n)[2:][::-1], 2) - 1)/2
def msb(n): return n if n<3 else msb(n/2)*2
def a059893(n): return A(n) + msb(n)
def a(n): return 0 if n==0 else a059893(a153151(a059893(n))) # Indranil Ghosh, Jun 09 2017

maxlevel <- 5 # by choice
a <- 1
for(m in 1:maxlevel){
a[2^m    ] <- 2^(m+1) - 1
a[2^m + 1] <- 2^(m+1) - 2
for (k in 1:(2^m-1)){
   a[2^(m+1) + 2*k    ] <- 2*a[2^m + k]
   a[2^(m+1) + 2*k + 1] <- 2*a[2^m + k] + 1}
}
a <- c(0,a)
# Yosu Yurramendi, Aug 01 2020

Conjecture: a(n) = f(a(f(a(A053645(n)))) + A053644(n)) for n > 0 where f(n) = A054429(n) for n > 0 with f(0) = 0. - Mikhail Kurkov, Oct 02 2023
From Mikhail Kurkov, Dec 22 2023: (Start)
a(n) < 2^k iff n < 2^k for k >= 0.
Conjectured formulas:
a(2^m + k) = f(2^m + f(k)) for m >= 0, 0 <= k < 2^m with a(0) = 0.
a(n) = f(A153142(f(n))) for n > 0 with a(0) = 0. (End)

A074680 Signature permutation of the seventeenth nonrecursive Catalan automorphism in table A089840. (Rotate binary tree right if possible, otherwise swap its sides.)

Original entry on oeis.org

0, 1, 3, 2, 7, 8, 4, 5, 6, 17, 18, 20, 21, 22, 9, 10, 11, 12, 13, 14, 15, 16, 19, 45, 46, 48, 49, 50, 54, 55, 57, 58, 59, 61, 62, 63, 64, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 47, 51, 52, 53, 56, 60, 129, 130, 132, 133, 134

Offset: 0

Antti Karttunen, Sep 11 2002

nonn

This automorphism effects the following transformation on the unlabeled rooted plane binary trees (letters A, B, C refer to arbitrary subtrees located on those nodes and () stands for an implied terminal node.)
A...B..............B...C
.\./................\./
..x...C..-->.....A...x................()..B.......B..()
...\./............\./..................\./...-->...\./.
....x..............x....................x...........x..
((a . b) . c) -> (a . (b . c)) __ (() . b) --> (b . ())
That is, we rotate the binary tree right, in case it is possible and otherwise (if the left hand side of a tree is a terminal node) swap the right and left subtree (so that the terminal node ends to the right hand side), i.e. apply the automorphism *A069770. Look at the example in A069770 to see how this will produce the given sequence of integers.
See also the comments at A074679.

A. Karttunen, paper in preparation, draft available by e-mail.

This automorphism has several variants, where the first clause is same (rotate binary tree to the right, if possible), but something else is done (than just swapping sides), in case the left hand side is empty: A082336, A082350, A123500, A123696. The following automorphisms can be derived recursively from this one: A057501, A074682, A074684, A074686, A074688, A074689, A089866, A120705, A122322, A122331. See also somewhat similar ones: A069774, A071659, A071655, A071657, A072090, A072094, A072092.
Inverse: A074679. Row 17 of A089840. Occurs also in A073200 as row 2156396687 as a(n) = A072796(A073280(A073282(n))). a(n) = A083927(A123497(A057123(n))).
Number of cycles: LEFT(A001683). Number of fixed points: LEFT(A019590). Max. cycle size & LCM of all cycle sizes: A089410 (in range [A014137(n-1)..A014138(n-1)] of this permutation).

Description clarified Oct 10 2006

A069768 Signature-permutation of Catalan bijection "Knack".

Original entry on oeis.org

0, 1, 3, 2, 8, 7, 6, 4, 5, 22, 21, 20, 17, 18, 19, 16, 14, 9, 10, 15, 11, 12, 13, 64, 63, 62, 58, 59, 61, 57, 54, 45, 46, 55, 48, 49, 50, 60, 56, 53, 44, 47, 51, 42, 37, 23, 24, 38, 25, 26, 27, 52, 43, 39, 28, 29, 40, 30, 31, 32, 41, 33, 34, 35, 36, 196, 195, 194, 189, 190

Offset: 0

Antti Karttunen, Apr 16 2002; entry revised Dec 20 2008

nonn

This automorphism of binary trees first swaps the left and right subtree of the root and then proceeds recursively to the (new) left subtree, to do the same operation there. This is one of those Catalan bijections which extend to a unique automorphism of the infinite binary tree, which in this case is A153142. See further comments there and in A153141.
This bijection, Knack, is a ENIPS-transformation of the simple swap: ENIPS(*A069770) (i.e., row 1 of A122204). Furthermore, Knack and Knick (the inverse, A069767) have a special property, that FORK and KROF transforms (explained in A122201 and A122202) transform them to their own inverses, i.e., to each other: FORK(Knick) = KROF(Knick) = Knack and FORK(Knack) = KROF(Knack) = Knick, thus this occurs also as row 1 in A122288 and naturally, the double-fork fixes both, e.g., FORK(FORK(Knack)) = Knack.
Note: the name in Finnish is "Naks".

A. Karttunen, paper in preparation.

Inverse permutation: "Knick", A069767. "n-th powers" (i.e. n-fold applications), from n=2 to 6: A073291, A073293, A073295, A073297, A073299.
In range [A014137(n-1)..A014138(n-1)] of this permutation, the number of cycles is A073431, number of fixed points: A036987 (Fixed points themselves: A084108), Max. cycle size & LCM of all cycle sizes: A011782. See also: A074080.
A127302(a(n)) = A127302(n) for all n. a(n) = A057162(A057508(n)) = A069769(A057162(n))
Row 1 of A122204 and A122288, row 21 of A122285 and A130402, row 8 of A073200.
See also bijections A073287, A082346, A082347, A082350, A130342.

A057548 A014486-indices of Catalan mountain ranges with no sea-level valleys, i.e., the rooted plane general trees with root degree = 1.

Original entry on oeis.org

1, 3, 7, 8, 17, 18, 20, 21, 22, 45, 46, 48, 49, 50, 54, 55, 57, 58, 59, 61, 62, 63, 64, 129, 130, 132, 133, 134, 138, 139, 141, 142, 143, 145, 146, 147, 148, 157, 158, 160, 161, 162, 166, 167, 169, 170, 171, 173, 174, 175, 176, 180, 181, 183, 184, 185, 187, 188

Offset: 0

Antti Karttunen, Sep 07 2000

nonn

This sequence is induced by the unary form of function 'list' (present in Lisp and Scheme) when it acts on symbolless S-expressions encoded by A014486/A063171.

Index entries for the sequences induced by list functions of Lisp

We have A057515(A057548(n)) = 1 for all n. Row 0 of A072764. Column 1 of A085203. Cf. A057517, A057549, A057551.

a(n) = A080300(A057547(n)) = A069770(A072795(n)).

A069767 Signature-permutation of Catalan bijection "Knick".

Original entry on oeis.org

0, 1, 3, 2, 7, 8, 6, 5, 4, 17, 18, 20, 21, 22, 16, 19, 15, 12, 13, 14, 11, 10, 9, 45, 46, 48, 49, 50, 54, 55, 57, 58, 59, 61, 62, 63, 64, 44, 47, 53, 56, 60, 43, 52, 40, 31, 32, 41, 34, 35, 36, 42, 51, 39, 30, 33, 38, 29, 26, 27, 37, 28, 25, 24, 23, 129, 130, 132, 133, 134

Offset: 0

Antti Karttunen, Apr 16 2002; entry revised Dec 20 2008

nonn

This automorphism of binary trees first swaps the left and right subtree of the root and then proceeds recursively to the (new) right subtree, to do the same operation there. This is one of those Catalan bijections which extend to a unique automorphism of the infinite binary tree, which in this case is A153141. See further comments there.
This bijection, Knick, is a SPINE-transformation of the simple swap: SPINE(*A069770) (i.e., row 1 of A122203). Furthermore, Knick and Knack (the inverse, *A069768) have a special property, that FORK and KROF transforms (explained in A122201 and A122202) transform them to their own inverses, i.e., to each other: FORK(Knick) = KROF(Knick) = Knack and FORK(Knack) = KROF(Knack) = Knick, thus this occurs also as a row 1 in A122287 and naturally, the double-fork fixes both, e.g., FORK(FORK(Knick)) = Knick. There are also other peculiar properties.
Note: the name in Finnish is "Niks".

A. Karttunen, paper in preparation.

Inverse permutation: "Knack", A069768. "n-th powers" (i.e. n-fold applications), from n=2 to 6: A073290, A073292, A073294, A073296, A073298.
In range [A014137(n-1)..A014138(n-1)] of this permutation, the number of cycles is A073431, number of fixed points: A036987 (Fixed points themselves: A084108), Max. cycle size & LCM of all cycle sizes: A011782. See also: A074080.
A127302(a(n)) = A127302(n) for all n. a(n) = A057508(A057161(n)) = A057161(A069769(n)).
Row 1 of A122203 and A122287, row 15 of A122286 and A130403, row 6 of A073200.
See also bijections A073286, A082345, A082348, A082349, A130341.

A130403 Signature permutations of SPINE-transformations of A057163-conjugates of Catalan automorphisms in table A122204.

Original entry on oeis.org

0, 1, 0, 2, 1, 0, 3, 3, 1, 0, 4, 2, 2, 1, 0, 5, 7, 3, 2, 1, 0, 6, 8, 4, 3, 2, 1, 0, 7, 6, 5, 4, 3, 2, 1, 0, 8, 4, 7, 5, 4, 3, 2, 1, 0, 9, 5, 6, 6, 5, 4, 3, 2, 1, 0, 10, 17, 8, 8, 8, 5, 4, 3, 2, 1, 0, 11, 18, 9, 7, 6, 8, 5, 5, 3, 2, 1, 0, 12, 20, 10, 9, 7, 7, 7, 4, 4, 3, 2, 1, 0, 13, 21, 12, 10, 9, 6

Offset: 0

Antti Karttunen, Jun 11 2007

Row n is the signature permutation of the Catalan automorphism which is obtained from A057163-conjugate of the n-th automorphism in the table A122204 with the recursion scheme "SPINE", i.e. row n is obtained as SPINE(A057163 o ENIPS(A089840[n]) o A057163). See A122203 and A122204 for the description of SPINE and ENIPS. Each row occurs only once in this table. Inverses of these permutations can be found in table A130402. This table contains also all the rows of A122203 and A089840.

Cf. The first 22 rows of this table: row 0 (identity permutation): A001477, 1: A082345, 2: A130936, 3: A073288, 4: A130942, 5: A130940, 6: A130938, 7: A130944, 8: A130946, 9: A130952, 10: A130950, 11: A130948, 12: A057161, 13: A130962, 14: A130964, 15: A069767, 16: A130966, 17: A074688, 18: A130954, 19: A130956, 20: A130960, 21: A130958, Other rows: 169: A069770, 3617: A082339, 65167: A057501.
Cf. also tables A089840, A122201-A122204, A122285-A122286, A130400-A130401.
Cf. As a sequence differs from A130403 for the first time at n=92, where a(n)=21, while A130403(n)=22.

A130400 Signature permutations of INORDER-transformations of non-recursive Catalan automorphisms in table A089840.

Original entry on oeis.org

0, 1, 0, 2, 1, 0, 3, 3, 1, 0, 4, 2, 2, 1, 0, 5, 7, 3, 2, 1, 0, 6, 8, 4, 3, 2, 1, 0, 7, 6, 6, 5, 3, 2, 1, 0, 8, 4, 5, 4, 5, 3, 2, 1, 0, 9, 5, 7, 6, 6, 6, 3, 2, 1, 0, 10, 17, 8, 7, 4, 5, 6, 3, 2, 1, 0, 11, 18, 9, 8, 7, 4, 4, 4, 3, 2, 1, 0, 12, 20, 11, 12, 8, 7, 5, 5, 4, 3, 2, 1, 0, 13, 21, 14, 13, 12

Offset: 0

Antti Karttunen, Jun 11 2007

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 "INORDER". In this recursion scheme the given automorphism is applied at the root of binary tree after the algorithm has recursed down the car-branch (the left hand side tree in the context of binary trees), but before the algorithm recurses down to the cdr-branch (the right hand side of the binary tree, with respect to the new orientation of branches, possibly changed by the applied automorphism). I.e. this corresponds to the depth-first in-order traversal of a Catalan structure, when it is interpreted as a binary tree. The associated Scheme-procedures INORDER and !INORDER can be used to obtain such a transformed automorphism from any constructively (or respectively: destructively) implemented automorphism. Each row occurs only once in this table and similar notes as given e.g. for table A122202 apply here, e.g. the rows of A089840 all occur here as well. This transformation has many fixed points besides the trivial identity automorphism *A001477: at least *A069770, *A089863 and *A129604 stay as they are. Inverses of these permutations can be found in table A130401.

Cf. The first 22 rows of this table: row 0 (identity permutation): A001477, 1: A069770, 2: A073284, 3: A122341, 4: A130381, 5: A130383, 6: A130385, 7: A122350, 8: A082341, 9: A130387, 10: A130389, 11: A130391, 13: A130393, 14: A130395, 15: A130397, 16: A130927, 17: A071657, 18: A130929, 19: A130931, 20: A130933, 21: A089863. Other rows: row 1654694: A073280, row 1654720: A129604.
Cf. also tables A089840, A122201-A122204, A130402-A130403.
Cf. As a sequence differs from A130401 for the first time at n=80, where a(n)=11, while A130401(n)=14.

(define (INORDER f) (letrec ((g (lambda (s) (cond ((not (pair? s)) s) (else (let ((t (f (cons (g (car s)) (cdr s))))) (cons (car t) (g (cdr t))))))))) g))
(define (!INORDER f!) (letrec ((g! (lambda (s) (cond ((pair? s) (g! (car s)) (f! s) (g! (cdr s)))) s))) g!))

A089859 Permutation of natural numbers induced by Catalan Automorphism *A089859 acting on the binary trees/parenthesizations encoded by A014486/A063171.

Original entry on oeis.org

0, 1, 3, 2, 8, 7, 6, 4, 5, 21, 22, 20, 17, 18, 19, 16, 14, 9, 10, 15, 11, 12, 13, 58, 59, 62, 63, 64, 57, 61, 54, 45, 46, 55, 48, 49, 50, 56, 60, 53, 44, 47, 51, 42, 37, 23, 24, 38, 25, 26, 27, 52, 43, 39, 28, 29, 40, 30, 31, 32, 41, 33, 34, 35, 36, 170, 171, 174, 175, 176, 184

Offset: 0

Antti Karttunen, Nov 29 2003

nonn

This automorphism effects the following transformation on the unlabeled rooted plane binary trees (letters A, B, C refer to arbitrary subtrees located on those nodes and () stands for an implied terminal node).
.....B...C.......C...B
......\./.........\./
...A...x...-->... .x...A...............A..().........()..A..
....\./.............\./.................\./....-->....\./...
.....x...............x...................x.............x....
(a . (b . c)) --> ((c . b) . a) ___ (a . ()) --> (() . a)
See the Karttunen OEIS-Wiki link for a detailed explanation of how to obtain a given integer sequence from this definition.

A. Karttunen, Catalan Automorphisms
A. Karttunen, C-program for computing this sequence
Index entries for signature-permutations induced by Catalan automorphisms

Row 15 of A089840. Inverse of A089863. a(n) = A089854(A069770(n)) = A069770(A089850(n)). A089864 is the "square" of this permutation.

Number of cycles: A089407. Max. cycle size & LCM of all cycle sizes: A040002 (in each range limited by A014137 and A014138).

A graphical description and constructive implementation of Scheme-function (*A089859) added by Antti Karttunen, Jun 04 2011

cp's OEIS Frontend

A074679 Signature permutation of a Catalan automorphism: Rotate binary tree left if possible, otherwise swap its sides.

Views

Author

Keywords

Comments

Links

Crossrefs

Extensions

A122202 Signature permutations of KROF-transformations of non-recursive Catalan automorphisms in table A089840.

Views

Author

Keywords

Comments

References

Links

Crossrefs

A153141 Permutation of nonnegative integers: A059893-conjugate of A153151.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python

R

Formula

A074680 Signature permutation of the seventeenth nonrecursive Catalan automorphism in table A089840. (Rotate binary tree right if possible, otherwise swap its sides.)

Views

Author

Keywords

Comments

References

Links

Crossrefs

Extensions

A069768 Signature-permutation of Catalan bijection "Knack".

Views

Author

Keywords

Comments

References

Links

Crossrefs

A057548 A014486-indices of Catalan mountain ranges with no sea-level valleys, i.e., the rooted plane general trees with root degree = 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A069767 Signature-permutation of Catalan bijection "Knick".

Views

Author

Keywords

Comments

References

Links

Crossrefs

A130403 Signature permutations of SPINE-transformations of A057163-conjugates of Catalan automorphisms in table A122204.

Views

Author

Keywords

Comments

Crossrefs

A130400 Signature permutations of INORDER-transformations of non-recursive Catalan automorphisms in table A089840.

Views

Author

Keywords

Comments

Crossrefs

Programs

Scheme

A089859 Permutation of natural numbers induced by Catalan Automorphism *A089859 acting on the binary trees/parenthesizations encoded by A014486/A063171.

Views

Author

Keywords