OFFSET
0,4
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 "FORK". In this recursion scheme the given automorphism is first applied at the root of binary tree, before the algorithm recurses down to the both branches (new ones, possibly changed by the given automorphism). I.e. this corresponds to the pre-order (prefix) traversal of a Catalan structure, when it is interpreted as a binary tree. The associated Scheme-procedures FORK and !FORK 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 A122202.
REFERENCES
A. Karttunen, paper in preparation, draft available by e-mail.
LINKS
PROG
(Scheme:) (define (FORK foo) (letrec ((bar (lambda (s) (let ((t (foo s))) (if (pair? t) (cons (bar (car t)) (bar (cdr t))) t))))) bar))
(define (!FORK foo!) (letrec ((bar! (lambda (s) (cond ((pair? s) (foo! s) (bar! (car s)) (bar! (cdr s)))) s))) bar!))
CROSSREFS
The first 22 rows of this table: row 0 (identity permutation): A001477, 1: A057163, 2: A057511, 3: A122341, 4: A122343, 5: A122345, 6: A122347, 7: A122349, 8: A082325, 9: A082360, 10: A122291, 11: A122293, 12: A074681, 13: A122295, 14: A122297, 15: A122353, 16: A122355, 17: A074684, 18: A122357, 19: A122359, 20: A122361, 21: A122301. Other rows: row 4253: A082356, row 65796: A082358, row 79361: A123493.
KEYWORD
nonn,tabl
AUTHOR
Antti Karttunen, Sep 01 2006
STATUS
approved