[go: up one dir, main page]

login
A089866
Permutation of natural numbers induced by Catalan Automorphism *A089866 acting on the parenthesizations/binary trees encoded by A014486/A063171.
7
0, 1, 2, 3, 4, 5, 6, 8, 7, 9, 10, 11, 12, 13, 14, 15, 19, 21, 22, 16, 17, 18, 20, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 51, 52, 56, 58, 59, 60, 62, 63, 64, 42, 43, 44, 45, 46, 47, 48, 49, 50, 53, 54, 55, 57, 61, 65, 66, 67, 68, 69
OFFSET
0,3
COMMENTS
This bijection of binary trees is obtained when we apply bijection *A074680 to the left subtree and keep the right subtree intact.
.A...B...............B...C
..\./.................\./
...x...C....-->....A...x.................()..B.........B...()....
....\./.............\./...................\./....-->....\./.....
.....x...D...........x...D.................x...C.........x...C..
......\./.............\./...................\./...........\./...
.......x...............x.....................x.............x....
................................................................
Compare to A154122.
See "Catalan bijections" OEIS-Wiki page for a detailed explanation how to obtain a given integer sequence from this definition.
PROG
(Two Scheme-functions implementing this automorphism on list-structures/S-expressions, constructive (*A089866) and destructive (*A089866!) version:)
(define (*A089866 s) (cond ((pair? s) (cons (*A074680 (car s)) (cdr s))) (else s)))
(define (*A089866! s) (if (pair? s) (*A074680! (car s))) s)
CROSSREFS
Row 4299 of A089840. Inverse of A089865. a(n) = A069770(A154122(A069770(n))).
Number of cycles: A089844. Number of fixed-points: A005807 (prepended with two 1's). Max. cycle size: A089410. LCM of cycle sizes: A089845 (in each range limited by A014137 and A014138).
Sequence in context: A353825 A353824 A089865 * A089854 A154453 A154454
KEYWORD
nonn
AUTHOR
Antti Karttunen, Dec 20 2003
EXTENSIONS
Further comments and constructive version of Scheme-implementation added by Antti Karttunen, Jun 04 2011
STATUS
approved