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

A122203 Signature permutations of SPINE-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, 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, 11, 12, 8, 7, 5, 5, 4, 3, 2, 1, 0, 13, 21, 14, 13, 12
Offset: 0

Views

Author

Antti Karttunen, Sep 01 2006, Jun 06 2007

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 "SPINE". In this recursion scheme the given automorphism is first applied at the root of binary tree, before the algorithm recurses down to the new right-hand side branch. The associated Scheme-procedures SPINE and !SPINE 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 A122204.
The recursion scheme SPINE has a well-defined inverse, that is, it acts as a bijective mapping on the set of all Catalan automorphisms. Specifically, if g = SPINE(f), then (f s) = (cond ((pair? s) (let ((t (g s))) (cons (car t) (g^{-1} (cdr t))))) (else s)) that is, to obtain an automorphism f which gives g when subjected to recursion scheme SPINE, we compose g with its own inverse applied to the cdr-branch of a S-expression. This implies that for any non-recursive automorphism f in the table A089840, SPINE^{-1}(f) is also in A089840, which in turn implies that the rows of table A089840 form a (proper) subset of the rows of this table.

References

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

Crossrefs

Cf. The first 22 rows of this table: row 0 (identity permutation): A001477, 1: A069767, 2: A057509, 3: A130341, 4: A130343, 5: A130345, 6: A130347, 7: A122282, 8: A082339, 9: A130349, 10: A130351, 11: A130353, 12: A074685, 13: A130355, 14: A130357, 15: A130359, 16: A130361, 17: A057501, 18: A130363, 19: A130365, 20: A130367, 21: A069770. Other rows: row 251: A089863, row 253: A123717, row 3608: A129608, row 3613: A072796, row 65352: A074680, row 79361: A123715.

Programs

  • Scheme
    (define (SPINE foo) (letrec ((bar (lambda (s) (let ((t (foo s))) (if (pair? t) (cons (car t) (bar (cdr t))) t))))) bar))
    (define (!SPINE foo!) (letrec ((bar! (lambda (s) (cond ((pair? s) (foo! s) (bar! (cdr s)))) s))) bar!))

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

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

References

  • A. Karttunen, paper in preparation.

Crossrefs

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.

A130342 Row 3 of A122204.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Jun 05 2007

Keywords

Comments

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

Crossrefs

Inverse: A130341. a(n) = A069770(A069768(n)). The number of cycles and the number of fixed points in range [A014137(n-1)..A014138(n-1)] of this permutation are given by A089404 and A073268. Cf. also A073287.

A130981 Signature permutation of a Catalan automorphism: row 3 of A122287 and A122288.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Jun 20 2007

Keywords

Comments

The signature-permutation of the self-inverse Catalan automorphism which is derived from automorphism *A130341 with recursion scheme FORK or KROF.

A131141 Signature permutation of a Catalan automorphism: row 3 of A122285.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Jun 20 2007

Keywords

Comments

Derived from automorphism *A130341 with recursion scheme ENIPS.

Crossrefs

Inverse: A131142.
Showing 1-5 of 5 results.