Identifier
Values
[1] => [1,0] => [1,0] => [2,1] => 0
[2] => [1,0,1,0] => [1,1,0,0] => [2,3,1] => 0
[1,1] => [1,1,0,0] => [1,0,1,0] => [3,1,2] => 0
[3] => [1,0,1,0,1,0] => [1,1,1,0,0,0] => [2,3,4,1] => 0
[2,1] => [1,0,1,1,0,0] => [1,1,0,1,0,0] => [4,3,1,2] => 0
[1,1,1] => [1,1,0,1,0,0] => [1,0,1,1,0,0] => [3,1,4,2] => 0
[4] => [1,0,1,0,1,0,1,0] => [1,1,1,1,0,0,0,0] => [2,3,4,5,1] => 0
[3,1] => [1,0,1,0,1,1,0,0] => [1,1,1,0,1,0,0,0] => [5,3,4,1,2] => 0
[2,2] => [1,1,1,0,0,0] => [1,0,1,0,1,0] => [4,1,2,3] => 0
[2,1,1] => [1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,0,0] => [4,3,1,5,2] => 0
[1,1,1,1] => [1,1,0,1,0,1,0,0] => [1,0,1,1,1,0,0,0] => [3,1,4,5,2] => 0
[5] => [1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,0,0,0,0,0] => [2,3,4,5,6,1] => 0
[4,1] => [1,0,1,0,1,0,1,1,0,0] => [1,1,1,1,0,1,0,0,0,0] => [6,3,4,5,1,2] => 0
[3,2] => [1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,0,0] => [5,4,1,2,3] => 0
[3,1,1] => [1,0,1,0,1,1,0,1,0,0] => [1,1,1,0,1,1,0,0,0,0] => [5,3,4,1,6,2] => 0
[2,2,1] => [1,1,1,0,0,1,0,0] => [1,0,1,1,0,0,1,0] => [3,1,5,2,4] => 1
[2,1,1,1] => [1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,1,0,0,0,0] => [4,3,1,5,6,2] => 0
[1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,0] => [1,0,1,1,1,1,0,0,0,0] => [3,1,4,5,6,2] => 0
[6] => [1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,0,0,0,0,0,0] => [2,3,4,5,6,7,1] => 0
[4,2] => [1,0,1,0,1,1,1,0,0,0] => [1,1,1,0,1,0,1,0,0,0] => [6,5,4,1,2,3] => 0
[3,3] => [1,1,1,0,1,0,0,0] => [1,0,1,0,1,1,0,0] => [4,1,2,5,3] => 0
[3,2,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,0,0,1,0,0] => [6,3,1,5,2,4] => 1
[2,2,2] => [1,1,1,1,0,0,0,0] => [1,0,1,0,1,0,1,0] => [5,1,2,3,4] => 0
[2,2,1,1] => [1,1,1,0,0,1,0,1,0,0] => [1,0,1,1,1,0,0,0,1,0] => [3,1,4,6,2,5] => 1
[7] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,1] => 0
[5,2] => [1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => [7,6,4,5,1,2,3] => 0
[4,3] => [1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,0,1,1,0,0,0] => [5,4,1,2,6,3] => 0
[3,3,1] => [1,1,1,0,1,0,0,1,0,0] => [1,0,1,1,0,0,1,1,0,0] => [3,1,5,2,6,4] => 0
[3,2,2] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,0,1,0,1,0,0] => [5,6,1,2,3,4] => 0
[2,2,2,1] => [1,1,1,1,0,0,0,1,0,0] => [1,0,1,1,0,0,1,0,1,0] => [3,1,6,2,4,5] => 1
[8] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,1] => 0
[6,2] => [1,0,1,0,1,0,1,0,1,1,1,0,0,0] => [1,1,1,1,1,0,1,0,1,0,0,0,0,0] => [8,7,4,5,6,1,2,3] => 0
[5,2,1] => [1,0,1,0,1,0,1,1,1,0,0,1,0,0] => [1,1,1,1,0,1,1,0,0,1,0,0,0,0] => [8,3,6,5,1,7,2,4] => 1
[4,4] => [1,1,1,0,1,0,1,0,0,0] => [1,0,1,0,1,1,1,0,0,0] => [4,1,2,5,6,3] => 0
[4,2,1,1] => [1,0,1,0,1,1,1,0,0,1,0,1,0,0] => [1,1,1,0,1,1,1,0,0,0,1,0,0,0] => [8,3,4,1,6,7,2,5] => 0
[3,3,2] => [1,1,1,0,1,1,0,0,0,0] => [1,0,1,0,1,1,0,1,0,0] => [6,1,2,5,3,4] => 0
[2,2,2,2] => [1,1,1,1,0,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0] => [5,1,2,3,6,4] => 0
[9] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,10,1] => 0
[3,3,3] => [1,1,1,1,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0] => [6,1,2,3,4,5] => 0
[3,2,2,2] => [1,0,1,1,1,1,0,1,0,0,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [5,6,1,2,3,7,4] => 0
[10] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0] => [2,3,4,5,6,7,8,9,10,11,1] => 0
[4,3,3] => [1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [7,6,1,2,3,4,5] => 0
[2,2,2,2,2] => [1,1,1,1,0,1,0,1,0,0,0,0] => [1,0,1,0,1,0,1,1,1,0,0,0] => [5,1,2,3,6,7,4] => 0
[5,3,3] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0] => [1,1,1,0,1,0,1,0,1,0,1,0,0,0] => [6,7,8,1,2,3,4,5] => 0
[3,3,3,2] => [1,1,1,1,1,0,0,1,0,0,0,0] => [1,0,1,0,1,0,1,1,0,0,1,0] => [5,1,2,3,7,4,6] => 1
[4,4,4] => [1,1,1,1,1,0,1,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,1,0,0] => [6,1,2,3,4,7,5] => 0
[3,3,3,3] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0] => [7,1,2,3,4,5,6] => 0
[5,5,3] => [1,1,1,0,1,0,1,1,1,0,0,0,0,0] => [1,0,1,0,1,1,1,0,1,0,1,0,0,0] => [8,1,2,7,6,3,4,5] => 0
[4,3,3,3] => [1,0,1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,0,1,0,1,0,1,0,1,0,1,0,0] => [8,7,1,2,3,4,5,6] => 0
[5,3,3,3] => [1,0,1,0,1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,0,1,0,1,0,1,0,1,0,1,0,0,0] => [9,7,8,1,2,3,4,5,6] => 0
[6,3,3,3] => [1,0,1,0,1,0,1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,0,1,0,1,0,1,0,1,0,1,0,0,0,0] => [7,8,9,10,1,2,3,4,5,6] => 0
[3,3,3,3,3] => [1,1,1,1,1,1,0,1,0,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [7,1,2,3,4,5,8,6] => 0
[4,4,4,4] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [8,1,2,3,4,5,6,7] => 0
[5,4,4,4] => [1,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0] => [8,9,1,2,3,4,5,6,7] => 0
[] => [] => [] => [1] => 0
[4,4,4,4,4] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [9,1,2,3,4,5,6,7,8] => 0
[4,4,4,4,4,4] => [1,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [9,1,2,3,4,5,6,7,10,8] => 0
[5,5,5,5] => [1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0] => [8,1,2,3,4,5,6,9,7] => 0
[5,5,5,5,5,5] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [11,1,2,3,4,5,6,7,8,9,10] => 0
[5,5,5,5,5] => [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0] => [10,1,2,3,4,5,6,7,8,9] => 0
[5,4,4,4,4] => [1,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0] => [10,9,1,2,3,4,5,6,7,8] => 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
Description
The number of 2-rises of a permutation.
A 2-rise of a permutation $\pi$ is an index $i$ such that $\pi(i)+2 = \pi(i+1)$.
For 1-rises, or successions, see St000441The number of successions of a permutation..
Map
parallelogram polyomino
Description
Return the Dyck path corresponding to the partition interpreted as a parallogram polyomino.
The Ferrers diagram of an integer partition can be interpreted as a parallogram polyomino, such that each part corresponds to a column.
This map returns the corresponding Dyck path.
Map
Ringel
Description
The Ringel permutation of the LNakayama algebra corresponding to a Dyck path.
Map
decomposition reverse
Description
This map is recursively defined as follows.
The unique empty path of semilength $0$ is sent to itself.
Let $D$ be a Dyck path of semilength $n > 0$ and decompose it into $1 D_1 0 D_2$ with Dyck paths $D_1, D_2$ of respective semilengths $n_1$ and $n_2$ such that $n_1$ is minimal. One then has $n_1+n_2 = n-1$.
Now let $\tilde D_1$ and $\tilde D_2$ be the recursively defined respective images of $D_1$ and $D_2$ under this map. The image of $D$ is then defined as $1 \tilde D_2 0 \tilde D_1$.