Identifier
-
Mp00178:
Binary words
—to composition⟶
Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00034: Dyck paths —to binary tree: up step, left tree, down step, right tree⟶ Binary trees
St000161: Binary trees ⟶ ℤ
Values
0 => [2] => [1,1,0,0] => [[.,.],.] => 0
1 => [1,1] => [1,0,1,0] => [.,[.,.]] => 1
00 => [3] => [1,1,1,0,0,0] => [[[.,.],.],.] => 0
01 => [2,1] => [1,1,0,0,1,0] => [[.,.],[.,.]] => 1
10 => [1,2] => [1,0,1,1,0,0] => [.,[[.,.],.]] => 2
11 => [1,1,1] => [1,0,1,0,1,0] => [.,[.,[.,.]]] => 3
000 => [4] => [1,1,1,1,0,0,0,0] => [[[[.,.],.],.],.] => 0
001 => [3,1] => [1,1,1,0,0,0,1,0] => [[[.,.],.],[.,.]] => 1
010 => [2,2] => [1,1,0,0,1,1,0,0] => [[.,.],[[.,.],.]] => 2
011 => [2,1,1] => [1,1,0,0,1,0,1,0] => [[.,.],[.,[.,.]]] => 3
100 => [1,3] => [1,0,1,1,1,0,0,0] => [.,[[[.,.],.],.]] => 3
101 => [1,2,1] => [1,0,1,1,0,0,1,0] => [.,[[.,.],[.,.]]] => 4
110 => [1,1,2] => [1,0,1,0,1,1,0,0] => [.,[.,[[.,.],.]]] => 5
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0] => [.,[.,[.,[.,.]]]] => 6
0000 => [5] => [1,1,1,1,1,0,0,0,0,0] => [[[[[.,.],.],.],.],.] => 0
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0] => [[[[.,.],.],.],[.,.]] => 1
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0] => [[[.,.],.],[[.,.],.]] => 2
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0] => [[[.,.],.],[.,[.,.]]] => 3
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0] => [[.,.],[[[.,.],.],.]] => 3
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0] => [[.,.],[[.,.],[.,.]]] => 4
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0] => [[.,.],[.,[[.,.],.]]] => 5
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0] => [[.,.],[.,[.,[.,.]]]] => 6
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0] => [.,[[[[.,.],.],.],.]] => 4
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0] => [.,[[[.,.],.],[.,.]]] => 5
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0] => [.,[[.,.],[[.,.],.]]] => 6
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => [.,[[.,.],[.,[.,.]]]] => 7
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0] => [.,[.,[[[.,.],.],.]]] => 7
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => [.,[.,[[.,.],[.,.]]]] => 8
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => [.,[.,[.,[[.,.],.]]]] => 9
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => [.,[.,[.,[.,[.,.]]]]] => 10
00000 => [6] => [1,1,1,1,1,1,0,0,0,0,0,0] => [[[[[[.,.],.],.],.],.],.] => 0
00001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0] => [[[[[.,.],.],.],.],[.,.]] => 1
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0] => [[[[.,.],.],.],[[.,.],.]] => 2
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0] => [[[[.,.],.],.],[.,[.,.]]] => 3
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => [[[.,.],.],[[[.,.],.],.]] => 3
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0] => [[[.,.],.],[[.,.],[.,.]]] => 4
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0] => [[[.,.],.],[.,[[.,.],.]]] => 5
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0] => [[[.,.],.],[.,[.,[.,.]]]] => 6
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0] => [[.,.],[[[[.,.],.],.],.]] => 4
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0] => [[.,.],[[[.,.],.],[.,.]]] => 5
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0] => [[.,.],[[.,.],[[.,.],.]]] => 6
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0] => [[.,.],[[.,.],[.,[.,.]]]] => 7
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0] => [[.,.],[.,[[[.,.],.],.]]] => 7
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0] => [[.,.],[.,[[.,.],[.,.]]]] => 8
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0] => [[.,.],[.,[.,[[.,.],.]]]] => 9
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0] => [[.,.],[.,[.,[.,[.,.]]]]] => 10
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0] => [.,[[[[[.,.],.],.],.],.]] => 5
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => [.,[[[[.,.],.],.],[.,.]]] => 6
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0] => [.,[[[.,.],.],[[.,.],.]]] => 7
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0] => [.,[[[.,.],.],[.,[.,.]]]] => 8
10100 => [1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0] => [.,[[.,.],[[[.,.],.],.]]] => 8
10101 => [1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => [.,[[.,.],[[.,.],[.,.]]]] => 9
10110 => [1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0] => [.,[[.,.],[.,[[.,.],.]]]] => 10
10111 => [1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0] => [.,[[.,.],[.,[.,[.,.]]]]] => 11
11000 => [1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0] => [.,[.,[[[[.,.],.],.],.]]] => 9
11001 => [1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0] => [.,[.,[[[.,.],.],[.,.]]]] => 10
11010 => [1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0] => [.,[.,[[.,.],[[.,.],.]]]] => 11
11011 => [1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0] => [.,[.,[[.,.],[.,[.,.]]]]] => 12
11100 => [1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0] => [.,[.,[.,[[[.,.],.],.]]]] => 12
11101 => [1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0] => [.,[.,[.,[[.,.],[.,.]]]]] => 13
11110 => [1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0] => [.,[.,[.,[.,[[.,.],.]]]]] => 14
11111 => [1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0] => [.,[.,[.,[.,[.,[.,.]]]]]] => 15
000001 => [6,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0] => [[[[[[.,.],.],.],.],.],[.,.]] => 1
000010 => [5,2] => [1,1,1,1,1,0,0,0,0,0,1,1,0,0] => [[[[[.,.],.],.],.],[[.,.],.]] => 2
000011 => [5,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0] => [[[[[.,.],.],.],.],[.,[.,.]]] => 3
010000 => [2,5] => [1,1,0,0,1,1,1,1,1,0,0,0,0,0] => [[.,.],[[[[[.,.],.],.],.],.]] => 5
010111 => [2,2,1,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0,1,0] => [[.,.],[[.,.],[.,[.,[.,.]]]]] => 11
011010 => [2,1,2,2] => [1,1,0,0,1,0,1,1,0,0,1,1,0,0] => [[.,.],[.,[[.,.],[[.,.],.]]]] => 11
011011 => [2,1,2,1,1] => [1,1,0,0,1,0,1,1,0,0,1,0,1,0] => [[.,.],[.,[[.,.],[.,[.,.]]]]] => 12
011100 => [2,1,1,3] => [1,1,0,0,1,0,1,0,1,1,1,0,0,0] => [[.,.],[.,[.,[[[.,.],.],.]]]] => 12
011101 => [2,1,1,2,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0] => [[.,.],[.,[.,[[.,.],[.,.]]]]] => 13
011110 => [2,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,1,0,0] => [[.,.],[.,[.,[.,[[.,.],.]]]]] => 14
011111 => [2,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0] => [[.,.],[.,[.,[.,[.,[.,.]]]]]] => 15
100000 => [1,6] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0] => [.,[[[[[[.,.],.],.],.],.],.]] => 6
100001 => [1,5,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0] => [.,[[[[[.,.],.],.],.],[.,.]]] => 7
0000000 => [8] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [[[[[[[[.,.],.],.],.],.],.],.],.] => 0
0000001 => [7,1] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0] => [[[[[[[.,.],.],.],.],.],.],[.,.]] => 1
0000010 => [6,2] => [1,1,1,1,1,1,0,0,0,0,0,0,1,1,0,0] => [[[[[[.,.],.],.],.],.],[[.,.],.]] => 2
0001000 => [4,4] => [1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0] => [[[[.,.],.],.],[[[[.,.],.],.],.]] => 4
0001010 => [4,2,2] => [1,1,1,1,0,0,0,0,1,1,0,0,1,1,0,0] => [[[[.,.],.],.],[[.,.],[[.,.],.]]] => 6
0100000 => [2,6] => [1,1,0,0,1,1,1,1,1,1,0,0,0,0,0,0] => [[.,.],[[[[[[.,.],.],.],.],.],.]] => 6
0100010 => [2,4,2] => [1,1,0,0,1,1,1,1,0,0,0,0,1,1,0,0] => [[.,.],[[[[.,.],.],.],[[.,.],.]]] => 8
0101000 => [2,2,4] => [1,1,0,0,1,1,0,0,1,1,1,1,0,0,0,0] => [[.,.],[[.,.],[[[[.,.],.],.],.]]] => 10
0101010 => [2,2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0] => [[.,.],[[.,.],[[.,.],[[.,.],.]]]] => 12
0111011 => [2,1,1,2,1,1] => [1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0] => [[.,.],[.,[.,[[.,.],[.,[.,.]]]]]] => 18
0111100 => [2,1,1,1,3] => [1,1,0,0,1,0,1,0,1,0,1,1,1,0,0,0] => [[.,.],[.,[.,[.,[[[.,.],.],.]]]]] => 18
0111101 => [2,1,1,1,2,1] => [1,1,0,0,1,0,1,0,1,0,1,1,0,0,1,0] => [[.,.],[.,[.,[.,[[.,.],[.,.]]]]]] => 19
0111110 => [2,1,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0] => [[.,.],[.,[.,[.,[.,[[.,.],.]]]]]] => 20
0111111 => [2,1,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0] => [[.,.],[.,[.,[.,[.,[.,[.,.]]]]]]] => 21
1000000 => [1,7] => [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [.,[[[[[[[.,.],.],.],.],.],.],.]] => 7
00000001 => [8,1] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0] => [[[[[[[[.,.],.],.],.],.],.],.],[.,.]] => 1
01111101 => [2,1,1,1,1,2,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0,1,0] => [[.,.],[.,[.,[.,[.,[[.,.],[.,.]]]]]]] => 26
01111110 => [2,1,1,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [[.,.],[.,[.,[.,[.,[.,[[.,.],.]]]]]]] => 27
01111111 => [2,1,1,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [[.,.],[.,[.,[.,[.,[.,[.,[.,.]]]]]]]] => 28
10000000 => [1,8] => [1,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [.,[[[[[[[[.,.],.],.],.],.],.],.],.]] => 8
000000001 => [9,1] => [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,1,0] => [[[[[[[[[.,.],.],.],.],.],.],.],.],[.,.]] => 1
010101010 => [2,2,2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0] => [[.,.],[[.,.],[[.,.],[[.,.],[[.,.],.]]]]] => 20
011111110 => [2,1,1,1,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [[.,.],[.,[.,[.,[.,[.,[.,[[.,.],.]]]]]]]] => 35
011111111 => [2,1,1,1,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [[.,.],[.,[.,[.,[.,[.,[.,[.,[.,.]]]]]]]]] => 36
100000000 => [1,9] => [1,0,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0] => [.,[[[[[[[[[.,.],.],.],.],.],.],.],.],.]] => 9
1000000000 => [1,10] => [1,0,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0] => [.,[[[[[[[[[[.,.],.],.],.],.],.],.],.],.],.]] => 10
>>> Load all 104 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 sum of the sizes of the right subtrees of a binary tree.
This statistic corresponds to St000012The area of a Dyck path. under the Tamari Dyck path-binary tree bijection, and to St000018The number of inversions of a permutation. of the $312$-avoiding permutation corresponding to the binary tree.
It is also the sum of all heights $j$ of the coordinates $(i,j)$ of the Dyck path corresponding to the binary tree.
This statistic corresponds to St000012The area of a Dyck path. under the Tamari Dyck path-binary tree bijection, and to St000018The number of inversions of a permutation. of the $312$-avoiding permutation corresponding to the binary tree.
It is also the sum of all heights $j$ of the coordinates $(i,j)$ of the Dyck path corresponding to the binary tree.
Map
to binary tree: up step, left tree, down step, right tree
Description
Return the binary tree corresponding to the Dyck path under the transformation up step - left tree - down step - right tree.
A Dyck path $D$ of semilength $n$ with $ n > 1$ may be uniquely decomposed into $1L0R$ for Dyck paths L,R of respective semilengths $n_1, n_2$ with $n_1 + n_2 = n-1$.
This map sends $D$ to the binary tree $T$ consisting of a root node with a left child according to $L$ and a right child according to $R$ and then recursively proceeds.
The base case of the unique Dyck path of semilength $1$ is sent to a single node.
A Dyck path $D$ of semilength $n$ with $ n > 1$ may be uniquely decomposed into $1L0R$ for Dyck paths L,R of respective semilengths $n_1, n_2$ with $n_1 + n_2 = n-1$.
This map sends $D$ to the binary tree $T$ consisting of a root node with a left child according to $L$ and a right child according to $R$ and then recursively proceeds.
The base case of the unique Dyck path of semilength $1$ is sent to a single node.
Map
bounce path
Description
The bounce path determined by an integer composition.
Map
to composition
Description
The composition corresponding to a binary word.
Prepending $1$ to a binary word $w$, the $i$-th part of the composition equals $1$ plus the number of zeros after the $i$-th $1$ in $w$.
This map is not surjective, since the empty composition does not have a preimage.
Prepending $1$ to a binary word $w$, the $i$-th part of the composition equals $1$ plus the number of zeros after the $i$-th $1$ in $w$.
This map is not surjective, since the empty composition does not have a preimage.
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!