A057164 -id:A057164 - cp's OEIS frontend

A057508 Self-inverse permutation of natural numbers induced by the function 'reverse' (present in programming languages like Lisp, Scheme, Prolog and Haskell) when it acts on symbolless S-expressions encoded by A014486/A063171.

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

Offset: 0

Antti Karttunen Sep 03 2000

nonn

A. Karttunen, Gatomorphisms (Includes the complete Scheme program for computing this sequence)
Index entries for the sequences induced by list functions of Lisp
Index entries for signature-permutations induced by Catalan automorphisms

The car/cdr-flipped conjugate of A069769, i.e. A057508(n) = A057163(A069769(A057163(n))). Cf. also A057164, A057509, A057510, A033538.

Similar function for Maple lists can be implemented as: reverse := proc(a) if 0 = nops(a) then (a) else [op(reverse(cdr(a))),a[1]]; fi; end;

A080070 Decimal encoding of parenthesizations produced by simple iteration starting from empty parentheses and where each successive parenthesization is obtained from the previous by reflecting it as a general tree/parenthesization, then adding an extra stem below the root and then reflecting the underlying binary tree.

Original entry on oeis.org

0, 10, 1010, 101100, 10110010, 1011100100, 101100110100, 10111001001100, 1011100110100010, 101110011010011000, 10110011101001100010, 1011110010011011000100, 101100111011010001100100

Offset: 0

Antti Karttunen, Jan 27 2003

Corresponding Lisp/Scheme S-expressions are (), (()), (()()), (()(())), (()(())()), (()((())())), (()(())(()())), ...

Conjecture: only the terms in positions 0,1,2 and 4 are symmetric, i.e., A057164(A080068(n)) = A080068(n) (equivalently: A036044(A080069(n)) = A080069(n)) only when n is one of {0,1,2,4}. If this is true, then the formula given in A079438 is exact. I (AK) have checked this up to n=404631 with no other occurrence of a symmetric (general) tree.

			This demonstrates how to get the fourth term 10110010 from the 3rd term 101100. The corresponding binary and general trees plus parenthesizations are shown. The first operation reflects the general tree, the second adds a new stem under the root and the third reflects the underlying binary tree, which induces changes on the corresponding general tree:
..............................................
.....\/................\/\/..........\/\/.....
......\/......\/\/......\/............\/......
.....\/........\/........\/..........\/.......
......(A057164).(A057548)..(A057163)..........
........................o.....................
........................|.....................
........o.....o.........o...o.........o.......
........|.....|..........\./..........|.......
....o...o.....o...o.......o.........o.o.o.....
.....\./.......\./........|..........\|/......
......*.........*.........*...........*.......
..[()(())]..[(())()]..[((())())]..[()(())()]..
...101100....110010....11100100....10110010...

A. Karttunen, Illustration of initial terms
A. Karttunen, Python program for computing this sequence.
A. Karttunen, Terms a(1)-a(256) plotted as a Wolframesque triangle.
A. Karttunen, Terms a(1)-a(512) plotted as a Wolframesque triangle.

Compare to similar Wolframesque plots given in A122229, A122232, A122235, A122239, A122242, A122245. See also A079438, A080067, A080071, A057119.

a(n) = A007088(A080069(n)) = A063171(A080068(n)).

A127301 Matula-Goebel signatures for plane general trees encoded by A014486.

Original entry on oeis.org

1, 2, 4, 3, 8, 6, 6, 7, 5, 16, 12, 12, 14, 10, 12, 9, 14, 19, 13, 10, 13, 17, 11, 32, 24, 24, 28, 20, 24, 18, 28, 38, 26, 20, 26, 34, 22, 24, 18, 18, 21, 15, 28, 21, 38, 53, 37, 26, 37, 43, 29, 20, 15, 26, 37, 23, 34, 43, 67, 41, 22, 29, 41, 59, 31, 64, 48, 48, 56, 40, 48, 36

Offset: 0

Antti Karttunen, Jan 16 2007

nonn

This sequence maps A000108(n) oriented (plane) rooted general trees encoded in range [A014137(n-1)..A014138(n)] of A014486 to A000081(n+1) distinct non-oriented rooted general trees, encoded by their Matula-Goebel numbers. The latter encoding is explained in A061773.
A005517 and A005518 give the minimum and maximum value occurring in each such range.
Primes occur at positions given by A057548 (not in order, and with duplicates), and similarly, semiprimes, A001358, occur at positions given by A057518, and in general, A001222(a(n)) = A057515(n).
If the signature-permutation of a Catalan automorphism SP satisfies the condition A127301(SP(n)) = A127301(n) for all n, then it preserves the non-oriented form of a general tree, which implies also that it is Łukasiewicz-word permuting, satisfying A129593(SP(n)) = A129593(n) for all n >= 0. Examples of such automorphisms include A072796, A057508, A057509/A057510, A057511/A057512, A057164, A127285/A127286 and A127287/A127288.
A206487(n) tells how many times n occurs in this sequence. - Antti Karttunen, Jan 03 2013

			A000081(n+1) distinct values occur each range [A014137(n-1)..A014138(n-1)]. As an example, A014486(5) = 44 (= 101100 in binary = A063171(5)), encodes the following plane tree:
.....o
.....|
.o...o
..\./.
...*..
Matula-Goebel encoding for this tree gives a code number A000040(1) * A000040(A000040(1)) = 2*3 = 6, thus a(5)=6.
Likewise, A014486(6) = 50 (= 110010 in binary = A063171(6)) encodes the plane tree:
.o
.|
.o...o
..\./.
...*..
Matula-Goebel encoding for this tree gives a code number A000040(A000040(1)) * A000040(1) = 3*2 = 6, thus a(6) is also 6, which shows these two trees are identical if one ignores their orientation.

Antti Karttunen, Table of n, a(n) for n = 0..6917
OEIS Wiki, Łukasiewicz words
Index entries for sequences related to Łukasiewicz
Index entries for sequences related to Matula-Goebel numbers

a(A014138(n)) = A007097(n+1), a(A014137(n)) = A000079(n+1) for all n.
a(|A106191(n)|) = A033844(n-1) for all n >= 1.
Cf. A001222, A005517, A005518, A057515, A057518, A057548, A127302, A129593, A153826, A209638, A243491, A243492, A243494, A243496.
For standard instead of binary encoding we have A358506.
A000108 counts ordered rooted trees, unordered A000081.
A014486 lists binary encodings of ordered rooted trees.
Cf. A001263, A061775, A196050, A206487, A358505.

mgnum[t_]:=If[t=={},1,Times@@Prime/@mgnum/@t];
binbalQ[n_]:=n==0||With[{dig=IntegerDigits[n,2]},And@@Table[If[k==Length[dig],SameQ,LessEqual][Count[Take[dig,k],0],Count[Take[dig,k],1]],{k,Length[dig]}]];
bint[n_]:=If[n==0,{},ToExpression[StringReplace[StringReplace[ToString[IntegerDigits[n,2]/.{1->"{",0->"}"}],","->""],"} {"->"},{"]]];
Table[mgnum[bint[n]],{n,Select[Range[0,1000],binbalQ]}] (* Gus Wiseman, Nov 22 2022 *)

(define (A127301 n) (*A127301 (A014486->parenthesization (A014486 n)))) ;; A014486->parenthesization given in A014486.
(define (*A127301 s) (if (null? s) 1 (fold-left (lambda (m t) (* m (A000040 (*A127301 t)))) 1 s)))

A001222(a(n)) = A057515(n) for all n.

A122287 Signature permutations of FORK-transformations 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, 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, 17, 8, 7, 4, 5, 6, 3, 2, 1, 0, 11, 18, 9, 8, 7, 4, 4, 4, 3, 2, 1, 0, 12, 20, 14, 13, 8, 7, 5, 5, 4, 3, 2, 1, 0, 13, 21, 11, 12, 13

Offset: 0

Antti Karttunen, Sep 01 2006, Jun 20 2007

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.

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: A069767, 2: A057164, 3: A130981, 4: A130983, 5: A130982, 6: A130984, 7: A130986, 8: A130988, 9: A130994, 10: A130992, 11: A130990, 12: A057506, 13: A131004, 14: A131006, 15: A057163, 16: A131008, 17: A131010, 18: A130996, 19: A130998, 20: A131002, 21: A131000. Other rows: 169: A122353, 3617: A057511, 65167: A074681.

A083927 Inverse function of N -> N injection A057123.

Original entry on oeis.org

0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 5, 0

Offset: 0

Antti Karttunen, May 13 2003

nonn

a(0)=0 because A057123(0)=0, but a(n) = 0 also for those n which do not occur as values of A057123. All positive natural numbers occur here once.

If g(n) = A083927(f(A057123(n))) then we can say that Catalan bijection g embeds into Catalan bijection f in scale n:2n, using the obvious binary tree -> general tree embedding. E.g. we have: A057163 = A083927(A057164(A057123(n))), A057117 = A083927(A072088(A057123(n))), A057118 = A083927(A072089(A057123(n))), A069770 = A083927(A072796(A057123(n))), A072797 = A083927(A072797(A057123(n))).

Antti Karttunen, Gatomorphisms

a(A057123(n)) = n for all n. Cf. A083925-A083926, A083928-A083929, A083935.

A057161 Signature-permutation of a Catalan Automorphism: rotate one step counterclockwise the triangulations of polygons encoded by A014486.

Original entry on oeis.org

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

Offset: 0

Antti Karttunen, Aug 18 2000; entry revised Jun 06 2014

nonn

This is a permutation of natural numbers induced when Euler's triangulation of convex polygons, encoded by the sequence A014486 in a straightforward way (via binary trees, cf. the illustration of the rotation of a triangulated pentagon, given in the Links section) are rotated counterclockwise.
The number of cycles in range [A014137(n-1)..A014138(n)] of this permutation is given by A001683(n+2), otherwise the same sequence as for Catalan bijections *A074679/*A074680, but shifted once left (for an explanation, see the related notes in OEIS Wiki).
E.g., in range [A014137(0)..A014138(1)] = [1,1] there is one cycle (as a(1)=1), in range [A014137(1)..A014138(2)] = [2,3] there is one cycle (as a(2)=3 and a(3)=2), in range [A014137(2)..A014138(3)] = [4,8] there is also one cycle (as a(4) = 7, a(7) = 6, a(6) = 5, a(5) = 8 and a(8) = 4), and in range [A014137(3)..A014138(4)] = [9,22] there are A001683(4+2) = 4 cycles.
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 by the same method, when the other side of the formula is also "recursivized".

A. Karttunen, Table of n, a(n) for n = 0..2055
A. Karttunen, Introductory Survey of Catalan Automorphisms and Bijections (an unfinished draft), pp. 51-54.
A. Karttunen, Notes on the orbits of the related permutations A074679/A074680, OEIS Wiki.
A. Karttunen, Illustration of how the five triangulations of a pentagon will rotate, and the corresponding changes it induces in the binary trees
Index entries for signature-permutations of Catalan automorphisms

Inverse: A057162.
Also, a "SPINE"-transform of A069774, and thus occurs as row 12 of A130403.
Other related permutations: A057163, A057164, A057501, A057504, A057505.
Cf. A001683 (cycle counts), A057544 (max cycle lengths).

a(n) = CatalanRankGlobal(RotateTriangularization(A014486[n]))
CatalanRankGlobal given in A057117 and the other Maple procedures in A038776.
NextSubBinTree := proc(nn) local n,z,c; n := nn; c := 0; z := 0; while(c < 1) do z := 2*z + (n mod 2); c := c + (-1)^n; n := floor(n/2); od; RETURN(z); end;
BinTreeLeftBranch := n -> NextSubBinTree(floor(n/2));
BinTreeRightBranch := n -> NextSubBinTree(floor(n/(2^(1+binwidth(BinTreeLeftBranch(n))))));
RotateTriangularization := proc(nn) local n,s,z,w; n := binrev(nn); z := 0; w := 0; while(1 = (n mod 2)) do s := BinTreeRightBranch(n); z := z + (2^w)*s; w := w + binwidth(s); z := z + (2^w); w := w + 1; n := floor(n/2); od; RETURN(z); end;

a(0) = 0, and for n>=1, a(n) = A085201(a(A072771(n)), A057548(A072772(n))). [This formula reflects the S-expression implementation given first in the Program section: A085201 is a 2-ary function corresponding to 'append', A072771 and A072772 correspond to 'car' and 'cdr' (known also as first/rest or head/tail in some languages), and A057548 corresponds to unary form of function 'list'.]
As a composition of related permutations:
a(n) = A069767(A069769(n)).
a(n) = A057163(A057162(A057163(n))).
a(n) = A057164(A057504(A057164(n))). [For a proof, see pp. 53-54 in the "Introductory survey ..." draft]

A069772 Self-inverse permutation of natural numbers induced by the automorphism xReflectHandshakes acting on the parenthesizations encoded by A014486.

Original entry on oeis.org

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

Offset: 0

Antti Karttunen, Apr 16 2002

nonn

This automorphism reflects over the x-axis the interpretation n (the non-crossing handshakes) of Stanley's exercise 19.
Note that DeepRev (A057164) reflects over y-axis.
This transformation keeps palindromic parenthesizations/Dyck paths/rooted planar trees palindromic, but not necessarily same, meaning that this induces a permutation on the sequence A061855 (= A069766).

A. Karttunen, Gatomorphisms (Includes the complete Scheme program for computing this sequence)
R. P. Stanley, Exercises on Catalan and Related Numbers
Index entries for sequences that are permutations of the natural numbers

Composition of A057164 and A069771 in either order, i.e. A069772(n) = A057164(A069771(n)) = A069771(A057164(n)). Cf. also A061855, A069766, A057501, A069888, A069889.

A069787 Self-inverse permutation of natural numbers induced by the automorphism DeepRev1CarSide! acting on the parenthesizations encoded by A014486.

Original entry on oeis.org

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

Offset: 0

Antti Karttunen, Apr 16 2002

nonn

A. Karttunen, Gatomorphisms (Includes the complete Scheme program for computing this sequence)
Index entries for sequences that are permutations of the natural numbers

The car/cdr-flipped conjugate of A057164.

a(n) = A057163(A057164(A057163(n))).

A057162 Signature-permutation of a Catalan Automorphism: rotate one step clockwise the triangulations of polygons encoded by A014486.

Original entry on oeis.org

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

Offset: 0

Antti Karttunen, Aug 18 2000; entry revised Jun 06 2014

nonn

This is a permutation of natural numbers induced when Euler's triangulation of convex polygons, encoded by the sequence A014486 in a straightforward way (via binary trees, cf. the illustration of the rotation of a triangulated pentagon, given in the Links section) are rotated clockwise.

In A057161 and A057162, the cycles between A014138(n-1)-th and A014138(n)-th term partition A000108(n) objects encoded by the corresponding terms of A014486 into A001683(n+2) equivalence classes of flexagons (or unlabeled plane boron trees), thus the latter sequence can be counted with the Maple procedure A057162_CycleCounts given below. Cf. also the comments in A057161.

A. Karttunen, Table of n, a(n) for n = 0..2055
A. Karttunen, Illustration of how the five triangulations of a pentagon will rotate, and the corresponding changes it induces in the binary trees
A. Karttunen, Introductory Survey of Catalan Automorphisms and Bijections (an unfinished draft), pp. 51-54.
Index entries for signature-permutations of Catalan automorphisms

Inverse: A057161.
Also, an "ENIPS"-transform of A069773, and thus occurs as row 17 of A130402.
Other related permutations: A057163, A057164, A057501, A057503, A057505.
Cf. A001683 (cycle counts), A057544 (max cycle lengths).

a(n) = CatalanRankGlobal(RotateTriangularizationR(A014486[n]))
RotateTriangularizationR := n -> ReflectBinTree(RotateTriangularization(ReflectBinTree(n)));
with(group); A057162_CycleCounts := proc(upto_n) local u,n,a,r,b; a := []; for n from 0 to upto_n do b := []; u := (binomial(2*n,n)/(n+1)); for r from 0 to u-1 do b := [op(b),1+CatalanRank(n,RotateTriangularization(CatalanUnrank(n,r)))]; od; a := [op(a),(`if`((n < 2),1,nops(convert(b,'disjcyc'))))]; od; RETURN(a); end;
# See also the code in A057161.

As a composition of related permutations:
a(n) = A069768(A057508(n)).
a(n) = A057163(A057161(A057163(n))).
a(n) = A057164(A057503(A057164(n))). [For the proof, see pp. 53-54 in the "Introductory survey ..." draft, eq. 143.]

A071156 Apart from the initial term (0), lists all integers whose factorial expansion ends with 1 (i.e., are odd numbers), do not contain a digit zero and each successive digit to the left is at most one greater than the preceding digit.

Original entry on oeis.org

0, 1, 3, 5, 9, 11, 15, 17, 23, 33, 35, 39, 41, 47, 57, 59, 63, 65, 71, 87, 89, 95, 119, 153, 155, 159, 161, 167, 177, 179, 183, 185, 191, 207, 209, 215, 239, 273, 275, 279, 281, 287, 297, 299, 303, 305, 311, 327, 329, 335, 359, 417, 419, 423, 425, 431, 447, 449

Offset: 0

Antti Karttunen, May 14 2002

a(n) = A085198(A014486(n)) = A071155(A057164(n)). Catalan numbers A000108(n) gives the number of terms whose factorial expansion contain n digits.

0 is included by considering it to have the empty string as its factorial base representation. - Franklin T. Adams-Watters, Jun 28 2006

The beginning of this sequence expanded in the factorial number system: A071158. Inverse function: A085199. First differences: A085191.

Cf. A000108 (row lengths), A071155, A120696.

cp's OEIS Frontend

A057508 Self-inverse permutation of natural numbers induced by the function 'reverse' (present in programming languages like Lisp, Scheme, Prolog and Haskell) when it acts on symbolless S-expressions encoded by A014486/A063171.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A127301 Matula-Goebel signatures for plane general trees encoded by A014486.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Scheme

Formula

A122287 Signature permutations of FORK-transformations of Catalan automorphisms in table A122204.

Views

Author

Keywords

Comments

References

Links

Crossrefs

A083927 Inverse function of N -> N injection A057123.

Views

Author

Keywords

Comments

Links

Crossrefs

A057161 Signature-permutation of a Catalan Automorphism: rotate one step counterclockwise the triangulations of polygons encoded by A014486.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Formula

A069772 Self-inverse permutation of natural numbers induced by the automorphism xReflectHandshakes acting on the parenthesizations encoded by A014486.

Views

Author

Keywords

Comments

Links

Crossrefs

A069787 Self-inverse permutation of natural numbers induced by the automorphism DeepRev1CarSide! acting on the parenthesizations encoded by A014486.

Views

Author

Keywords

Links

Crossrefs

Formula

A057162 Signature-permutation of a Catalan Automorphism: rotate one step clockwise the triangulations of polygons encoded by A014486.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Formula

A071156 Apart from the initial term (0), lists all integers whose factorial expansion ends with 1 (i.e., are odd numbers), do not contain a digit zero and each successive digit to the left is at most one greater than the preceding digit.

Views