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-7 of 7 results.

A089423 Least common multiple of all cycle sizes in range [A014137(n-1)..A014138(n-1)] of permutation A082335/A082336 (and also of A082349/A082350, to be proved).

Original entry on oeis.org

1, 1, 2, 6, 12, 120, 120, 840, 840, 5040, 5040, 55440, 55440, 720720, 720720, 720720, 720720, 24504480, 24504480, 465585120, 465585120
Offset: 0

Views

Author

Antti Karttunen, Nov 29 2003

Keywords

Links

Crossrefs

Bisection: A089431.

A089422 Maximum cycle size in range [A014137(n-1)..A014138(n-1)] of permutation A082335/A082336 (and also of A082349/A082350, to be proved).

Original entry on oeis.org

1, 1, 2, 3, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38
Offset: 0

Views

Author

Antti Karttunen, Nov 29 2003

Keywords

Links

Crossrefs

Cf. A005843.

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

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

References

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

Links

Crossrefs

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

Extensions

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

Views

Author

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

Keywords

Comments

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

References

  • A. Karttunen, paper in preparation.

Links

Crossrefs

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.

A082335 Permutation of natural numbers induced by the Catalan bijection gma082335 acting on the parenthesizations encoded by A014486/A063171.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Apr 17 2003

Keywords

Comments

This Catalan bijection rotates binary trees left, if possible, otherwise reflects them with the Catalan bijection A057163.

Links

Crossrefs

Inverse of A082336. Cf. also A074679-A074680, A082349-A082350.
Number of fixed-points: A019590. (In range [A014137(n-1)..A014138(n-1)] of this permutation, possibly shifted one term left or right).

A082336 Permutation of natural numbers induced by the Catalan bijection gma082336 acting on the parenthesizations encoded by A014486/A063171.

Original entry on oeis.org

0, 1, 3, 2, 8, 7, 4, 5, 6, 22, 21, 20, 18, 17, 9, 10, 11, 12, 13, 14, 15, 16, 19, 64, 63, 62, 59, 58, 61, 57, 55, 50, 49, 54, 48, 46, 45, 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, 196, 195, 194, 190, 189
Offset: 0

Views

Author

Antti Karttunen, Apr 17 2003

Keywords

Comments

This Catalan bijection rotates binary trees right, if possible, otherwise reflects them with the Catalan bijection A057163.

Links

Crossrefs

Inverse of A082335. Cf. also A074679-A074680, A082349-A082350.
Number of fixed-points: A019590. (In range [A014137(n-1)..A014138(n-1)] of this permutation, possibly shifted one term left or right).

A082349 Permutation of natural numbers induced by the Catalan bijection gma082349 acting on the parenthesizations encoded by A014486/A063171.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Apr 17 2003

Keywords

Comments

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

Links

Crossrefs

Inverse of A082350. Cf. also A074679-A074680, A082335-A082336.
Number of cycles: A073193 (to be checked). Number of fixed-points: A019590. (In range [A014137(n-1)..A014138(n-1)] of this permutation, possibly shifted one term left or right).
Showing 1-7 of 7 results.

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

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