Identifier
-
Mp00199:
Dyck paths
—prime Dyck path⟶
Dyck paths
St000675: Dyck paths ⟶ ℤ
Values
[1,0] => [1,1,0,0] => 2
[1,0,1,0] => [1,1,0,1,0,0] => 2
[1,1,0,0] => [1,1,1,0,0,0] => 3
[1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => 3
[1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => 2
[1,1,0,0,1,0] => [1,1,1,0,0,1,0,0] => 2
[1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => 3
[1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => 4
[1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => 3
[1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => 2
[1,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,0,0] => 4
[1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => 3
[1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => 2
[1,1,0,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,0] => 2
[1,1,0,0,1,1,0,0] => [1,1,1,0,0,1,1,0,0,0] => 2
[1,1,0,1,0,0,1,0] => [1,1,1,0,1,0,0,1,0,0] => 3
[1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => 4
[1,1,0,1,1,0,0,0] => [1,1,1,0,1,1,0,0,0,0] => 3
[1,1,1,0,0,0,1,0] => [1,1,1,1,0,0,0,1,0,0] => 2
[1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => 3
[1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => 4
[1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => 5
[1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => 4
[1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => 3
[1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,0] => 3
[1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => 2
[1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => 2
[1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,1,0,0] => 3
[1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,1,0,0,1,1,0,0,0] => 2
[1,0,1,1,0,1,0,0,1,0] => [1,1,0,1,1,0,1,0,0,1,0,0] => 4
[1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,0,1,0,1,0,0,0] => 3
[1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,1,0,0,0,0] => 2
[1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,0] => 5
[1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0] => 4
[1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,1,1,0,1,0,0,0,0] => 3
[1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => 2
[1,1,0,0,1,0,1,0,1,0] => [1,1,1,0,0,1,0,1,0,1,0,0] => 3
[1,1,0,0,1,0,1,1,0,0] => [1,1,1,0,0,1,0,1,1,0,0,0] => 3
[1,1,0,0,1,1,0,0,1,0] => [1,1,1,0,0,1,1,0,0,1,0,0] => 2
[1,1,0,0,1,1,0,1,0,0] => [1,1,1,0,0,1,1,0,1,0,0,0] => 2
[1,1,0,0,1,1,1,0,0,0] => [1,1,1,0,0,1,1,1,0,0,0,0] => 2
[1,1,0,1,0,0,1,0,1,0] => [1,1,1,0,1,0,0,1,0,1,0,0] => 2
[1,1,0,1,0,0,1,1,0,0] => [1,1,1,0,1,0,0,1,1,0,0,0] => 2
[1,1,0,1,0,1,0,0,1,0] => [1,1,1,0,1,0,1,0,0,1,0,0] => 3
[1,1,0,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => 4
[1,1,0,1,0,1,1,0,0,0] => [1,1,1,0,1,0,1,1,0,0,0,0] => 3
[1,1,0,1,1,0,0,0,1,0] => [1,1,1,0,1,1,0,0,0,1,0,0] => 4
[1,1,0,1,1,0,0,1,0,0] => [1,1,1,0,1,1,0,0,1,0,0,0] => 5
[1,1,0,1,1,0,1,0,0,0] => [1,1,1,0,1,1,0,1,0,0,0,0] => 4
[1,1,0,1,1,1,0,0,0,0] => [1,1,1,0,1,1,1,0,0,0,0,0] => 3
[1,1,1,0,0,0,1,0,1,0] => [1,1,1,1,0,0,0,1,0,1,0,0] => 2
[1,1,1,0,0,0,1,1,0,0] => [1,1,1,1,0,0,0,1,1,0,0,0] => 2
[1,1,1,0,0,1,0,0,1,0] => [1,1,1,1,0,0,1,0,0,1,0,0] => 2
[1,1,1,0,0,1,0,1,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => 3
[1,1,1,0,0,1,1,0,0,0] => [1,1,1,1,0,0,1,1,0,0,0,0] => 3
[1,1,1,0,1,0,0,0,1,0] => [1,1,1,1,0,1,0,0,0,1,0,0] => 3
[1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => 4
[1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => 5
[1,1,1,0,1,1,0,0,0,0] => [1,1,1,1,0,1,1,0,0,0,0,0] => 4
[1,1,1,1,0,0,0,0,1,0] => [1,1,1,1,1,0,0,0,0,1,0,0] => 2
[1,1,1,1,0,0,0,1,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => 3
[1,1,1,1,0,0,1,0,0,0] => [1,1,1,1,1,0,0,1,0,0,0,0] => 4
[1,1,1,1,0,1,0,0,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => 5
[1,1,1,1,1,0,0,0,0,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => 6
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,1,0,0] => 4
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,0,1,1,0,0,0] => 3
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,1,0,1,0,1,0,1,1,0,0,1,0,0] => 3
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,0,1,1,0,1,0,0,0] => 2
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,1,1,1,0,0,0,0] => 2
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,1,0,1,0,1,1,0,0,1,0,1,0,0] => 5
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,1,1,0,0,0] => 4
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,1,0,1,0,1,1,0,1,0,0,1,0,0] => 4
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,0,1,1,0,1,0,1,0,0,0] => 3
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,1,0,1,0,1,1,0,1,1,0,0,0,0] => 3
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,1,0,1,0,1,1,1,0,0,0,1,0,0] => 3
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,0,1,1,1,0,0,1,0,0,0] => 2
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,0,1,1,1,0,1,0,0,0,0] => 2
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,1,1,1,0,0,0,0,0] => 2
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,1,0,1,1,0,0,1,0,1,0,1,0,0] => 3
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,1,0,1,1,0,0,1,0,1,1,0,0,0] => 2
[1,0,1,1,0,0,1,1,0,0,1,0] => [1,1,0,1,1,0,0,1,1,0,0,1,0,0] => 3
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,1,0,1,1,0,0,1,1,0,1,0,0,0] => 2
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,1,0,1,1,0,0,1,1,1,0,0,0,0] => 2
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,1,0,1,1,0,1,0,0,1,0,1,0,0] => 4
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,1,0,1,1,0,1,0,0,1,1,0,0,0] => 3
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,1,0,1,1,0,1,0,1,0,0,1,0,0] => 5
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,1,0,1,1,0,1,0,1,0,1,0,0,0] => 4
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,1,0,1,1,0,1,0,1,1,0,0,0,0] => 3
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,1,0,1,1,0,1,1,0,0,0,1,0,0] => 4
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,1,0,1,1,0,1,1,0,0,1,0,0,0] => 3
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,1,0,1,1,0,1,1,0,1,0,0,0,0] => 2
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,1,0,1,1,0,1,1,1,0,0,0,0,0] => 2
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,1,0,1,1,1,0,0,0,1,0,1,0,0] => 3
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,1,0,1,1,1,0,0,0,1,1,0,0,0] => 2
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,1,0,1,1,1,0,0,1,0,0,1,0,0] => 4
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,0,1,1,1,0,0,1,0,1,0,0,0] => 3
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,1,0,1,1,1,0,0,1,1,0,0,0,0] => 2
[1,0,1,1,1,0,1,0,0,0,1,0] => [1,1,0,1,1,1,0,1,0,0,0,1,0,0] => 5
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,1,0,1,1,1,0,1,0,0,1,0,0,0] => 4
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,1,0,1,1,1,0,1,0,1,0,0,0,0] => 3
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,1,0,1,1,1,0,1,1,0,0,0,0,0] => 2
>>> Load all 196 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 centered multitunnels of a Dyck path.
This is the number of factorisations $D = A B C$ of a Dyck path, such that $B$ is a Dyck path and $A$ and $B$ have the same length.
This is the number of factorisations $D = A B C$ of a Dyck path, such that $B$ is a Dyck path and $A$ and $B$ have the same length.
Map
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.
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!