Identifier
Values
[1] => [1,0] => [1,1,0,0] => [2,1] => 0
[2] => [1,0,1,0] => [1,1,0,1,0,0] => [2,3,1] => 0
[1,1] => [1,1,0,0] => [1,1,1,0,0,0] => [3,2,1] => 0
[3] => [1,0,1,0,1,0] => [1,1,0,1,0,1,0,0] => [2,3,4,1] => 0
[2,1] => [1,0,1,1,0,0] => [1,1,0,1,1,0,0,0] => [2,4,3,1] => 0
[1,1,1] => [1,1,0,1,0,0] => [1,1,1,0,1,0,0,0] => [4,2,3,1] => 0
[4] => [1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,0] => [2,3,4,5,1] => 0
[3,1] => [1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,1,0,0,0] => [2,3,5,4,1] => 0
[2,2] => [1,1,1,0,0,0] => [1,1,1,1,0,0,0,0] => [4,3,2,1] => 0
[2,1,1] => [1,0,1,1,0,1,0,0] => [1,1,0,1,1,0,1,0,0,0] => [2,5,3,4,1] => 0
[1,1,1,1] => [1,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,0,0] => [5,2,3,4,1] => 0
[5] => [1,0,1,0,1,0,1,0,1,0] => [1,1,0,1,0,1,0,1,0,1,0,0] => [2,3,4,5,6,1] => 0
[4,1] => [1,0,1,0,1,0,1,1,0,0] => [1,1,0,1,0,1,0,1,1,0,0,0] => [2,3,4,6,5,1] => 0
[3,2] => [1,0,1,1,1,0,0,0] => [1,1,0,1,1,1,0,0,0,0] => [2,5,4,3,1] => 0
[3,1,1] => [1,0,1,0,1,1,0,1,0,0] => [1,1,0,1,0,1,1,0,1,0,0,0] => [2,3,6,4,5,1] => 0
[2,2,1] => [1,1,1,0,0,1,0,0] => [1,1,1,1,0,0,1,0,0,0] => [5,3,2,4,1] => 0
[2,1,1,1] => [1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,1,0,1,0,1,0,0,0] => [2,6,3,4,5,1] => 0
[1,1,1,1,1] => [1,1,0,1,0,1,0,1,0,0] => [1,1,1,0,1,0,1,0,1,0,0,0] => [6,2,3,4,5,1] => 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] => [2,3,4,5,6,7,1] => 0
[4,2] => [1,0,1,0,1,1,1,0,0,0] => [1,1,0,1,0,1,1,1,0,0,0,0] => [2,3,6,5,4,1] => 0
[3,3] => [1,1,1,0,1,0,0,0] => [1,1,1,1,0,1,0,0,0,0] => [5,3,4,2,1] => 0
[3,2,1] => [1,0,1,1,1,0,0,1,0,0] => [1,1,0,1,1,1,0,0,1,0,0,0] => [2,6,4,3,5,1] => 1
[2,2,2] => [1,1,1,1,0,0,0,0] => [1,1,1,1,1,0,0,0,0,0] => [5,4,3,2,1] => 0
[2,2,1,1] => [1,1,1,0,0,1,0,1,0,0] => [1,1,1,1,0,0,1,0,1,0,0,0] => [6,3,2,4,5,1] => 0
[7] => [1,0,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,1,0,0] => [2,3,4,5,6,7,8,1] => 0
[4,3] => [1,0,1,1,1,0,1,0,0,0] => [1,1,0,1,1,1,0,1,0,0,0,0] => [2,6,4,5,3,1] => 0
[4,1,1,1] => [1,0,1,0,1,0,1,1,0,1,0,1,0,0] => [1,1,0,1,0,1,0,1,1,0,1,0,1,0,0,0] => [2,3,4,8,5,6,7,1] => 0
[3,3,1] => [1,1,1,0,1,0,0,1,0,0] => [1,1,1,1,0,1,0,0,1,0,0,0] => [6,3,4,2,5,1] => 0
[3,2,2] => [1,0,1,1,1,1,0,0,0,0] => [1,1,0,1,1,1,1,0,0,0,0,0] => [2,6,5,4,3,1] => 0
[2,2,2,1] => [1,1,1,1,0,0,0,1,0,0] => [1,1,1,1,1,0,0,0,1,0,0,0] => [6,4,3,2,5,1] => 0
[8] => [1,0,1,0,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,1,0,1,0,0] => [2,3,4,5,6,7,8,9,1] => 0
[4,4] => [1,1,1,0,1,0,1,0,0,0] => [1,1,1,1,0,1,0,1,0,0,0,0] => [6,3,4,5,2,1] => 0
[3,3,2] => [1,1,1,0,1,1,0,0,0,0] => [1,1,1,1,0,1,1,0,0,0,0,0] => [6,3,5,4,2,1] => 0
[2,2,2,2] => [1,1,1,1,0,1,0,0,0,0] => [1,1,1,1,1,0,1,0,0,0,0,0] => [6,5,3,4,2,1] => 0
[9] => [1,0,1,0,1,0,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,1,0,1,0,1,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,1,1,1,1,1,0,0,0,0,0,0] => [6,5,4,3,2,1] => 0
[10] => [1,0,1,0,1,0,1,0,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,1,0,1,0,1,0,1,0,0] => [2,3,4,5,6,7,8,9,10,11,1] => 0
[3,3,3,3] => [1,1,1,1,1,1,0,0,0,0,0,0] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [7,6,5,4,3,2,1] => 0
[4,4,4,4] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0] => [8,7,6,5,4,3,2,1] => 0
[] => [] => [1,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,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0] => [9,8,7,6,5,4,3,2,1] => 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,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0] => [10,9,8,7,6,5,4,3,2,1] => 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 occurrences of the pattern 1324 in a permutation.
There is no explicit formula known for the number of permutations avoiding this pattern (denoted by $S_n(1324)$), but it is shown in [1], improving bounds in [2] and [3] that
$$\lim_{n \rightarrow \infty} \sqrt[n]{S_n(1324)} \leq 13.73718.$$
Map
to non-crossing permutation
Description
Sends a Dyck path $D$ with valley at positions $\{(i_1,j_1),\ldots,(i_k,j_k)\}$ to the unique non-crossing permutation $\pi$ having descents $\{i_1,\ldots,i_k\}$ and whose inverse has descents $\{j_1,\ldots,j_k\}$.
It sends the area St000012The area of a Dyck path. to the number of inversions St000018The number of inversions of a permutation. and the major index St000027The major index of a Dyck path. to $n(n-1)$ minus the sum of the major index St000004The major index of a permutation. and the inverse major index St000305The inverse major index 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
prime Dyck path
Description
Return the Dyck path obtained by adding an initial up and a final down step.