Identifier
-
Mp00231:
Integer compositions
—bounce path⟶
Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00072: Permutations —binary search tree: left to right⟶ Binary trees
St000204: Binary trees ⟶ ℤ
Values
[1] => [1,0] => [1] => [.,.] => 0
[1,1] => [1,0,1,0] => [1,2] => [.,[.,.]] => 0
[2] => [1,1,0,0] => [2,1] => [[.,.],.] => 0
[1,1,1] => [1,0,1,0,1,0] => [1,2,3] => [.,[.,[.,.]]] => 0
[1,2] => [1,0,1,1,0,0] => [1,3,2] => [.,[[.,.],.]] => 1
[2,1] => [1,1,0,0,1,0] => [2,1,3] => [[.,.],[.,.]] => 0
[3] => [1,1,1,0,0,0] => [3,1,2] => [[.,[.,.]],.] => 1
[1,1,1,1] => [1,0,1,0,1,0,1,0] => [1,2,3,4] => [.,[.,[.,[.,.]]]] => 0
[1,1,2] => [1,0,1,0,1,1,0,0] => [1,2,4,3] => [.,[.,[[.,.],.]]] => 1
[1,2,1] => [1,0,1,1,0,0,1,0] => [1,3,2,4] => [.,[[.,.],[.,.]]] => 1
[1,3] => [1,0,1,1,1,0,0,0] => [1,4,2,3] => [.,[[.,[.,.]],.]] => 2
[2,1,1] => [1,1,0,0,1,0,1,0] => [2,1,3,4] => [[.,.],[.,[.,.]]] => 0
[2,2] => [1,1,0,0,1,1,0,0] => [2,1,4,3] => [[.,.],[[.,.],.]] => 1
[3,1] => [1,1,1,0,0,0,1,0] => [3,1,2,4] => [[.,[.,.]],[.,.]] => 1
[4] => [1,1,1,1,0,0,0,0] => [4,1,2,3] => [[.,[.,[.,.]]],.] => 2
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]] => 0
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]] => 1
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => [.,[.,[[.,.],[.,.]]]] => 1
[1,1,3] => [1,0,1,0,1,1,1,0,0,0] => [1,2,5,3,4] => [.,[.,[[.,[.,.]],.]]] => 2
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]] => 1
[1,2,2] => [1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => [.,[[.,.],[[.,.],.]]] => 2
[1,3,1] => [1,0,1,1,1,0,0,0,1,0] => [1,4,2,3,5] => [.,[[.,[.,.]],[.,.]]] => 2
[1,4] => [1,0,1,1,1,1,0,0,0,0] => [1,5,2,3,4] => [.,[[.,[.,[.,.]]],.]] => 3
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => [[.,.],[.,[.,[.,.]]]] => 0
[2,1,2] => [1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => [[.,.],[.,[[.,.],.]]] => 1
[2,2,1] => [1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => [[.,.],[[.,.],[.,.]]] => 1
[2,3] => [1,1,0,0,1,1,1,0,0,0] => [2,1,5,3,4] => [[.,.],[[.,[.,.]],.]] => 2
[3,1,1] => [1,1,1,0,0,0,1,0,1,0] => [3,1,2,4,5] => [[.,[.,.]],[.,[.,.]]] => 1
[3,2] => [1,1,1,0,0,0,1,1,0,0] => [3,1,2,5,4] => [[.,[.,.]],[[.,.],.]] => 2
[4,1] => [1,1,1,1,0,0,0,0,1,0] => [4,1,2,3,5] => [[.,[.,[.,.]]],[.,.]] => 2
[5] => [1,1,1,1,1,0,0,0,0,0] => [5,1,2,3,4] => [[.,[.,[.,[.,.]]]],.] => 3
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5,6] => [.,[.,[.,[.,[.,[.,.]]]]]] => 0
[1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0] => [1,2,3,4,6,5] => [.,[.,[.,[.,[[.,.],.]]]]] => 1
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0] => [1,2,3,5,4,6] => [.,[.,[.,[[.,.],[.,.]]]]] => 1
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,2,3,6,4,5] => [.,[.,[.,[[.,[.,.]],.]]]] => 2
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0] => [1,2,4,3,5,6] => [.,[.,[[.,.],[.,[.,.]]]]] => 1
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,4,3,6,5] => [.,[.,[[.,.],[[.,.],.]]]] => 2
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,5,3,4,6] => [.,[.,[[.,[.,.]],[.,.]]]] => 2
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,6,3,4,5] => [.,[.,[[.,[.,[.,.]]],.]]] => 3
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0] => [1,3,2,4,5,6] => [.,[[.,.],[.,[.,[.,.]]]]] => 1
[1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0] => [1,3,2,4,6,5] => [.,[[.,.],[.,[[.,.],.]]]] => 2
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => [1,3,2,5,4,6] => [.,[[.,.],[[.,.],[.,.]]]] => 2
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0] => [1,3,2,6,4,5] => [.,[[.,.],[[.,[.,.]],.]]] => 3
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0] => [1,4,2,3,5,6] => [.,[[.,[.,.]],[.,[.,.]]]] => 2
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0] => [1,4,2,3,6,5] => [.,[[.,[.,.]],[[.,.],.]]] => 3
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [1,5,2,3,4,6] => [.,[[.,[.,[.,.]]],[.,.]]] => 3
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,6,2,3,4,5] => [.,[[.,[.,[.,[.,.]]]],.]] => 4
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0] => [2,1,3,4,5,6] => [[.,.],[.,[.,[.,[.,.]]]]] => 0
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0] => [2,1,3,4,6,5] => [[.,.],[.,[.,[[.,.],.]]]] => 1
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0] => [2,1,3,5,4,6] => [[.,.],[.,[[.,.],[.,.]]]] => 1
[2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0] => [2,1,3,6,4,5] => [[.,.],[.,[[.,[.,.]],.]]] => 2
[2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0] => [2,1,4,3,5,6] => [[.,.],[[.,.],[.,[.,.]]]] => 1
[2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0] => [2,1,4,3,6,5] => [[.,.],[[.,.],[[.,.],.]]] => 2
[2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0] => [2,1,5,3,4,6] => [[.,.],[[.,[.,.]],[.,.]]] => 2
[2,4] => [1,1,0,0,1,1,1,1,0,0,0,0] => [2,1,6,3,4,5] => [[.,.],[[.,[.,[.,.]]],.]] => 3
[3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0] => [3,1,2,4,5,6] => [[.,[.,.]],[.,[.,[.,.]]]] => 1
[3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0] => [3,1,2,4,6,5] => [[.,[.,.]],[.,[[.,.],.]]] => 2
[3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0] => [3,1,2,5,4,6] => [[.,[.,.]],[[.,.],[.,.]]] => 2
[3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => [3,1,2,6,4,5] => [[.,[.,.]],[[.,[.,.]],.]] => 3
[4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0] => [4,1,2,3,5,6] => [[.,[.,[.,.]]],[.,[.,.]]] => 2
[4,2] => [1,1,1,1,0,0,0,0,1,1,0,0] => [4,1,2,3,6,5] => [[.,[.,[.,.]]],[[.,.],.]] => 3
[5,1] => [1,1,1,1,1,0,0,0,0,0,1,0] => [5,1,2,3,4,6] => [[.,[.,[.,[.,.]]]],[.,.]] => 3
[6] => [1,1,1,1,1,1,0,0,0,0,0,0] => [6,1,2,3,4,5] => [[.,[.,[.,[.,[.,.]]]]],.] => 4
[1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5,6,7] => [.,[.,[.,[.,[.,[.,[.,.]]]]]]] => 0
[1,1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [1,2,3,4,5,7,6] => [.,[.,[.,[.,[.,[[.,.],.]]]]]] => 1
[1,1,1,1,2,1] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0] => [1,2,3,4,6,5,7] => [.,[.,[.,[.,[[.,.],[.,.]]]]]] => 1
[1,1,1,1,3] => [1,0,1,0,1,0,1,0,1,1,1,0,0,0] => [1,2,3,4,7,5,6] => [.,[.,[.,[.,[[.,[.,.]],.]]]]] => 2
[1,1,1,2,1,1] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0] => [1,2,3,5,4,6,7] => [.,[.,[.,[[.,.],[.,[.,.]]]]]] => 1
[1,1,1,2,2] => [1,0,1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,3,5,4,7,6] => [.,[.,[.,[[.,.],[[.,.],.]]]]] => 2
[1,1,1,3,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,3,6,4,5,7] => [.,[.,[.,[[.,[.,.]],[.,.]]]]] => 2
[1,1,1,4] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,3,7,4,5,6] => [.,[.,[.,[[.,[.,[.,.]]],.]]]] => 3
[1,1,2,1,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0] => [1,2,4,3,5,6,7] => [.,[.,[[.,.],[.,[.,[.,.]]]]]] => 1
[1,1,2,1,2] => [1,0,1,0,1,1,0,0,1,0,1,1,0,0] => [1,2,4,3,5,7,6] => [.,[.,[[.,.],[.,[[.,.],.]]]]] => 2
[1,1,2,2,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0] => [1,2,4,3,6,5,7] => [.,[.,[[.,.],[[.,.],[.,.]]]]] => 2
[1,1,2,3] => [1,0,1,0,1,1,0,0,1,1,1,0,0,0] => [1,2,4,3,7,5,6] => [.,[.,[[.,.],[[.,[.,.]],.]]]] => 3
[1,1,3,1,1] => [1,0,1,0,1,1,1,0,0,0,1,0,1,0] => [1,2,5,3,4,6,7] => [.,[.,[[.,[.,.]],[.,[.,.]]]]] => 2
[1,1,3,2] => [1,0,1,0,1,1,1,0,0,0,1,1,0,0] => [1,2,5,3,4,7,6] => [.,[.,[[.,[.,.]],[[.,.],.]]]] => 3
[1,1,4,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0] => [1,2,6,3,4,5,7] => [.,[.,[[.,[.,[.,.]]],[.,.]]]] => 3
[1,1,5] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0] => [1,2,7,3,4,5,6] => [.,[.,[[.,[.,[.,[.,.]]]],.]]] => 4
[1,2,1,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0] => [1,3,2,4,5,6,7] => [.,[[.,.],[.,[.,[.,[.,.]]]]]] => 1
[1,2,1,1,2] => [1,0,1,1,0,0,1,0,1,0,1,1,0,0] => [1,3,2,4,5,7,6] => [.,[[.,.],[.,[.,[[.,.],.]]]]] => 2
[1,2,1,2,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0] => [1,3,2,4,6,5,7] => [.,[[.,.],[.,[[.,.],[.,.]]]]] => 2
[1,2,1,3] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0] => [1,3,2,4,7,5,6] => [.,[[.,.],[.,[[.,[.,.]],.]]]] => 3
[1,2,2,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0] => [1,3,2,5,4,6,7] => [.,[[.,.],[[.,.],[.,[.,.]]]]] => 2
[1,2,2,2] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4,7,6] => [.,[[.,.],[[.,.],[[.,.],.]]]] => 3
[1,2,3,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0] => [1,3,2,6,4,5,7] => [.,[[.,.],[[.,[.,.]],[.,.]]]] => 3
[1,2,4] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0] => [1,3,2,7,4,5,6] => [.,[[.,.],[[.,[.,[.,.]]],.]]] => 4
[1,3,1,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0,1,0] => [1,4,2,3,5,6,7] => [.,[[.,[.,.]],[.,[.,[.,.]]]]] => 2
[1,3,1,2] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0] => [1,4,2,3,5,7,6] => [.,[[.,[.,.]],[.,[[.,.],.]]]] => 3
[1,3,2,1] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0] => [1,4,2,3,6,5,7] => [.,[[.,[.,.]],[[.,.],[.,.]]]] => 3
[1,3,3] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0] => [1,4,2,3,7,5,6] => [.,[[.,[.,.]],[[.,[.,.]],.]]] => 4
[1,4,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0] => [1,5,2,3,4,6,7] => [.,[[.,[.,[.,.]]],[.,[.,.]]]] => 3
[1,4,2] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0] => [1,5,2,3,4,7,6] => [.,[[.,[.,[.,.]]],[[.,.],.]]] => 4
[1,5,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0] => [1,6,2,3,4,5,7] => [.,[[.,[.,[.,[.,.]]]],[.,.]]] => 4
[1,6] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0] => [1,7,2,3,4,5,6] => [.,[[.,[.,[.,[.,[.,.]]]]],.]] => 5
[2,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0] => [2,1,3,4,5,6,7] => [[.,.],[.,[.,[.,[.,[.,.]]]]]] => 0
[2,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,1,0,0] => [2,1,3,4,5,7,6] => [[.,.],[.,[.,[.,[[.,.],.]]]]] => 1
[2,1,1,2,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0] => [2,1,3,4,6,5,7] => [[.,.],[.,[.,[[.,.],[.,.]]]]] => 1
[2,1,1,3] => [1,1,0,0,1,0,1,0,1,1,1,0,0,0] => [2,1,3,4,7,5,6] => [[.,.],[.,[.,[[.,[.,.]],.]]]] => 2
[2,1,2,1,1] => [1,1,0,0,1,0,1,1,0,0,1,0,1,0] => [2,1,3,5,4,6,7] => [[.,.],[.,[[.,.],[.,[.,.]]]]] => 1
[2,1,2,2] => [1,1,0,0,1,0,1,1,0,0,1,1,0,0] => [2,1,3,5,4,7,6] => [[.,.],[.,[[.,.],[[.,.],.]]]] => 2
>>> Load all 127 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 internal nodes of a binary tree.
That is, the total number of nodes of the tree minus St000203The number of external nodes of a binary tree.. A counting formula for the total number of internal nodes across all binary trees of size $n$ is given in [1]. This is equivalent to the number of internal triangles in all triangulations of an $(n+1)$-gon.
That is, the total number of nodes of the tree minus St000203The number of external nodes of a binary tree.. A counting formula for the total number of internal nodes across all binary trees of size $n$ is given in [1]. This is equivalent to the number of internal triangles in all triangulations of an $(n+1)$-gon.
Map
bounce path
Description
The bounce path determined by an integer composition.
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\times 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\times 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!