Your data matches 17 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
St001216: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> 0
[1,0,1,0]
=> 1
[1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> 0
[1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> 2
[1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,1,0,0]
=> 0
[1,0,1,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,0]
=> 1
[1,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> 0
[1,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> 1
[1,1,0,1,1,0,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> 3
[1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> 2
Description
The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module.
Mp00129: Dyck paths to 321-avoiding permutation (Billey-Jockusch-Stanley)Permutations
Mp00127: Permutations left-to-right-maxima to Dyck pathDyck paths
St001189: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1,0]
=> 0
[1,0,1,0]
=> [2,1] => [1,1,0,0]
=> 1
[1,1,0,0]
=> [1,2] => [1,0,1,0]
=> 0
[1,0,1,0,1,0]
=> [2,3,1] => [1,1,0,1,0,0]
=> 0
[1,0,1,1,0,0]
=> [2,1,3] => [1,1,0,0,1,0]
=> 1
[1,1,0,0,1,0]
=> [1,3,2] => [1,0,1,1,0,0]
=> 1
[1,1,0,1,0,0]
=> [3,1,2] => [1,1,1,0,0,0]
=> 2
[1,1,1,0,0,0]
=> [1,2,3] => [1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> 0
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> 0
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> 3
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [1,1,0,1,0,1,0,1,0,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [1,1,0,1,0,1,0,0,1,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [1,1,0,1,0,0,1,1,0,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [1,1,0,1,0,1,1,0,0,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [1,1,0,1,0,0,1,0,1,0]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [1,1,0,0,1,1,0,1,0,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [1,1,0,1,1,0,0,1,0,0]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [1,1,0,1,1,0,1,0,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [1,1,0,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [1,1,0,0,1,1,1,0,0,0]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [1,1,0,1,1,1,0,0,0,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [1,1,1,0,0,1,0,1,0,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [1,1,1,0,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [1,1,1,0,1,0,0,1,0,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0]
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [1,1,1,0,0,0,1,1,0,0]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [1,1,1,0,0,1,1,0,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [1,1,1,0,1,1,0,0,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [1,1,1,0,0,0,1,0,1,0]
=> 2
Description
The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path.
Mp00129: Dyck paths to 321-avoiding permutation (Billey-Jockusch-Stanley)Permutations
Mp00239: Permutations CorteelPermutations
Mp00087: Permutations inverse first fundamental transformationPermutations
St000214: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [1] => 0
[1,0,1,0]
=> [2,1] => [2,1] => [2,1] => 1
[1,1,0,0]
=> [1,2] => [1,2] => [1,2] => 0
[1,0,1,0,1,0]
=> [2,3,1] => [3,2,1] => [2,3,1] => 0
[1,0,1,1,0,0]
=> [2,1,3] => [2,1,3] => [2,1,3] => 1
[1,1,0,0,1,0]
=> [1,3,2] => [1,3,2] => [1,3,2] => 1
[1,1,0,1,0,0]
=> [3,1,2] => [3,1,2] => [3,2,1] => 2
[1,1,1,0,0,0]
=> [1,2,3] => [1,2,3] => [1,2,3] => 0
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [4,2,3,1] => [2,3,4,1] => 0
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [3,2,1,4] => [2,3,1,4] => 0
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [2,1,4,3] => [2,1,4,3] => 2
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [4,2,1,3] => [2,4,3,1] => 1
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,4,3,2] => [1,3,4,2] => 0
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,3,2,4] => [1,3,2,4] => 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [4,1,3,2] => [3,4,2,1] => 1
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [4,3,2,1] => [3,2,4,1] => 1
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [3,1,2,4] => [3,2,1,4] => 2
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,2,4,3] => [1,2,4,3] => 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,4,2,3] => [1,4,3,2] => 2
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [4,1,2,3] => [4,3,2,1] => 3
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [5,2,3,4,1] => [2,3,4,5,1] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [4,2,3,1,5] => [2,3,4,1,5] => 0
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [3,2,1,5,4] => [2,3,1,5,4] => 1
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [5,2,3,1,4] => [2,3,5,4,1] => 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [3,2,1,4,5] => [2,3,1,4,5] => 0
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [2,1,5,4,3] => [2,1,4,5,3] => 1
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => [2,1,4,3,5] => 2
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [5,2,1,4,3] => [2,4,5,3,1] => 0
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [5,2,4,3,1] => [2,4,3,5,1] => 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [4,2,1,3,5] => [2,4,3,1,5] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => [2,1,3,5,4] => 2
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [2,1,5,3,4] => [2,1,5,4,3] => 3
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [5,2,1,3,4] => [2,5,4,3,1] => 2
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => [2,1,3,4,5] => 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [1,5,3,4,2] => [1,3,4,5,2] => 0
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [1,4,3,2,5] => [1,3,4,2,5] => 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => [1,3,2,5,4] => 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [1,5,3,2,4] => [1,3,5,4,2] => 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => [1,3,2,4,5] => 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [5,1,3,4,2] => [3,4,5,2,1] => 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [4,1,3,2,5] => [3,4,2,1,5] => 1
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [5,3,2,4,1] => [3,2,4,5,1] => 1
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [5,4,3,2,1] => [3,4,2,5,1] => 0
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [4,3,2,1,5] => [3,2,4,1,5] => 1
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [3,1,2,5,4] => [3,2,1,5,4] => 3
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [5,1,3,2,4] => [3,5,4,2,1] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [5,3,2,1,4] => [3,2,5,4,1] => 2
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [3,1,2,4,5] => [3,2,1,4,5] => 2
Description
The number of adjacencies of a permutation. An adjacency of a permutation $\pi$ is an index $i$ such that $\pi(i)-1 = \pi(i+1)$. Adjacencies are also known as ''small descents''. This can be also described as an occurrence of the bivincular pattern ([2,1], {((0,1),(1,0),(1,1),(1,2),(2,1)}), i.e., the middle row and the middle column are shaded, see [3].
Matching statistic: St000237
Mp00129: Dyck paths to 321-avoiding permutation (Billey-Jockusch-Stanley)Permutations
Mp00239: Permutations CorteelPermutations
Mp00066: Permutations inversePermutations
St000237: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [1] => 0
[1,0,1,0]
=> [2,1] => [2,1] => [2,1] => 1
[1,1,0,0]
=> [1,2] => [1,2] => [1,2] => 0
[1,0,1,0,1,0]
=> [2,3,1] => [3,2,1] => [3,2,1] => 0
[1,0,1,1,0,0]
=> [2,1,3] => [2,1,3] => [2,1,3] => 1
[1,1,0,0,1,0]
=> [1,3,2] => [1,3,2] => [1,3,2] => 1
[1,1,0,1,0,0]
=> [3,1,2] => [3,1,2] => [2,3,1] => 2
[1,1,1,0,0,0]
=> [1,2,3] => [1,2,3] => [1,2,3] => 0
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [4,2,3,1] => [4,2,3,1] => 0
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [3,2,1,4] => [3,2,1,4] => 0
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [2,1,4,3] => [2,1,4,3] => 2
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [4,2,1,3] => [3,2,4,1] => 1
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [2,1,3,4] => [2,1,3,4] => 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,4,3,2] => [1,4,3,2] => 0
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,3,2,4] => [1,3,2,4] => 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [4,1,3,2] => [2,4,3,1] => 1
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [4,3,2,1] => [4,3,2,1] => 1
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [3,1,2,4] => [2,3,1,4] => 2
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,2,4,3] => [1,2,4,3] => 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,4,2,3] => [1,3,4,2] => 2
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [4,1,2,3] => [2,3,4,1] => 3
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [5,2,3,4,1] => [5,2,3,4,1] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [4,2,3,1,5] => [4,2,3,1,5] => 0
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [3,2,1,5,4] => [3,2,1,5,4] => 1
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [5,2,3,1,4] => [4,2,3,5,1] => 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [3,2,1,4,5] => [3,2,1,4,5] => 0
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [2,1,5,4,3] => [2,1,5,4,3] => 1
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => [2,1,4,3,5] => 2
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [5,2,1,4,3] => [3,2,5,4,1] => 0
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [5,2,4,3,1] => [5,2,4,3,1] => 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [4,2,1,3,5] => [3,2,4,1,5] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => [2,1,3,5,4] => 2
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [2,1,5,3,4] => [2,1,4,5,3] => 3
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [5,2,1,3,4] => [3,2,4,5,1] => 2
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => [2,1,3,4,5] => 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [1,5,3,4,2] => [1,5,3,4,2] => 0
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [1,4,3,2,5] => [1,4,3,2,5] => 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => [1,3,2,5,4] => 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [1,5,3,2,4] => [1,4,3,5,2] => 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => [1,3,2,4,5] => 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [5,1,3,4,2] => [2,5,3,4,1] => 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [4,1,3,2,5] => [2,4,3,1,5] => 1
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [5,3,2,4,1] => [5,3,2,4,1] => 1
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [5,4,3,2,1] => [5,4,3,2,1] => 0
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [4,3,2,1,5] => [4,3,2,1,5] => 1
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [3,1,2,5,4] => [2,3,1,5,4] => 3
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [5,1,3,2,4] => [2,4,3,5,1] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [5,3,2,1,4] => [4,3,2,5,1] => 2
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [3,1,2,4,5] => [2,3,1,4,5] => 2
Description
The number of small exceedances. This is the number of indices $i$ such that $\pi_i=i+1$.
Matching statistic: St001067
Mp00129: Dyck paths to 321-avoiding permutation (Billey-Jockusch-Stanley)Permutations
Mp00127: Permutations left-to-right-maxima to Dyck pathDyck paths
Mp00032: Dyck paths inverse zeta mapDyck paths
St001067: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1,0]
=> [1,0]
=> 0
[1,0,1,0]
=> [2,1] => [1,1,0,0]
=> [1,0,1,0]
=> 1
[1,1,0,0]
=> [1,2] => [1,0,1,0]
=> [1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> [2,3,1] => [1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> 0
[1,0,1,1,0,0]
=> [2,1,3] => [1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [1,3,2] => [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 1
[1,1,0,1,0,0]
=> [3,1,2] => [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 2
[1,1,1,0,0,0]
=> [1,2,3] => [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 0
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 0
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 2
Description
The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra.
Matching statistic: St001223
Mp00129: Dyck paths to 321-avoiding permutation (Billey-Jockusch-Stanley)Permutations
Mp00127: Permutations left-to-right-maxima to Dyck pathDyck paths
Mp00032: Dyck paths inverse zeta mapDyck paths
St001223: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1,0]
=> [1,0]
=> 0
[1,0,1,0]
=> [2,1] => [1,1,0,0]
=> [1,0,1,0]
=> 1
[1,1,0,0]
=> [1,2] => [1,0,1,0]
=> [1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> [2,3,1] => [1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> 0
[1,0,1,1,0,0]
=> [2,1,3] => [1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [1,3,2] => [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 1
[1,1,0,1,0,0]
=> [3,1,2] => [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 2
[1,1,1,0,0,0]
=> [1,2,3] => [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 0
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 0
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 2
Description
Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless.
Matching statistic: St001483
Mp00199: Dyck paths prime Dyck pathDyck paths
Mp00120: Dyck paths Lalanne-Kreweras involutionDyck paths
Mp00222: Dyck paths peaks-to-valleysDyck paths
St001483: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1 = 0 + 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2 = 1 + 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 2 = 1 + 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2 = 1 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0,1,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0,1,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0]
=> 2 = 1 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0,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]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0,1,0]
=> [1,0,1,1,0,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
Description
The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module.
Matching statistic: St000502
Mp00129: Dyck paths to 321-avoiding permutation (Billey-Jockusch-Stanley)Permutations
Mp00239: Permutations CorteelPermutations
Mp00151: Permutations to cycle typeSet partitions
St000502: Set partitions ⟶ ℤResult quality: 99% values known / values provided: 99%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => {{1}}
=> ? = 0
[1,0,1,0]
=> [2,1] => [2,1] => {{1,2}}
=> 1
[1,1,0,0]
=> [1,2] => [1,2] => {{1},{2}}
=> 0
[1,0,1,0,1,0]
=> [2,3,1] => [3,2,1] => {{1,3},{2}}
=> 0
[1,0,1,1,0,0]
=> [2,1,3] => [2,1,3] => {{1,2},{3}}
=> 1
[1,1,0,0,1,0]
=> [1,3,2] => [1,3,2] => {{1},{2,3}}
=> 1
[1,1,0,1,0,0]
=> [3,1,2] => [3,1,2] => {{1,2,3}}
=> 2
[1,1,1,0,0,0]
=> [1,2,3] => [1,2,3] => {{1},{2},{3}}
=> 0
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [4,2,3,1] => {{1,4},{2},{3}}
=> 0
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [3,2,1,4] => {{1,3},{2},{4}}
=> 0
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [2,1,4,3] => {{1,2},{3,4}}
=> 2
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [4,2,1,3] => {{1,3,4},{2}}
=> 1
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [2,1,3,4] => {{1,2},{3},{4}}
=> 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,4,3,2] => {{1},{2,4},{3}}
=> 0
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,3,2,4] => {{1},{2,3},{4}}
=> 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [4,1,3,2] => {{1,2,4},{3}}
=> 1
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [4,3,2,1] => {{1,4},{2,3}}
=> 1
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [3,1,2,4] => {{1,2,3},{4}}
=> 2
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,2,4,3] => {{1},{2},{3,4}}
=> 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,4,2,3] => {{1},{2,3,4}}
=> 2
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [4,1,2,3] => {{1,2,3,4}}
=> 3
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,2,3,4] => {{1},{2},{3},{4}}
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [5,2,3,4,1] => {{1,5},{2},{3},{4}}
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [4,2,3,1,5] => {{1,4},{2},{3},{5}}
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [3,2,1,5,4] => {{1,3},{2},{4,5}}
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [5,2,3,1,4] => {{1,4,5},{2},{3}}
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [3,2,1,4,5] => {{1,3},{2},{4},{5}}
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [2,1,5,4,3] => {{1,2},{3,5},{4}}
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => {{1,2},{3,4},{5}}
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [5,2,1,4,3] => {{1,3,5},{2},{4}}
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [5,2,4,3,1] => {{1,5},{2},{3,4}}
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [4,2,1,3,5] => {{1,3,4},{2},{5}}
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => {{1,2},{3},{4,5}}
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [2,1,5,3,4] => {{1,2},{3,4,5}}
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [5,2,1,3,4] => {{1,3,4,5},{2}}
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => {{1,2},{3},{4},{5}}
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [1,5,3,4,2] => {{1},{2,5},{3},{4}}
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [1,4,3,2,5] => {{1},{2,4},{3},{5}}
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => {{1},{2,3},{4,5}}
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [1,5,3,2,4] => {{1},{2,4,5},{3}}
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => {{1},{2,3},{4},{5}}
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [5,1,3,4,2] => {{1,2,5},{3},{4}}
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [4,1,3,2,5] => {{1,2,4},{3},{5}}
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [5,3,2,4,1] => {{1,5},{2,3},{4}}
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [5,4,3,2,1] => {{1,5},{2,4},{3}}
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [4,3,2,1,5] => {{1,4},{2,3},{5}}
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [3,1,2,5,4] => {{1,2,3},{4,5}}
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [5,1,3,2,4] => {{1,2,4,5},{3}}
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [5,3,2,1,4] => {{1,4,5},{2,3}}
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [3,1,2,4,5] => {{1,2,3},{4},{5}}
=> 2
[1,1,1,0,0,0,1,0,1,0]
=> [1,2,4,5,3] => [1,2,5,4,3] => {{1},{2},{3,5},{4}}
=> 0
Description
The number of successions of a set partitions. This is the number of indices $i$ such that $i$ and $i+1$ belonging to the same block.
Matching statistic: St000932
Mp00129: Dyck paths to 321-avoiding permutation (Billey-Jockusch-Stanley)Permutations
Mp00127: Permutations left-to-right-maxima to Dyck pathDyck paths
Mp00032: Dyck paths inverse zeta mapDyck paths
St000932: Dyck paths ⟶ ℤResult quality: 99% values known / values provided: 99%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1,0]
=> [1,0]
=> ? = 0
[1,0,1,0]
=> [2,1] => [1,1,0,0]
=> [1,0,1,0]
=> 1
[1,1,0,0]
=> [1,2] => [1,0,1,0]
=> [1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> [2,3,1] => [1,1,0,1,0,0]
=> [1,1,0,0,1,0]
=> 0
[1,0,1,1,0,0]
=> [2,1,3] => [1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [1,3,2] => [1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> 1
[1,1,0,1,0,0]
=> [3,1,2] => [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 2
[1,1,1,0,0,0]
=> [1,2,3] => [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 0
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 0
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 1
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 2
[1,1,1,0,0,0,1,0,1,0]
=> [1,2,4,5,3] => [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 0
Description
The number of occurrences of the pattern UDU in a Dyck path. The number of Dyck paths with statistic value 0 are counted by the Motzkin numbers [1].
Matching statistic: St001061
Mp00129: Dyck paths to 321-avoiding permutation (Billey-Jockusch-Stanley)Permutations
Mp00127: Permutations left-to-right-maxima to Dyck pathDyck paths
Mp00031: Dyck paths to 312-avoiding permutationPermutations
St001061: Permutations ⟶ ℤResult quality: 99% values known / values provided: 99%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1,0]
=> [1] => ? = 0
[1,0,1,0]
=> [2,1] => [1,1,0,0]
=> [2,1] => 1
[1,1,0,0]
=> [1,2] => [1,0,1,0]
=> [1,2] => 0
[1,0,1,0,1,0]
=> [2,3,1] => [1,1,0,1,0,0]
=> [2,3,1] => 0
[1,0,1,1,0,0]
=> [2,1,3] => [1,1,0,0,1,0]
=> [2,1,3] => 1
[1,1,0,0,1,0]
=> [1,3,2] => [1,0,1,1,0,0]
=> [1,3,2] => 1
[1,1,0,1,0,0]
=> [3,1,2] => [1,1,1,0,0,0]
=> [3,2,1] => 2
[1,1,1,0,0,0]
=> [1,2,3] => [1,0,1,0,1,0]
=> [1,2,3] => 0
[1,0,1,0,1,0,1,0]
=> [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 0
[1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 0
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 2
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [1,1,0,1,1,0,0,0]
=> [2,4,3,1] => 1
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 1
[1,1,0,0,1,0,1,0]
=> [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 0
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 1
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 1
[1,1,0,1,0,1,0,0]
=> [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> [3,4,2,1] => 1
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 2
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 2
[1,1,1,0,1,0,0,0]
=> [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 3
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => [1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 0
[1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => [1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 0
[1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => 1
[1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => [1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 0
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => [1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 1
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 2
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => 0
[1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => [1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,3,1] => 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 2
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => 3
[1,0,1,1,1,0,1,0,0,0]
=> [2,5,1,3,4] => [1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => 2
[1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => [1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => [1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 0
[1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,4,5,2] => [1,1,1,0,0,1,0,1,0,0]
=> [3,2,4,5,1] => 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [1,1,1,0,0,1,0,0,1,0]
=> [3,2,4,1,5] => 1
[1,1,0,1,0,1,0,0,1,0]
=> [3,4,1,5,2] => [1,1,1,0,1,0,0,1,0,0]
=> [3,4,2,5,1] => 1
[1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => [1,1,1,0,1,0,1,0,0,0]
=> [3,4,5,2,1] => 0
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,1,2,5] => [1,1,1,0,1,0,0,0,1,0]
=> [3,4,2,1,5] => 1
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [1,1,1,0,0,0,1,1,0,0]
=> [3,2,1,5,4] => 3
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [1,1,1,0,0,1,1,0,0,0]
=> [3,2,5,4,1] => 2
[1,1,0,1,1,0,1,0,0,0]
=> [3,5,1,2,4] => [1,1,1,0,1,1,0,0,0,0]
=> [3,5,4,2,1] => 2
[1,1,0,1,1,1,0,0,0,0]
=> [3,1,2,4,5] => [1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => 2
[1,1,1,0,0,0,1,0,1,0]
=> [1,2,4,5,3] => [1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 0
Description
The number of indices that are both descents and recoils of a permutation.
The following 7 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000731The number of double exceedences of a permutation. St000366The number of double descents of a permutation. St000732The number of double deficiencies of a permutation. St000317The cycle descent number of a permutation. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001877Number of indecomposable injective modules with projective dimension 2.