A126302 -id:A126302 - cp's OEIS frontend

A125976 Signature-permutation of Kreweras' 1970 involution on Dyck paths.

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

Offset: 0

Antti Karttunen, Jan 02 2007

nonn

Lalanne shows in the 1992 paper that this automorphism preserves the sum of peak heights, i.e., that A126302(a(n)) = A126302(n) for all n. Furthermore, he also shows that A126306(a(n)) = A057514(n)-1 and likewise, that A057514(a(n)) = A126306(n)+1, for all n >= 1.
Like A069772, this involution keeps symmetric Dyck paths symmetric, but not necessarily same.
The number of cycles and fixed points in range [A014137(n-1)..A014138(n-1)] of this involution seem to be given by A007595 and the "aerated" Catalan numbers [1, 1, 0, 1, 0, 2, 0, 5, 0, 14, 0, 42, ...], thus this is probably a conjugate of A069770 (as well as of A057163).

A. Karttunen, Table of n, a(n) for n = 0..2055
G. Kreweras, Sur les éventails de segments, Cahiers du Bureau Universitaire de Recherche Opérationelle, Cahier no. 15, Paris, 1970, pp. 3-41.
J.-C. Lalanne, Une Involution sur les Chemins de Dyck, European J. Combin. 13 (1992), no. 6, 477-487.
Index entries for signature-permutations of Catalan automorphisms

Cf. A080300, A125974, A014486.
Cf. A057163, A069770, A007595, A014137, A014138.
Compositions and conjugations with other automorphisms: A125977-A125979, A125980, A126290.

a(n) = A080300(A125974(A014486(n))).

A125989 Sum of heights of 10's in binary expansion of n.

Original entry on oeis.org

0, 0, 1, 0, 2, 0, 1, 0, 3, 1, 2, -1, 2, 0, 1, 0, 4, 2, 3, 0, 4, 0, 1, -2, 3, 1, 2, -1, 2, 0, 1, 0, 5, 3, 4, 1, 5, 1, 2, -1, 6, 2, 3, -2, 3, -1, 0, -3, 4, 2, 3, 0, 4, 0, 1, -2, 3, 1, 2, -1, 2, 0, 1, 0, 6, 4, 5, 2, 6, 2, 3, 0, 7, 3, 4, -1, 4, 0, 1, -2, 8, 4, 5, 0, 6, 0, 1, -4, 5, 1, 2, -3, 2, -2, -1

Offset: 0

Antti Karttunen, Jan 02 2007

The 'height' of the digits in the binary expansion of n is here defined by the algorithm where, starting from the least significant bit and the height=0 and proceeding leftwards, all encountered 1-bits decrease the height by one and all 0-bits increase it by one. The sequence gives the sums of heights at the positions where 0 changes to 1 when scanning the binary expansion from right to left. This sequence is used for computing A126302.

			E.g. the lattice path /\/\ is encoded by 10 as 1010 in binary and both peaks occur at height=1, thus a(10)=2.
In comparison, 11 is 1011 in binary, so the only peak '10' occurs at height -1:
.../
/\/
thus a(11)=-1.

A126302 = a(A014486(n)). Cf. A085198.

(define (A125989 n) (let loop ((n n) (s 0) (h 0)) (cond ((zero? n) s) ((= 2 (modulo n 4)) (loop (/ (- n 2) 4) (+ s h 1) h)) ((odd? n) (loop (/ (- n 1) 2) s (- h 1))) (else (loop (/ n 2) s (+ 1 h))))))

cp's OEIS Frontend

A125976 Signature-permutation of Kreweras' 1970 involution on Dyck paths.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A125989 Sum of heights of 10's in binary expansion of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Scheme