Identifier
-
Mp00031:
Dyck paths
—to 312-avoiding permutation⟶
Permutations
Mp00175: Permutations —inverse Foata bijection⟶ Permutations
Mp00088: Permutations —Kreweras complement⟶ Permutations
St000541: Permutations ⟶ ℤ (values match St000542The number of left-to-right-minima of a permutation.)
Values
[1,0,1,0] => [1,2] => [1,2] => [2,1] => 1
[1,1,0,0] => [2,1] => [2,1] => [1,2] => 0
[1,0,1,0,1,0] => [1,2,3] => [1,2,3] => [2,3,1] => 1
[1,0,1,1,0,0] => [1,3,2] => [3,1,2] => [3,1,2] => 1
[1,1,0,0,1,0] => [2,1,3] => [2,1,3] => [3,2,1] => 2
[1,1,0,1,0,0] => [2,3,1] => [2,3,1] => [1,2,3] => 0
[1,1,1,0,0,0] => [3,2,1] => [3,2,1] => [1,3,2] => 0
[1,0,1,0,1,0,1,0] => [1,2,3,4] => [1,2,3,4] => [2,3,4,1] => 1
[1,0,1,0,1,1,0,0] => [1,2,4,3] => [4,1,2,3] => [3,4,1,2] => 1
[1,0,1,1,0,0,1,0] => [1,3,2,4] => [3,1,2,4] => [3,4,2,1] => 2
[1,0,1,1,0,1,0,0] => [1,3,4,2] => [3,4,1,2] => [4,1,2,3] => 1
[1,0,1,1,1,0,0,0] => [1,4,3,2] => [4,3,1,2] => [4,1,3,2] => 1
[1,1,0,0,1,0,1,0] => [2,1,3,4] => [2,1,3,4] => [3,2,4,1] => 2
[1,1,0,0,1,1,0,0] => [2,1,4,3] => [2,4,1,3] => [4,2,1,3] => 2
[1,1,0,1,0,0,1,0] => [2,3,1,4] => [2,3,1,4] => [4,2,3,1] => 2
[1,1,0,1,0,1,0,0] => [2,3,4,1] => [2,3,4,1] => [1,2,3,4] => 0
[1,1,0,1,1,0,0,0] => [2,4,3,1] => [4,2,3,1] => [1,3,4,2] => 0
[1,1,1,0,0,0,1,0] => [3,2,1,4] => [3,2,1,4] => [4,3,2,1] => 3
[1,1,1,0,0,1,0,0] => [3,2,4,1] => [3,2,4,1] => [1,3,2,4] => 0
[1,1,1,0,1,0,0,0] => [3,4,2,1] => [3,4,2,1] => [1,4,2,3] => 0
[1,1,1,1,0,0,0,0] => [4,3,2,1] => [4,3,2,1] => [1,4,3,2] => 0
[1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5] => [1,2,3,4,5] => [2,3,4,5,1] => 1
[1,0,1,0,1,0,1,1,0,0] => [1,2,3,5,4] => [5,1,2,3,4] => [3,4,5,1,2] => 1
[1,0,1,0,1,1,0,0,1,0] => [1,2,4,3,5] => [4,1,2,3,5] => [3,4,5,2,1] => 2
[1,0,1,0,1,1,0,1,0,0] => [1,2,4,5,3] => [4,5,1,2,3] => [4,5,1,2,3] => 1
[1,0,1,0,1,1,1,0,0,0] => [1,2,5,4,3] => [5,4,1,2,3] => [4,5,1,3,2] => 1
[1,0,1,1,0,0,1,0,1,0] => [1,3,2,4,5] => [3,1,2,4,5] => [3,4,2,5,1] => 2
[1,0,1,1,0,0,1,1,0,0] => [1,3,2,5,4] => [3,5,1,2,4] => [4,5,2,1,3] => 2
[1,0,1,1,0,1,0,0,1,0] => [1,3,4,2,5] => [3,4,1,2,5] => [4,5,2,3,1] => 2
[1,0,1,1,0,1,0,1,0,0] => [1,3,4,5,2] => [3,4,5,1,2] => [5,1,2,3,4] => 1
[1,0,1,1,0,1,1,0,0,0] => [1,3,5,4,2] => [5,3,4,1,2] => [5,1,3,4,2] => 1
[1,0,1,1,1,0,0,0,1,0] => [1,4,3,2,5] => [4,3,1,2,5] => [4,5,3,2,1] => 3
[1,0,1,1,1,0,0,1,0,0] => [1,4,3,5,2] => [4,3,5,1,2] => [5,1,3,2,4] => 1
[1,0,1,1,1,0,1,0,0,0] => [1,4,5,3,2] => [4,5,3,1,2] => [5,1,4,2,3] => 1
[1,0,1,1,1,1,0,0,0,0] => [1,5,4,3,2] => [5,4,3,1,2] => [5,1,4,3,2] => 1
[1,1,0,0,1,0,1,0,1,0] => [2,1,3,4,5] => [2,1,3,4,5] => [3,2,4,5,1] => 2
[1,1,0,0,1,0,1,1,0,0] => [2,1,3,5,4] => [2,5,1,3,4] => [4,2,5,1,3] => 2
[1,1,0,0,1,1,0,0,1,0] => [2,1,4,3,5] => [2,4,1,3,5] => [4,2,5,3,1] => 2
[1,1,0,0,1,1,0,1,0,0] => [2,1,4,5,3] => [2,4,5,1,3] => [5,2,1,3,4] => 2
[1,1,0,0,1,1,1,0,0,0] => [2,1,5,4,3] => [5,2,4,1,3] => [5,3,1,4,2] => 2
[1,1,0,1,0,0,1,0,1,0] => [2,3,1,4,5] => [2,3,1,4,5] => [4,2,3,5,1] => 2
[1,1,0,1,0,0,1,1,0,0] => [2,3,1,5,4] => [2,3,5,1,4] => [5,2,3,1,4] => 2
[1,1,0,1,0,1,0,0,1,0] => [2,3,4,1,5] => [2,3,4,1,5] => [5,2,3,4,1] => 2
[1,1,0,1,0,1,0,1,0,0] => [2,3,4,5,1] => [2,3,4,5,1] => [1,2,3,4,5] => 0
[1,1,0,1,0,1,1,0,0,0] => [2,3,5,4,1] => [5,2,3,4,1] => [1,3,4,5,2] => 0
[1,1,0,1,1,0,0,0,1,0] => [2,4,3,1,5] => [4,2,3,1,5] => [5,3,4,2,1] => 3
[1,1,0,1,1,0,0,1,0,0] => [2,4,3,5,1] => [4,2,3,5,1] => [1,3,4,2,5] => 0
[1,1,0,1,1,0,1,0,0,0] => [2,4,5,3,1] => [4,5,2,3,1] => [1,4,5,2,3] => 0
[1,1,0,1,1,1,0,0,0,0] => [2,5,4,3,1] => [5,4,2,3,1] => [1,4,5,3,2] => 0
[1,1,1,0,0,0,1,0,1,0] => [3,2,1,4,5] => [3,2,1,4,5] => [4,3,2,5,1] => 3
[1,1,1,0,0,0,1,1,0,0] => [3,2,1,5,4] => [3,2,5,1,4] => [5,3,2,1,4] => 3
[1,1,1,0,0,1,0,0,1,0] => [3,2,4,1,5] => [3,2,4,1,5] => [5,3,2,4,1] => 3
[1,1,1,0,0,1,0,1,0,0] => [3,2,4,5,1] => [3,2,4,5,1] => [1,3,2,4,5] => 0
[1,1,1,0,0,1,1,0,0,0] => [3,2,5,4,1] => [3,5,2,4,1] => [1,4,2,5,3] => 0
[1,1,1,0,1,0,0,0,1,0] => [3,4,2,1,5] => [3,4,2,1,5] => [5,4,2,3,1] => 3
[1,1,1,0,1,0,0,1,0,0] => [3,4,2,5,1] => [3,4,2,5,1] => [1,4,2,3,5] => 0
[1,1,1,0,1,0,1,0,0,0] => [3,4,5,2,1] => [3,4,5,2,1] => [1,5,2,3,4] => 0
[1,1,1,0,1,1,0,0,0,0] => [3,5,4,2,1] => [5,3,4,2,1] => [1,5,3,4,2] => 0
[1,1,1,1,0,0,0,0,1,0] => [4,3,2,1,5] => [4,3,2,1,5] => [5,4,3,2,1] => 4
[1,1,1,1,0,0,0,1,0,0] => [4,3,2,5,1] => [4,3,2,5,1] => [1,4,3,2,5] => 0
[1,1,1,1,0,0,1,0,0,0] => [4,3,5,2,1] => [4,3,5,2,1] => [1,5,3,2,4] => 0
[1,1,1,1,0,1,0,0,0,0] => [4,5,3,2,1] => [4,5,3,2,1] => [1,5,4,2,3] => 0
[1,1,1,1,1,0,0,0,0,0] => [5,4,3,2,1] => [5,4,3,2,1] => [1,5,4,3,2] => 0
[1,0,1,0,1,0,1,0,1,0,1,0] => [1,2,3,4,5,6] => [1,2,3,4,5,6] => [2,3,4,5,6,1] => 1
[1,0,1,0,1,0,1,0,1,1,0,0] => [1,2,3,4,6,5] => [6,1,2,3,4,5] => [3,4,5,6,1,2] => 1
[1,0,1,0,1,0,1,1,0,0,1,0] => [1,2,3,5,4,6] => [5,1,2,3,4,6] => [3,4,5,6,2,1] => 2
[1,0,1,0,1,0,1,1,0,1,0,0] => [1,2,3,5,6,4] => [5,6,1,2,3,4] => [4,5,6,1,2,3] => 1
[1,0,1,0,1,0,1,1,1,0,0,0] => [1,2,3,6,5,4] => [6,5,1,2,3,4] => [4,5,6,1,3,2] => 1
[1,0,1,0,1,1,0,0,1,0,1,0] => [1,2,4,3,5,6] => [4,1,2,3,5,6] => [3,4,5,2,6,1] => 2
[1,0,1,0,1,1,0,0,1,1,0,0] => [1,2,4,3,6,5] => [4,6,1,2,3,5] => [4,5,6,2,1,3] => 2
[1,0,1,0,1,1,0,1,0,0,1,0] => [1,2,4,5,3,6] => [4,5,1,2,3,6] => [4,5,6,2,3,1] => 2
[1,0,1,0,1,1,0,1,0,1,0,0] => [1,2,4,5,6,3] => [4,5,6,1,2,3] => [5,6,1,2,3,4] => 1
[1,0,1,0,1,1,0,1,1,0,0,0] => [1,2,4,6,5,3] => [6,4,5,1,2,3] => [5,6,1,3,4,2] => 1
[1,0,1,0,1,1,1,0,0,0,1,0] => [1,2,5,4,3,6] => [5,4,1,2,3,6] => [4,5,6,3,2,1] => 3
[1,0,1,0,1,1,1,0,0,1,0,0] => [1,2,5,4,6,3] => [5,4,6,1,2,3] => [5,6,1,3,2,4] => 1
[1,0,1,0,1,1,1,0,1,0,0,0] => [1,2,5,6,4,3] => [5,6,4,1,2,3] => [5,6,1,4,2,3] => 1
[1,0,1,0,1,1,1,1,0,0,0,0] => [1,2,6,5,4,3] => [6,5,4,1,2,3] => [5,6,1,4,3,2] => 1
[1,0,1,1,0,0,1,0,1,0,1,0] => [1,3,2,4,5,6] => [3,1,2,4,5,6] => [3,4,2,5,6,1] => 2
[1,0,1,1,0,0,1,0,1,1,0,0] => [1,3,2,4,6,5] => [3,6,1,2,4,5] => [4,5,2,6,1,3] => 2
[1,0,1,1,0,0,1,1,0,0,1,0] => [1,3,2,5,4,6] => [3,5,1,2,4,6] => [4,5,2,6,3,1] => 2
[1,0,1,1,0,0,1,1,0,1,0,0] => [1,3,2,5,6,4] => [3,5,6,1,2,4] => [5,6,2,1,3,4] => 2
[1,0,1,1,0,0,1,1,1,0,0,0] => [1,3,2,6,5,4] => [6,3,5,1,2,4] => [5,6,3,1,4,2] => 2
[1,0,1,1,0,1,0,0,1,0,1,0] => [1,3,4,2,5,6] => [3,4,1,2,5,6] => [4,5,2,3,6,1] => 2
[1,0,1,1,0,1,0,0,1,1,0,0] => [1,3,4,2,6,5] => [3,4,6,1,2,5] => [5,6,2,3,1,4] => 2
[1,0,1,1,0,1,0,1,0,0,1,0] => [1,3,4,5,2,6] => [3,4,5,1,2,6] => [5,6,2,3,4,1] => 2
[1,0,1,1,0,1,0,1,0,1,0,0] => [1,3,4,5,6,2] => [3,4,5,6,1,2] => [6,1,2,3,4,5] => 1
[1,0,1,1,0,1,0,1,1,0,0,0] => [1,3,4,6,5,2] => [6,3,4,5,1,2] => [6,1,3,4,5,2] => 1
[1,0,1,1,0,1,1,0,0,0,1,0] => [1,3,5,4,2,6] => [5,3,4,1,2,6] => [5,6,3,4,2,1] => 3
[1,0,1,1,0,1,1,0,0,1,0,0] => [1,3,5,4,6,2] => [5,3,4,6,1,2] => [6,1,3,4,2,5] => 1
[1,0,1,1,0,1,1,0,1,0,0,0] => [1,3,5,6,4,2] => [5,6,3,4,1,2] => [6,1,4,5,2,3] => 1
[1,0,1,1,0,1,1,1,0,0,0,0] => [1,3,6,5,4,2] => [6,5,3,4,1,2] => [6,1,4,5,3,2] => 1
[1,0,1,1,1,0,0,0,1,0,1,0] => [1,4,3,2,5,6] => [4,3,1,2,5,6] => [4,5,3,2,6,1] => 3
[1,0,1,1,1,0,0,0,1,1,0,0] => [1,4,3,2,6,5] => [4,3,6,1,2,5] => [5,6,3,2,1,4] => 3
[1,0,1,1,1,0,0,1,0,0,1,0] => [1,4,3,5,2,6] => [4,3,5,1,2,6] => [5,6,3,2,4,1] => 3
[1,0,1,1,1,0,0,1,0,1,0,0] => [1,4,3,5,6,2] => [4,3,5,6,1,2] => [6,1,3,2,4,5] => 1
[1,0,1,1,1,0,0,1,1,0,0,0] => [1,4,3,6,5,2] => [4,6,3,5,1,2] => [6,1,4,2,5,3] => 1
[1,0,1,1,1,0,1,0,0,0,1,0] => [1,4,5,3,2,6] => [4,5,3,1,2,6] => [5,6,4,2,3,1] => 3
[1,0,1,1,1,0,1,0,0,1,0,0] => [1,4,5,3,6,2] => [4,5,3,6,1,2] => [6,1,4,2,3,5] => 1
[1,0,1,1,1,0,1,0,1,0,0,0] => [1,4,5,6,3,2] => [4,5,6,3,1,2] => [6,1,5,2,3,4] => 1
[1,0,1,1,1,0,1,1,0,0,0,0] => [1,4,6,5,3,2] => [6,4,5,3,1,2] => [6,1,5,3,4,2] => 1
[1,0,1,1,1,1,0,0,0,0,1,0] => [1,5,4,3,2,6] => [5,4,3,1,2,6] => [5,6,4,3,2,1] => 4
>>> Load all 215 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 indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right.
For a permutation $\pi$ of length $n$, this is the number of indices $2 \leq j \leq n$ such that for all $1 \leq i < j$, the pair $(i,j)$ is an inversion of $\pi$.
For a permutation $\pi$ of length $n$, this is the number of indices $2 \leq j \leq n$ such that for all $1 \leq i < j$, the pair $(i,j)$ is an inversion of $\pi$.
Map
to 312-avoiding permutation
Description
Map
inverse Foata bijection
Description
The inverse of Foata's bijection.
See Mp00067Foata bijection.
See Mp00067Foata bijection.
Map
Kreweras complement
Description
Sends the permutation $\pi \in \mathfrak{S}_n$ to the permutation $\pi^{-1}c$ where $c = (1,\ldots,n)$ is the long cycle.
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!