cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-10 of 18 results. Next

A086586 Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutations A074681/A074682 & A074683/A074684.

Original entry on oeis.org

1, 1, 2, 5, 9, 28, 57, 253, 842, 3753, 10927, 15014, 130831, 218961, 967104, 3767216, 29715310, 89923607, 314897868, 785059994
Offset: 0

Views

Author

Antti Karttunen, Jun 23 2003

Keywords

Comments

Shifted once right (beginning as 1,1,1,2,5,9,...) this is maximum cycle size (in the same range) of permutations A085169/A085170, shifted twice right (beginning as 1,1,1,1,2,5,9,...) this is the maximum cycle size in permutations A089867/A089868 and A089869/A089870.

Links

A089411 Number of cycles in range [A014137(n-1)..A014138(n-1)] of permutation A074683/A074684.

Original entry on oeis.org

1, 1, 1, 1, 3, 4, 4, 11, 9, 6, 8, 14, 14, 12, 14, 19, 17, 16, 24, 26, 30
Offset: 0

Views

Author

Antti Karttunen, Nov 29 2003

Keywords

Comments

The number of orbits to which the corresponding automorphism(s) partitions the set of A000108(n) binary trees with n internal nodes. Does the non-monotone behavior continue indefinitely?

Links

Crossrefs

Cf. A089413, A089417.

A082359 Permutation of natural numbers: composition of permutations A074683 & A057163.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Apr 17 2003

Keywords

Links

Crossrefs

Inverse of A082360. Occurs in A073200 as row 18764713496857. Cf. also A082357-A082358.

Formula

a(n) = A074683(A057163(n)).

A089412 Least common multiple of all cycle sizes in range [A014137(n-1)..A014138(n-1)] of permutation A074683/A074684.

Original entry on oeis.org

1, 1, 2, 5, 18, 84, 2793, 211123440, 140826255570, 213340617315, 156232599082560
Offset: 0

Views

Author

Antti Karttunen, Nov 29 2003

Keywords

Links

A130922 Signature permutation of a Catalan automorphism: composition of automorphisms *A057164 and *A074683.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Jun 11 2007

Keywords

Links

Crossrefs

Inverse: A130921. a(n) = A057164(A074683(n)). Cf. A086426.

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

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Sep 11 2002

Keywords

Comments

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.

Links

Crossrefs

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).

Extensions

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

Views

Author

Antti Karttunen, Sep 01 2006

Keywords

Comments

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

References

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

Links

Crossrefs

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.

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

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Sep 11 2002

Keywords

Comments

This bijection maps between the "standard" ordering of binary trees as encoded by A014486 and "variant A quaternary encoding" as explained in the sequence A085184.
This is a rare example of a simply defined Catalan Automorphism where the cycle count sequence (A089411) is not monotone. (See A127296 for a much more complex example.)

Links

Crossrefs

Row 17 of A122201. Inverse of A074683. a(n) = A057163(A074681(A057163(n))).
The number of cycles, maximum cycle sizes and LCM's of all cycle sizes in subpermutations limited by A014137 and A014138 are given by A089411, A086586 and A089412.

A085161 Involution of natural numbers induced by Catalan Automorphism *A085161 acting on symbolless S-expressions encoded by A014486/A063171.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Jun 23 2003

Keywords

Comments

This automorphism reflects the interpretations (pp)-(rr) of Stanley, obtained from the Dyck paths with the "rising slope mapping" illustrated on the example lines.

Examples

			Map the Dyck paths (Stanley's interpretation (i)) to noncrossing Murasaki-diagrams (Stanley's interpretation (rr)) by drawing a vertical line above each rising slope / and connect those vertical lines that originate from the same height without any lower valleys between, as in illustration below:
..................................................
...._____..___....................................
...|.|...||...|...................................
...|.||..|||..|...................._.___...___....
...|.||..|||..|...................|.|...|.|...|...
...|.||..||/\.|....i.e..equal.to..|.|.|.|.|.|.|...
...|.|/\.|/..\/\..................|.|.|.|.|.|.|...
.../\/..\/......\.................|.|.|.|.|.|.|...
...10110011100100=11492=A014486(250)..............
...()(())((())()).................................
Now this automorphism gives the parenthesization such that the corresponding Murasaki-diagram is a reflection of the original one:
....___.._____....................................
...|...||...|.|...................................
...||..|||..|.|....................___..._____....
...||..|||..|.|...................|...|.|...|.|...
...||..||/\.|.|....i.e..equal.to..|.|.|.|.|.|.|...
...|/\.|/..\/\/\..................|.|.|.|.|.|.|...
.../..\/........\.................|.|.|.|.|.|.|...
...11001110010100=13204=A014486(360)..............
...(())((())()()).................................
So we have A085161(250)=360 and A085161(360)=250.

Links

Crossrefs

a(n) = A085163(A057508(n)) = A074684(A057164(A074683(n))). Occurs in A073200. Cf. also A085159, A085160, A085162, A085175. Alternative mappings illustrated in A086431 & A085169.
Number of cycles: A007123. Number of fixed points: A001405 (in each range limited by A014137 and A014138).

A085170 Permutation of natural numbers induced by the Catalan bijection gma085170 acting on symbolless S-expressions encoded by A014486/A063171.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Jun 23 2003

Keywords

Links

Crossrefs

Inverse: A085169 (see comments there). a(n) = A086434(A082853(n))+A082852(n). Cf. also A074683, A085159, A085160, A085175.
Number of cycles: A086585. Number of fixed points: A000045. Max. cycle size: A086586. LCM of cycle sizes: A086587. (In range [A014137(n-1)..A014138(n-1)] of this permutation).
Showing 1-10 of 18 results. Next

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.