Identifier
-
Mp00032:
Dyck paths
—inverse zeta map⟶
Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00072: Permutations —binary search tree: left to right⟶ Binary trees
St000083: Binary trees ⟶ ℤ
Values
[1,0,1,0] => [1,1,0,0] => [2,1] => [[.,.],.] => 0
[1,1,0,0] => [1,0,1,0] => [1,2] => [.,[.,.]] => 1
[1,0,1,0,1,0] => [1,1,1,0,0,0] => [3,1,2] => [[.,[.,.]],.] => 1
[1,0,1,1,0,0] => [1,0,1,1,0,0] => [1,3,2] => [.,[[.,.],.]] => 1
[1,1,0,0,1,0] => [1,1,0,1,0,0] => [2,3,1] => [[.,.],[.,.]] => 1
[1,1,0,1,0,0] => [1,1,0,0,1,0] => [2,1,3] => [[.,.],[.,.]] => 1
[1,1,1,0,0,0] => [1,0,1,0,1,0] => [1,2,3] => [.,[.,[.,.]]] => 2
[1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => [4,1,2,3] => [[.,[.,[.,.]]],.] => 2
[1,0,1,0,1,1,0,0] => [1,0,1,1,1,0,0,0] => [1,4,2,3] => [.,[[.,[.,.]],.]] => 2
[1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,0] => [2,4,1,3] => [[.,.],[[.,.],.]] => 1
[1,0,1,1,0,1,0,0] => [1,1,1,0,0,0,1,0] => [3,1,2,4] => [[.,[.,.]],[.,.]] => 2
[1,0,1,1,1,0,0,0] => [1,0,1,0,1,1,0,0] => [1,2,4,3] => [.,[.,[[.,.],.]]] => 2
[1,1,0,0,1,0,1,0] => [1,1,1,0,1,0,0,0] => [3,4,1,2] => [[.,[.,.]],[.,.]] => 2
[1,1,0,0,1,1,0,0] => [1,0,1,1,0,1,0,0] => [1,3,4,2] => [.,[[.,.],[.,.]]] => 2
[1,1,0,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => [3,1,4,2] => [[.,[.,.]],[.,.]] => 2
[1,1,0,1,0,1,0,0] => [1,1,0,0,1,1,0,0] => [2,1,4,3] => [[.,.],[[.,.],.]] => 1
[1,1,0,1,1,0,0,0] => [1,0,1,1,0,0,1,0] => [1,3,2,4] => [.,[[.,.],[.,.]]] => 2
[1,1,1,0,0,0,1,0] => [1,1,0,1,0,1,0,0] => [2,3,4,1] => [[.,.],[.,[.,.]]] => 2
[1,1,1,0,0,1,0,0] => [1,1,0,1,0,0,1,0] => [2,3,1,4] => [[.,.],[.,[.,.]]] => 2
[1,1,1,0,1,0,0,0] => [1,1,0,0,1,0,1,0] => [2,1,3,4] => [[.,.],[.,[.,.]]] => 2
[1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => [1,2,3,4] => [.,[.,[.,[.,.]]]] => 3
[1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0] => [5,1,2,3,4] => [[.,[.,[.,[.,.]]]],.] => 3
[1,0,1,0,1,0,1,1,0,0] => [1,0,1,1,1,1,0,0,0,0] => [1,5,2,3,4] => [.,[[.,[.,[.,.]]],.]] => 3
[1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,1,1,0,0,0,0] => [2,5,1,3,4] => [[.,.],[[.,[.,.]],.]] => 2
[1,0,1,0,1,1,0,1,0,0] => [1,1,1,1,0,0,0,0,1,0] => [4,1,2,3,5] => [[.,[.,[.,.]]],[.,.]] => 3
[1,0,1,0,1,1,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [1,2,5,3,4] => [.,[.,[[.,[.,.]],.]]] => 3
[1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,1,1,0,0,0,0] => [3,5,1,2,4] => [[.,[.,.]],[[.,.],.]] => 2
[1,0,1,1,0,0,1,1,0,0] => [1,0,1,1,0,1,1,0,0,0] => [1,3,5,2,4] => [.,[[.,.],[[.,.],.]]] => 2
[1,0,1,1,0,1,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => [4,1,2,5,3] => [[.,[.,[.,.]]],[.,.]] => 3
[1,0,1,1,0,1,0,1,0,0] => [1,1,0,0,1,1,1,0,0,0] => [2,1,5,3,4] => [[.,.],[[.,[.,.]],.]] => 2
[1,0,1,1,0,1,1,0,0,0] => [1,0,1,1,1,0,0,0,1,0] => [1,4,2,3,5] => [.,[[.,[.,.]],[.,.]]] => 3
[1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,0,1,1,0,0,0] => [2,3,5,1,4] => [[.,.],[.,[[.,.],.]]] => 2
[1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,0,1,0] => [2,4,1,3,5] => [[.,.],[[.,.],[.,.]]] => 2
[1,0,1,1,1,0,1,0,0,0] => [1,1,1,0,0,0,1,0,1,0] => [3,1,2,4,5] => [[.,[.,.]],[.,[.,.]]] => 3
[1,0,1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]] => 3
[1,1,0,0,1,0,1,0,1,0] => [1,1,1,1,0,1,0,0,0,0] => [4,5,1,2,3] => [[.,[.,[.,.]]],[.,.]] => 3
[1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,1,0,1,0,0,0] => [1,4,5,2,3] => [.,[[.,[.,.]],[.,.]]] => 3
[1,1,0,0,1,1,0,0,1,0] => [1,1,0,1,1,0,1,0,0,0] => [2,4,5,1,3] => [[.,.],[[.,.],[.,.]]] => 2
[1,1,0,0,1,1,0,1,0,0] => [1,1,1,0,1,0,0,0,1,0] => [3,4,1,2,5] => [[.,[.,.]],[.,[.,.]]] => 3
[1,1,0,0,1,1,1,0,0,0] => [1,0,1,0,1,1,0,1,0,0] => [1,2,4,5,3] => [.,[.,[[.,.],[.,.]]]] => 3
[1,1,0,1,0,0,1,0,1,0] => [1,1,1,1,0,0,1,0,0,0] => [4,1,5,2,3] => [[.,[.,[.,.]]],[.,.]] => 3
[1,1,0,1,0,0,1,1,0,0] => [1,0,1,1,1,0,0,1,0,0] => [1,4,2,5,3] => [.,[[.,[.,.]],[.,.]]] => 3
[1,1,0,1,0,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,0] => [3,1,5,2,4] => [[.,[.,.]],[[.,.],.]] => 2
[1,1,0,1,0,1,0,1,0,0] => [1,1,1,0,0,0,1,1,0,0] => [3,1,2,5,4] => [[.,[.,.]],[[.,.],.]] => 2
[1,1,0,1,0,1,1,0,0,0] => [1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => [.,[[.,.],[[.,.],.]]] => 2
[1,1,0,1,1,0,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => [2,4,1,5,3] => [[.,.],[[.,.],[.,.]]] => 2
[1,1,0,1,1,0,0,1,0,0] => [1,1,1,0,0,1,0,0,1,0] => [3,1,4,2,5] => [[.,[.,.]],[.,[.,.]]] => 3
[1,1,0,1,1,0,1,0,0,0] => [1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => [[.,.],[.,[[.,.],.]]] => 2
[1,1,0,1,1,1,0,0,0,0] => [1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => [.,[.,[[.,.],[.,.]]]] => 3
[1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,1,0,1,0,0,0] => [3,4,5,1,2] => [[.,[.,.]],[.,[.,.]]] => 3
[1,1,1,0,0,0,1,1,0,0] => [1,0,1,1,0,1,0,1,0,0] => [1,3,4,5,2] => [.,[[.,.],[.,[.,.]]]] => 3
[1,1,1,0,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => [3,4,1,5,2] => [[.,[.,.]],[.,[.,.]]] => 3
[1,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,1,0,1,0,0] => [2,1,4,5,3] => [[.,.],[[.,.],[.,.]]] => 2
[1,1,1,0,0,1,1,0,0,0] => [1,0,1,1,0,1,0,0,1,0] => [1,3,4,2,5] => [.,[[.,.],[.,[.,.]]]] => 3
[1,1,1,0,1,0,0,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => [3,1,4,5,2] => [[.,[.,.]],[.,[.,.]]] => 3
[1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,0,0,1,1,0,0] => [2,3,1,5,4] => [[.,.],[.,[[.,.],.]]] => 2
[1,1,1,0,1,0,1,0,0,0] => [1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => [[.,.],[[.,.],[.,.]]] => 2
[1,1,1,0,1,1,0,0,0,0] => [1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]] => 3
[1,1,1,1,0,0,0,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [2,3,4,5,1] => [[.,.],[.,[.,[.,.]]]] => 3
[1,1,1,1,0,0,0,1,0,0] => [1,1,0,1,0,1,0,0,1,0] => [2,3,4,1,5] => [[.,.],[.,[.,[.,.]]]] => 3
[1,1,1,1,0,0,1,0,0,0] => [1,1,0,1,0,0,1,0,1,0] => [2,3,1,4,5] => [[.,.],[.,[.,[.,.]]]] => 3
[1,1,1,1,0,1,0,0,0,0] => [1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => [[.,.],[.,[.,[.,.]]]] => 3
[1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]] => 4
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [6,1,2,3,4,5] => [[.,[.,[.,[.,[.,.]]]]],.] => 4
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,6,2,3,4,5] => [.,[[.,[.,[.,[.,.]]]],.]] => 4
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => [2,6,1,3,4,5] => [[.,.],[[.,[.,[.,.]]],.]] => 3
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,1,1,1,0,0,0,0,0,1,0] => [5,1,2,3,4,6] => [[.,[.,[.,[.,.]]]],[.,.]] => 4
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,6,3,4,5] => [.,[.,[[.,[.,[.,.]]],.]]] => 4
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,1,0,1,1,1,0,0,0,0,0] => [3,6,1,2,4,5] => [[.,[.,.]],[[.,[.,.]],.]] => 3
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,0,1,1,0,1,1,1,0,0,0,0] => [1,3,6,2,4,5] => [.,[[.,.],[[.,[.,.]],.]]] => 3
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => [5,1,2,3,6,4] => [[.,[.,[.,[.,.]]]],[.,.]] => 4
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,0,0,1,1,1,1,0,0,0,0] => [2,1,6,3,4,5] => [[.,.],[[.,[.,[.,.]]],.]] => 3
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,5,2,3,4,6] => [.,[[.,[.,[.,.]]],[.,.]]] => 4
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => [2,3,6,1,4,5] => [[.,.],[.,[[.,[.,.]],.]]] => 3
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,1,0,0,0,0,1,0] => [2,5,1,3,4,6] => [[.,.],[[.,[.,.]],[.,.]]] => 3
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,1,1,0,0,0,0,1,0,1,0] => [4,1,2,3,5,6] => [[.,[.,[.,.]]],[.,[.,.]]] => 4
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,2,3,6,4,5] => [.,[.,[.,[[.,[.,.]],.]]]] => 4
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,1,1,0,1,1,0,0,0,0,0] => [4,6,1,2,3,5] => [[.,[.,[.,.]]],[[.,.],.]] => 3
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,0,1,1,1,0,1,1,0,0,0,0] => [1,4,6,2,3,5] => [.,[[.,[.,.]],[[.,.],.]]] => 3
[1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,1,1,0,1,1,0,0,0,0] => [2,4,6,1,3,5] => [[.,.],[[.,.],[[.,.],.]]] => 2
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,1,1,0,1,1,0,0,0,0,1,0] => [3,5,1,2,4,6] => [[.,[.,.]],[[.,.],[.,.]]] => 3
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,0,1,0,1,1,0,1,1,0,0,0] => [1,2,4,6,3,5] => [.,[.,[[.,.],[[.,.],.]]]] => 3
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => [5,1,2,6,3,4] => [[.,[.,[.,[.,.]]]],[.,.]] => 4
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,0,1,1,1,1,0,0,0,1,0,0] => [1,5,2,3,6,4] => [.,[[.,[.,[.,.]]],[.,.]]] => 4
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => [3,1,6,2,4,5] => [[.,[.,.]],[[.,[.,.]],.]] => 3
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,1,1,0,0,0,0,1,1,0,0] => [4,1,2,3,6,5] => [[.,[.,[.,.]]],[[.,.],.]] => 3
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,3,2,6,4,5] => [.,[[.,.],[[.,[.,.]],.]]] => 3
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => [2,5,1,3,6,4] => [[.,.],[[.,[.,.]],[.,.]]] => 3
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,1,1,1,0,0,0,1,0,0,1,0] => [4,1,2,5,3,6] => [[.,[.,[.,.]]],[.,[.,.]]] => 4
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,1,0,0,1,0,1,1,1,0,0,0] => [2,1,3,6,4,5] => [[.,.],[.,[[.,[.,.]],.]]] => 3
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,5,3,4,6] => [.,[.,[[.,[.,.]],[.,.]]]] => 4
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => [3,4,6,1,2,5] => [[.,[.,.]],[.,[[.,.],.]]] => 3
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,0,1,1,0,1,0,1,1,0,0,0] => [1,3,4,6,2,5] => [.,[[.,.],[.,[[.,.],.]]]] => 3
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,1,1,0,1,1,0,0,0,1,0,0] => [3,5,1,2,6,4] => [[.,[.,.]],[[.,.],[.,.]]] => 3
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,0,0,1,1,0,1,1,0,0,0] => [2,1,4,6,3,5] => [[.,.],[[.,.],[[.,.],.]]] => 2
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,0,1,1,0,1,1,0,0,0,1,0] => [1,3,5,2,4,6] => [.,[[.,.],[[.,.],[.,.]]]] => 3
[1,0,1,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => [4,1,2,5,6,3] => [[.,[.,[.,.]]],[.,[.,.]]] => 4
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,0,0,1,1,1,0,0,0] => [2,3,1,6,4,5] => [[.,.],[.,[[.,[.,.]],.]]] => 3
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,0,0,1,1,1,0,0,0,1,0] => [2,1,5,3,4,6] => [[.,.],[[.,[.,.]],[.,.]]] => 3
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,4,2,3,5,6] => [.,[[.,[.,.]],[.,[.,.]]]] => 4
[1,0,1,1,1,1,0,0,0,0,1,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [2,3,4,6,1,5] => [[.,.],[.,[.,[[.,.],.]]]] => 3
>>> Load all 195 entries. <<<
search for individual values
searching the database for the individual values of this statistic
/
search for generating function
searching the database for statistics with the same generating function
Description
The number of left oriented leafs of a binary tree except the first one.
In other other words, this is the sum of canopee vector of the tree.
The canopee of a non empty binary tree T with n internal nodes is the list l of 0 and 1 of length n-1 obtained by going along the leaves of T from left to right except the two extremal ones, writing 0 if the leaf is a right leaf and 1 if the leaf is a left leaf.
This is also the number of nodes having a right child. Indeed each of said right children will give exactly one left oriented leaf.
In other other words, this is the sum of canopee vector of the tree.
The canopee of a non empty binary tree T with n internal nodes is the list l of 0 and 1 of length n-1 obtained by going along the leaves of T from left to right except the two extremal ones, writing 0 if the leaf is a right leaf and 1 if the leaf is a left leaf.
This is also the number of nodes having a right child. Indeed each of said right children will give exactly one left oriented leaf.
Map
inverse zeta map
Description
The inverse zeta map on Dyck paths.
See its inverse, the zeta map Mp00030zeta map, for the definition and details.
See its inverse, the zeta map Mp00030zeta map, for the definition and details.
Map
binary search tree: left to right
Description
Return the shape of the binary search tree of the permutation as a non labelled binary tree.
Map
to 321-avoiding permutation (Krattenthaler)
Description
Krattenthaler's bijection to 321-avoiding permutations.
Draw the path of semilength n in an n×n square matrix, starting at the upper left corner, with right and down steps, and staying below the diagonal. Then the permutation matrix is obtained by placing ones into the cells corresponding to the peaks of the path and placing ones into the remaining columns from left to right, such that the row indices of the cells increase.
Draw the path of semilength n in an n×n square matrix, starting at the upper left corner, with right and down steps, and staying below the diagonal. Then the permutation matrix is obtained by placing ones into the cells corresponding to the peaks of the path and placing ones into the remaining columns from left to right, such that the row indices of the cells increase.
searching the database
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!