Identifier
Values
[1] => [1,0] => 0
[1,1] => [1,0,1,0] => 1
[2] => [1,1,0,0] => 0
[1,1,1] => [1,0,1,0,1,0] => 1
[1,2] => [1,0,1,1,0,0] => 1
[2,1] => [1,1,0,0,1,0] => 2
[3] => [1,1,1,0,0,0] => 0
[1,1,1,1] => [1,0,1,0,1,0,1,0] => 2
[1,1,2] => [1,0,1,0,1,1,0,0] => 2
[1,2,1] => [1,0,1,1,0,0,1,0] => 1
[1,3] => [1,0,1,1,1,0,0,0] => 1
[2,1,1] => [1,1,0,0,1,0,1,0] => 2
[2,2] => [1,1,0,0,1,1,0,0] => 2
[3,1] => [1,1,1,0,0,0,1,0] => 3
[4] => [1,1,1,1,0,0,0,0] => 0
[1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0] => 2
[1,1,1,2] => [1,0,1,0,1,0,1,1,0,0] => 2
[1,1,2,1] => [1,0,1,0,1,1,0,0,1,0] => 2
[1,1,3] => [1,0,1,0,1,1,1,0,0,0] => 2
[1,2,1,1] => [1,0,1,1,0,0,1,0,1,0] => 3
[1,2,2] => [1,0,1,1,0,0,1,1,0,0] => 3
[1,3,1] => [1,0,1,1,1,0,0,0,1,0] => 1
[1,4] => [1,0,1,1,1,1,0,0,0,0] => 1
[2,1,1,1] => [1,1,0,0,1,0,1,0,1,0] => 2
[2,1,2] => [1,1,0,0,1,0,1,1,0,0] => 2
[2,2,1] => [1,1,0,0,1,1,0,0,1,0] => 2
[2,3] => [1,1,0,0,1,1,1,0,0,0] => 2
[3,1,1] => [1,1,1,0,0,0,1,0,1,0] => 3
[3,2] => [1,1,1,0,0,0,1,1,0,0] => 3
[4,1] => [1,1,1,1,0,0,0,0,1,0] => 4
[5] => [1,1,1,1,1,0,0,0,0,0] => 0
[1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0] => 3
[1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0] => 3
[1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0] => 3
[1,1,1,3] => [1,0,1,0,1,0,1,1,1,0,0,0] => 3
[1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0] => 2
[1,1,2,2] => [1,0,1,0,1,1,0,0,1,1,0,0] => 2
[1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0] => 2
[1,1,4] => [1,0,1,0,1,1,1,1,0,0,0,0] => 2
[1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0] => 3
[1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0] => 3
[1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0] => 3
[1,2,3] => [1,0,1,1,0,0,1,1,1,0,0,0] => 3
[1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0] => 4
[1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0] => 4
[1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0] => 1
[1,5] => [1,0,1,1,1,1,1,0,0,0,0,0] => 1
[2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0] => 3
[2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0] => 3
[2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0] => 3
[2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0] => 3
[2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0] => 2
[2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0] => 2
[2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0] => 2
[2,4] => [1,1,0,0,1,1,1,1,0,0,0,0] => 2
[3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0] => 3
[3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0] => 3
[3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0] => 3
[3,3] => [1,1,1,0,0,0,1,1,1,0,0,0] => 3
[4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0] => 4
[4,2] => [1,1,1,1,0,0,0,0,1,1,0,0] => 4
[5,1] => [1,1,1,1,1,0,0,0,0,0,1,0] => 5
[6] => [1,1,1,1,1,1,0,0,0,0,0,0] => 0
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
click to show known generating functions       
Description
The number of left tunnels of a Dyck path.
A tunnel is a pair (a,b) where a is the position of an open parenthesis and b is the position of the matching close parenthesis. If a+b<n then the tunnel is called left.
Map
bounce path
Description
The bounce path determined by an integer composition.