Your data matches 618 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000340
(load all 4 compositions to match this statistic)
Mapping
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00099: Dyck paths —bounce path⟶ Dyck paths
St000340: 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,1,0,0]
 => 1
[1,0,1,0]
 => [1,1,0,1,0,0]
 => [1,0,1,1,0,0]
 => 1
[1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => 3
[1,1,0,0,1,0]
 => [1,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => 3
[1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => 3
[1,0,1,1,0,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => 3
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => 5
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => 5
[1,1,0,0,1,0,1,0,1,0]
 => [1,1,1,0,0,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => 5
[1,1,0,0,1,1,0,0,1,0]
 => [1,1,1,0,0,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => 5
[]
 => [1,0]
 => [1,0]
 => 0
Description
The number of non-final maximal constant sub-paths of length greater than one. This is the total number of occurrences of the patterns $110$ and $001$.
Matching statistic: St000053
(load all 2 compositions to match this statistic)
Mapping
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00296: Dyck paths —Knuth-Krattenthaler⟶ Dyck paths
St000053: 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,1,0,0]
 => [1,0,1,0]
 => 1
[1,0,1,0]
 => [1,1,0,1,0,0]
 => [1,0,1,1,0,0]
 => [1,1,0,1,0,0]
 => 1
[1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0]
 => 3
[1,1,0,0,1,0]
 => [1,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0]
 => 3
[1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 3
[1,0,1,1,0,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 3
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0,1,0,1,0]
 => 5
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0,1,0,1,0]
 => 5
[1,1,0,0,1,0,1,0,1,0]
 => [1,1,1,0,0,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0,1,0,1,0]
 => 5
[1,1,0,0,1,1,0,0,1,0]
 => [1,1,1,0,0,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0,1,0,1,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
 => 5
[]
 => [1,0]
 => [1,0]
 => [1,0]
 => 0
Description
The number of valleys of the Dyck path.
Matching statistic: St000271
(load all 2 compositions to match this statistic)
Mapping
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
Mp00159: Permutations —Demazure product with inverse⟶ Permutations
Mp00160: Permutations —graph of inversions⟶ Graphs
St000271: Graphs ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
 => [1] => [1] => ([],1)
 => 1
[1,0,1,0]
 => [2,1] => [2,1] => ([(0,1)],2)
 => 1
[1,0,1,0,1,0]
 => [3,2,1] => [3,2,1] => ([(0,1),(0,2),(1,2)],3)
 => 3
[1,1,0,0,1,0]
 => [3,1,2] => [3,2,1] => ([(0,1),(0,2),(1,2)],3)
 => 3
[1,0,1,0,1,0,1,0]
 => [4,3,2,1] => [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3
[1,0,1,1,0,0,1,0]
 => [4,2,3,1] => [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
 => 3
[1,0,1,0,1,0,1,0,1,0]
 => [5,4,3,2,1] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
[1,0,1,0,1,1,0,0,1,0]
 => [5,3,4,2,1] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
[1,1,0,0,1,0,1,0,1,0]
 => [5,4,3,1,2] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
[1,1,0,0,1,1,0,0,1,0]
 => [5,3,4,1,2] => [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
 => 5
[1,0,1,0,1,0,1,0,1,0,1,0]
 => [6,5,4,3,2,1] => [6,5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 5
[1,0,1,0,1,0,1,1,0,0,1,0]
 => [6,4,5,3,2,1] => [6,5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 5
[1,0,1,1,0,0,1,0,1,0,1,0]
 => [6,5,4,2,3,1] => [6,5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 5
[1,0,1,1,0,0,1,1,0,0,1,0]
 => [6,4,5,2,3,1] => [6,5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(1,2),(1,3),(1,4),(1,5),(2,3),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
 => 5
[]
 => [] => [] => ([],0)
 => 0
Description
The chromatic index of a graph. This is the minimal number of colours needed such that no two adjacent edges have the same colour.
Matching statistic: St000645
(load all 4 compositions to match this statistic)
Mapping
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St000645: 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,1,0,0]
 => [1,0,1,0]
 => 1
[1,0,1,0]
 => [1,1,0,1,0,0]
 => [1,0,1,1,0,0]
 => [1,1,0,1,0,0]
 => 1
[1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,0,1,0]
 => 3
[1,1,0,0,1,0]
 => [1,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,0,1,0]
 => 3
[1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,1,1,0,1,0,0,1,0,0]
 => 3
[1,0,1,1,0,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,1,1,0,1,0,0,1,0,0]
 => 3
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,1,0,1,0,0,1,0,0,1,0]
 => 5
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,1,0,1,0,0,1,0,0,1,0]
 => 5
[1,1,0,0,1,0,1,0,1,0]
 => [1,1,1,0,0,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,1,0,1,0,0,1,0,0,1,0]
 => 5
[1,1,0,0,1,1,0,0,1,0]
 => [1,1,1,0,0,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,1,0,1,0,0,1,0,0,1,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,1,1,0,1,0,0,1,0,0,1,0,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,1,1,0,1,0,0,1,0,0,1,0,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,1,1,0,1,0,0,1,0,0,1,0,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,1,1,0,1,0,0,1,0,0,1,0,0]
 => 5
[]
 => [1,0]
 => [1,0]
 => [1,0]
 => 0
Description
The sum of the areas of the rectangles formed by two consecutive peaks and the valley in between. For a Dyck path $D = D_1 \cdots D_{2n}$ with peaks in positions $i_1 < \ldots < i_k$ and valleys in positions $j_1 < \ldots < j_{k-1}$, this statistic is given by $$ \sum_{a=1}^{k-1} (j_a-i_a)(i_{a+1}-j_a) $$
Matching statistic: St000868
(load all 3 compositions to match this statistic)
Mapping
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000868: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
 => [1,1,0,0]
 => [1,1,0,0]
 => [2,1] => 1
[1,0,1,0]
 => [1,1,0,1,0,0]
 => [1,0,1,1,0,0]
 => [1,3,2] => 1
[1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => [2,1,4,3] => 3
[1,1,0,0,1,0]
 => [1,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => [2,1,4,3] => 3
[1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,3,2,5,4] => 3
[1,0,1,1,0,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,3,2,5,4] => 3
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [2,1,4,3,6,5] => 5
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [2,1,4,3,6,5] => 5
[1,1,0,0,1,0,1,0,1,0]
 => [1,1,1,0,0,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [2,1,4,3,6,5] => 5
[1,1,0,0,1,1,0,0,1,0]
 => [1,1,1,0,0,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [2,1,4,3,6,5] => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,3,2,5,4,7,6] => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,3,2,5,4,7,6] => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,3,2,5,4,7,6] => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,3,2,5,4,7,6] => 5
[]
 => [1,0]
 => [1,0]
 => [1] => 0
Description
The aid statistic in the sense of Shareshian-Wachs. This is the number of admissible inversions [[St000866]] plus the number of descents [[St000021]]. This statistic was introduced by John Shareshian and Michelle L. Wachs in [1]. Theorem 4.1 states that the aid statistic together with the descent statistic is Euler-Mahonian.
Matching statistic: St001027
(load all 3 compositions to match this statistic)
Mapping
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St001027: 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,1,0,0]
 => [1,0,1,0]
 => 1
[1,0,1,0]
 => [1,1,0,1,0,0]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 1
[1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => 3
[1,1,0,0,1,0]
 => [1,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => 3
[1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0,1,0]
 => 3
[1,0,1,1,0,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0,1,0]
 => 3
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0,1,0]
 => 5
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0,1,0]
 => 5
[1,1,0,0,1,0,1,0,1,0]
 => [1,1,1,0,0,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0,1,0]
 => 5
[1,1,0,0,1,1,0,0,1,0]
 => [1,1,1,0,0,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0,1,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0,1,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0,1,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0,1,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0,1,0]
 => 5
[]
 => [1,0]
 => [1,0]
 => [1,0]
 => 0
Description
Number of simple modules with projective dimension equal to injective dimension in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001067
(load all 2 compositions to match this statistic)
Mapping
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00296: Dyck paths —Knuth-Krattenthaler⟶ Dyck 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,0]
 => [1,1,0,0]
 => [1,0,1,0]
 => 1
[1,0,1,0]
 => [1,1,0,1,0,0]
 => [1,0,1,1,0,0]
 => [1,1,0,1,0,0]
 => 1
[1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0]
 => 3
[1,1,0,0,1,0]
 => [1,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0]
 => 3
[1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 3
[1,0,1,1,0,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 3
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0,1,0,1,0]
 => 5
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0,1,0,1,0]
 => 5
[1,1,0,0,1,0,1,0,1,0]
 => [1,1,1,0,0,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0,1,0,1,0]
 => 5
[1,1,0,0,1,1,0,0,1,0]
 => [1,1,1,0,0,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0,1,0,1,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
 => 5
[]
 => [1,0]
 => [1,0]
 => [1,0]
 => 0
Description
The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra.
Matching statistic: St001232
(load all 187 compositions to match this statistic)
Mapping
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St001232: 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,1,0,0]
 => [1,0,1,0]
 => 1
[1,0,1,0]
 => [1,1,0,1,0,0]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 1
[1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => 3
[1,1,0,0,1,0]
 => [1,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => 3
[1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0,1,0]
 => 3
[1,0,1,1,0,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0,1,0]
 => 3
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0,1,0]
 => 5
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0,1,0]
 => 5
[1,1,0,0,1,0,1,0,1,0]
 => [1,1,1,0,0,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0,1,0]
 => 5
[1,1,0,0,1,1,0,0,1,0]
 => [1,1,1,0,0,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0,1,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0,1,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0,1,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0,1,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0,1,0]
 => 5
[]
 => [1,0]
 => [1,0]
 => [1,0]
 => 0
Description
The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2.
Matching statistic: St001506
(load all 2 compositions to match this statistic)
Mapping
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00296: Dyck paths —Knuth-Krattenthaler⟶ Dyck paths
St001506: 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,1,0,0]
 => [1,0,1,0]
 => 1
[1,0,1,0]
 => [1,1,0,1,0,0]
 => [1,0,1,1,0,0]
 => [1,1,0,1,0,0]
 => 1
[1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0]
 => 3
[1,1,0,0,1,0]
 => [1,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0]
 => 3
[1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 3
[1,0,1,1,0,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 3
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0,1,0,1,0]
 => 5
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0,1,0,1,0]
 => 5
[1,1,0,0,1,0,1,0,1,0]
 => [1,1,1,0,0,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0,1,0,1,0]
 => 5
[1,1,0,0,1,1,0,0,1,0]
 => [1,1,1,0,0,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0,1,0,1,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
 => 5
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
 => 5
[]
 => [1,0]
 => [1,0]
 => [1,0]
 => 0
Description
Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra.
Matching statistic: St000617
(load all 2 compositions to match this statistic)
Mapping
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00099: Dyck paths —bounce path⟶ Dyck paths
Mp00296: Dyck paths —Knuth-Krattenthaler⟶ Dyck paths
St000617: 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,1,0,0]
 => [1,0,1,0]
 => 2 = 1 + 1
[1,0,1,0]
 => [1,1,0,1,0,0]
 => [1,0,1,1,0,0]
 => [1,1,0,1,0,0]
 => 2 = 1 + 1
[1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0]
 => 4 = 3 + 1
[1,1,0,0,1,0]
 => [1,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0]
 => 4 = 3 + 1
[1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 4 = 3 + 1
[1,0,1,1,0,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => [1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 4 = 3 + 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,0,0,1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0,1,0,1,0]
 => 6 = 5 + 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,0,0,1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0,1,0,1,0]
 => 6 = 5 + 1
[1,1,0,0,1,0,1,0,1,0]
 => [1,1,1,0,0,1,0,1,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0,1,0,1,0]
 => 6 = 5 + 1
[1,1,0,0,1,1,0,0,1,0]
 => [1,1,1,0,0,1,1,0,0,1,0,0]
 => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,0,1,0,1,0,1,0,1,0,1,0]
 => 6 = 5 + 1
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
 => 6 = 5 + 1
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
 => 6 = 5 + 1
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
 => 6 = 5 + 1
[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]
 => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
 => 6 = 5 + 1
[]
 => [1,0]
 => [1,0]
 => [1,0]
 => 1 = 0 + 1
Description
The number of global maxima of a Dyck path.
The following 608 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001733The number of weak left to right maxima of a Dyck path. St000998Number of indecomposable projective modules with injective dimension smaller than or equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001166Number of indecomposable projective non-injective modules with dominant dimension equal to the global dimension plus the number of indecomposable projective injective modules in the corresponding Nakayama algebra. St001504The sum of all indegrees of vertices with indegree at least two in the resolution quiver of a Nakayama algebra corresponding to the Dyck path. St000240The number of indices that are not small excedances. St000740The last entry of a permutation. St001136The largest label with larger sister in the leaf labelled binary unordered tree associated with the perfect matching. St001182Number of indecomposable injective modules with codominant dimension at least two in the corresponding Nakayama algebra. St001255The vector space dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001473The absolute value of the sum of all entries of the Coxeter matrix of the corresponding LNakayama algebra. St001497The position of the largest weak excedence of a permutation. St001500The global dimension of magnitude 1 Nakayama algebras. St001872The number of indecomposable injective modules with even projective dimension in the corresponding Nakayama algebra. St000235The number of indices that are not cyclical small weak excedances. St000995The largest even part of an integer partition. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St000013The height of a Dyck path. St000015The number of peaks of a Dyck path. St000025The number of initial rises of a Dyck path. St000026The position of the first return of a Dyck path. St000054The first entry of the permutation. St000443The number of long tunnels of a Dyck path. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000501The size of the first part in the decomposition of a permutation. St000626The minimal period of a binary word. St000638The number of up-down runs of a permutation. St000737The last entry on the main diagonal of a semistandard tableau. St000932The number of occurrences of the pattern UDU in a Dyck path. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001014Number of indecomposable injective modules with codominant dimension equal to the dominant dimension of the Nakayama algebra corresponding to the Dyck path. St001015Number of indecomposable injective modules with codominant dimension equal to one in the Nakayama algebra corresponding to the Dyck path. St001016Number of indecomposable injective modules with codominant dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001297The number of indecomposable non-injective projective modules minus the number of indecomposable non-injective projective modules that have reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001373The logarithm of the number of winning configurations of the lights out game on a graph. St001481The minimal height of a peak of a Dyck path. St001809The index of the step at the first peak of maximal height in a Dyck path. St000010The length of the partition. St000019The cardinality of the support of a permutation. St000024The number of double up and double down steps of a Dyck path. St000029The depth of a permutation. St000141The maximum drop size of a permutation. St000209Maximum difference of elements in cycles. St000210Minimum over maximum difference of elements in cycles. St000224The sorting index of a permutation. St000316The number of non-left-to-right-maxima of a permutation. St000331The number of upper interactions of a Dyck path. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000439The position of the first down step of a Dyck path. St000673The number of non-fixed points of a permutation. St000678The number of up steps after the last double rise of a Dyck path. St000784The maximum of the length and the largest part of the integer partition. St000824The sum of the number of descents and the number of recoils of a permutation. St000828The spearman's rho of a permutation and the identity permutation. St000830The total displacement of a permutation. St000953The largest degree of an irreducible factor of the Coxeter polynomial of the Dyck path over the rational numbers. St001005The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001161The major index north count of a Dyck path. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001211The number of simple modules in the corresponding Nakayama algebra that have vanishing second Ext-group with the regular module. St001223Number 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. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001248Sum of the even parts of a partition. St001279The sum of the parts of an integer partition that are at least two. St001287The number of primes obtained by multiplying preimage and image of a permutation and subtracting one. St001458The rank of the adjacency matrix of a graph. St001492The number of simple modules that do not appear in the socle of the regular module or have no nontrivial selfextensions with the regular module in the corresponding Nakayama algebra. St001502The global dimension minus the dominant dimension of magnitude 1 Nakayama algebras. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001726The number of visible inversions of a permutation. St000727The largest label of a leaf in the binary search tree associated with the permutation. St000444The length of the maximal rise of a Dyck path. St000675The number of centered multitunnels of a Dyck path. St000844The size of the largest block in the direct sum decomposition of a permutation. St000874The position of the last double rise in a Dyck path. St000216The absolute length of a permutation. St000438The position of the last up step in a Dyck path. St000442The maximal area to the right of an up step of a Dyck path. St000539The number of odd inversions of a permutation. St000625The sum of the minimal distances to a greater element. St000653The last descent of a permutation. St000796The stat' of a permutation. St000817The sum of the entries in the column specified by the composition of the change of basis matrix from dual immaculate quasisymmetric functions to monomial quasisymmetric functions. St000831The number of indices that are either descents or recoils. St000956The maximal displacement of a permutation. St000957The number of Bruhat lower covers of a permutation. St001480The number of simple summands of the module J^2/J^3. St000462The major index minus the number of excedences of a permutation. St000064The number of one-box pattern of a permutation. St000706The product of the factorials of the multiplicities of an integer partition. St000896The number of zeros on the main diagonal of an alternating sign matrix. St000060The greater neighbor of the maximum. St000677The standardized bi-alternating inversion number of a permutation. St000781The number of proper colouring schemes of a Ferrers diagram. St001415The length of the longest palindromic prefix of a binary word. St001416The length of a longest palindromic factor of a binary word. St001417The length of a longest palindromic subword of a binary word. St000225Difference between largest and smallest parts in a partition. St000837The number of ascents of distance 2 of a permutation. St000963The 2-shifted major index of a permutation. St001557The number of inversions of the second entry of a permutation. St000238The number of indices that are not small weak excedances. St001090The number of pop-stack-sorts needed to sort a permutation. St001958The degree of the polynomial interpolating the values of a permutation. St000144The pyramid weight of the Dyck path. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001439The number of even weak deficiencies and of odd weak exceedences. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St001280The number of parts of an integer partition that are at least two. St001703The villainy of a graph. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St000288The number of ones in a binary word. St000311The number of vertices of odd degree in a graph. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001424The number of distinct squares in a binary word. St001002Number of indecomposable modules with projective and injective dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001254The vector space dimension of the first extension-group between A/soc(A) and J when A is the corresponding Nakayama algebra with Jacobson radical J. St000500Eigenvalues of the random-to-random operator acting on the regular representation. St000885The number of critical steps in the Catalan decomposition of a binary word. St001817The number of flag weak exceedances of a signed permutation. St001892The flag excedance statistic of a signed permutation. St000264The girth of a graph, which is not a tree. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St000993The multiplicity of the largest part of an integer partition. St000929The constant term of the character polynomial of an integer partition. St000483The number of times a permutation switches from increasing to decreasing or decreasing to increasing. St001684The reduced word complexity of a permutation. St000033The number of permutations greater than or equal to the given permutation in (strong) Bruhat order. St000292The number of ascents of a binary word. St000402Half the size of the symmetry class of a permutation. St000545The number of parabolic double cosets with minimal element being the given permutation. St001893The flag descent of a signed permutation. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001711The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. St000390The number of runs of ones in a binary word. St000691The number of changes of a binary word. St000829The Ulam distance of a permutation to the identity permutation. St000291The number of descents of a binary word. St000676The number of odd rises of a Dyck path. St000921The number of internal inversions of a binary word. St000922The minimal number such that all substrings of this length are unique. St001032The number of horizontal steps in the bicoloured Motzkin path associated with the Dyck path. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001200The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001423The number of distinct cubes in a binary word. St001498The normalised height of a Nakayama algebra with magnitude 1. St001524The degree of symmetry of a binary word. St001569The maximal modular displacement of a permutation. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St000526The number of posets with combinatorially isomorphic order polytopes. St000524The number of posets with the same order polynomial. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St001171The vector space dimension of $Ext_A^1(I_o,A)$ when $I_o$ is the tilting module corresponding to the permutation $o$ in the Auslander algebra $A$ of $K[x]/(x^n)$. St001420Half the length of a longest factor which is its own reverse-complement of a binary word. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001823The Stasinski-Voll length of a signed permutation. St000356The number of occurrences of the pattern 13-2. St001115The number of even descents of a permutation. St001207The Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St000357The number of occurrences of the pattern 12-3. St000365The number of double ascents of a permutation. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St000561The number of occurrences of the pattern {{1,2,3}} in a set partition. St000593The number of occurrences of the pattern {{1},{2},{3}} such that 1,2 are minimal. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St001288The number of primes obtained by multiplying preimage and image of a permutation and adding one. St001565The number of arithmetic progressions of length 2 in a permutation. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St000937The number of positive values of the symmetric group character corresponding to the partition. St001568The smallest positive integer that does not appear twice in the partition. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000928The sum of the coefficients of the character polynomial of an integer partition. St000941The number of characters of the symmetric group whose value on the partition is even. St000478Another weight of a partition according to Alladi. St000713The dimension of the irreducible representation of Sp(4) labelled by an integer partition. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000934The 2-degree of an integer partition. St000021The number of descents of a permutation. St000213The number of weak exceedances (also weak excedences) of a permutation. St000245The number of ascents of a permutation. St000255The number of reduced Kogan faces with the permutation as type. St000454The largest eigenvalue of a graph if it is integral. St000472The sum of the ascent bottoms of a permutation. St000490The intertwining number of a set partition. St000662The staircase size of the code of a permutation. St000672The number of minimal elements in Bruhat order not less than the permutation. St000832The number of permutations obtained by reversing blocks of three consecutive numbers. St000864The number of circled entries of the shifted recording tableau of a permutation. St000880The number of connected components of long braid edges in the graph of braid moves of a permutation. St000978The sum of the positions of double down-steps of a Dyck path. St001051The depth of the label 1 in the decreasing labelled unordered tree associated with the set partition. St001246The maximal difference between two consecutive entries of a permutation. St001272The number of graphs with the same degree sequence. St001298The number of repeated entries in the Lehmer code of a permutation. St001346The number of parking functions that give the same permutation. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001517The length of a longest pair of twins in a permutation. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001564The value of the forgotten symmetric functions when all variables set to 1. St001570The minimal number of edges to add to make a graph Hamiltonian. St001591The number of graphs with the given composition of multiplicities of Laplacian eigenvalues. St001641The number of ascent tops in the flattened set partition such that all smaller elements appear before. St001667The maximal size of a pair of weak twins for a permutation. St001722The number of minimal chains with small intervals between a binary word and the top element. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St001801Half the number of preimage-image pairs of different parity in a permutation. St001943The sum of the squares of the hook lengths of an integer partition. St000007The number of saliances of the permutation. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St000039The number of crossings of a permutation. St000043The number of crossings plus two-nestings of a perfect matching. St000220The number of occurrences of the pattern 132 in a permutation. St000223The number of nestings in the permutation. St000248The number of anti-singletons of a set partition. St000250The number of blocks (St000105) plus the number of antisingletons (St000248) of a set partition. St000284The Plancherel distribution on integer partitions. St000325The width of the tree associated to a permutation. St000355The number of occurrences of the pattern 21-3. St000360The number of occurrences of the pattern 32-1. St000367The number of simsun double descents of a permutation. St000371The number of mid points of decreasing subsequences of length 3 in a permutation. St000401The size of the symmetry class of a permutation. St000404The number of occurrences of the pattern 3241 or of the pattern 4231 in a permutation. St000405The number of occurrences of the pattern 1324 in a permutation. St000418The number of Dyck paths that are weakly below a Dyck path. St000422The energy of a graph, if it is integral. St000424The number of occurrences of the pattern 132 or of the pattern 231 in a permutation. St000426The number of occurrences of the pattern 132 or of the pattern 312 in a permutation. St000428The number of occurrences of the pattern 123 or of the pattern 213 in a permutation. St000429The number of occurrences of the pattern 123 or of the pattern 321 in a permutation. St000430The number of occurrences of the pattern 123 or of the pattern 312 in a permutation. St000433The number of occurrences of the pattern 132 or of the pattern 321 in a permutation. St000436The number of occurrences of the pattern 231 or of the pattern 321 in a permutation. St000440The number of occurrences of the pattern 4132 or of the pattern 4231 in a permutation. St000470The number of runs in a permutation. St000486The number of cycles of length at least 3 of a permutation. St000498The lcs statistic of a set partition. St000502The number of successions of a set partitions. St000538The number of even inversions of a permutation. St000556The number of occurrences of the pattern {{1},{2,3}} in a set partition. St000559The number of occurrences of the pattern {{1,3},{2,4}} in a set partition. St000562The number of internal points of a set partition. St000581The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 2 is maximal. St000597The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, (2,3) are consecutive in a block. St000599The number of occurrences of the pattern {{1},{2,3}} such that (2,3) are consecutive in a block. St000600The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, (1,3) are consecutive in a block. St000603The number of occurrences of the pattern {{1},{2},{3}} such that 2,3 are minimal. St000604The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 2 is maximal. St000605The number of occurrences of the pattern {{1},{2,3}} such that 3 is maximal, (2,3) are consecutive in a block. St000608The number of occurrences of the pattern {{1},{2},{3}} such that 1,2 are minimal, 3 is maximal. St000610The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal. St000612The number of occurrences of the pattern {{1},{2,3}} such that 1 is minimal, (2,3) are consecutive in a block. St000624The normalized sum of the minimal distances to a greater element. St000646The number of big ascents of a permutation. St000649The number of 3-excedences of a permutation. St000651The maximal size of a rise in a permutation. St000702The number of weak deficiencies of a permutation. St000707The product of the factorials of the parts. St000710The number of big deficiencies of a permutation. St000717The number of ordinal summands of a poset. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000751The number of occurrences of either of the pattern 2143 or 2143 in a permutation. St000779The tier of a permutation. St000799The number of occurrences of the vincular pattern |213 in a permutation. St000836The number of descents of distance 2 of a permutation. St000871The number of very big ascents of a permutation. St000872The number of very big descents of a permutation. St000881The number of short braid edges in the graph of braid moves of a permutation. St000927The alternating sum of the coefficients of the character polynomial of an integer partition. St000981The length of the longest zigzag subpath. St001026The maximum of the projective dimensions of the indecomposable non-projective injective modules minus the minimum in the Nakayama algebra corresponding to the Dyck path. St001058The breadth of the ordered tree. St001061The number of indices that are both descents and recoils of a permutation. St001082The number of boxed occurrences of 123 in a permutation. St001083The number of boxed occurrences of 132 in a permutation. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001160The number of proper blocks (or intervals) of a permutations. St001285The number of primes in the column sums of the two line notation of a permutation. St001513The number of nested exceedences of a permutation. St001516The number of cyclic bonds of a permutation. St001529The number of monomials in the expansion of the nabla operator applied to the power-sum symmetric function indexed by the partition. St001531Number of partial orders contained in the poset determined by the Dyck path. St001535The number of cyclic alignments of a permutation. St001536The number of cyclic misalignments of a permutation. St001561The value of the elementary symmetric function evaluated at 1. St001562The value of the complete homogeneous symmetric function evaluated at 1. St001563The value of the power-sum symmetric function evaluated at 1. St001566The length of the longest arithmetic progression in a permutation. St001575The minimal number of edges to add or remove to make a graph edge transitive. St001610The number of coloured endofunctions such that the multiplicities of colours are given by a partition. St001626The number of maximal proper sublattices of a lattice. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001689The number of celebrities in a graph. St001727The number of invisible inversions of a permutation. St001778The largest greatest common divisor of an element and its image in a permutation. St001857The number of edges in the reduced word graph of a signed permutation. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001883The mutual visibility number of a graph. St001959The product of the heights of the peaks of a Dyck path. St000037The sign of a permutation. St000253The crossing number of a set partition. St000254The nesting number of a set partition. St000421The number of Dyck paths that are weakly below a Dyck path, except for the path itself. St000487The length of the shortest cycle of a permutation. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000567The sum of the products of all pairs of parts. St000570The Edelman-Greene number of a permutation. St000652The maximal difference between successive positions of a permutation. St000668The least common multiple of the parts of the partition. St000695The number of blocks in the first part of the atomic decomposition of a set partition. St000708The product of the parts of an integer partition. St000729The minimal arc length of a set partition. St000730The maximal arc length of a set partition. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000815The number of semistandard Young tableaux of partition weight of given shape. St000886The number of permutations with the same antidiagonal sums. St000914The sum of the values of the Möbius function of a poset. St000933The number of multipartitions of sizes given by an integer partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St001162The minimum jump of a permutation. St001179Number of indecomposable injective modules with projective dimension at most 2 in the corresponding Nakayama algebra. St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001262The dimension of the maximal parabolic seaweed algebra corresponding to the partition. St001344The neighbouring number of a permutation. St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St001707The length of a longest path in a graph such that the remaining vertices can be partitioned into two sets of the same size without edges between them. St001875The number of simple modules with projective dimension at most 1. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St000460The hook length of the last cell along the main diagonal of an integer partition. St000491The number of inversions of a set partition. St000497The lcb statistic of a set partition. St000514The number of invariant simple graphs when acting with a permutation of given cycle type. St000515The number of invariant set partitions when acting with a permutation of given cycle type. St000516The number of stretching pairs of a permutation. St000555The number of occurrences of the pattern {{1,3},{2}} in a set partition. St000560The number of occurrences of the pattern {{1,2},{3,4}} in a set partition. St000563The number of overlapping pairs of blocks of a set partition. St000565The major index of a set partition. St000572The dimension exponent of a set partition. St000582The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 3 is maximal, (1,3) are consecutive in a block. St000585The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal, (1,3) are consecutive in a block. St000590The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, 1 is maximal, (2,3) are consecutive in a block. St000594The number of occurrences of the pattern {{1,3},{2}} such that 1,2 are minimal, (1,3) are consecutive in a block. St000596The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 1 is maximal. St000602The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal. St000613The number of occurrences of the pattern {{1,3},{2}} such that 2 is minimal, 3 is maximal, (1,3) are consecutive in a block. St000623The number of occurrences of the pattern 52341 in a permutation. St000650The number of 3-rises of a permutation. St000709The number of occurrences of 14-2-3 or 14-3-2. St000732The number of double deficiencies of a permutation. St000744The length of the path to the largest entry in a standard Young tableau. St000748The major index of the permutation obtained by flattening the set partition. St000750The number of occurrences of the pattern 4213 in a permutation. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000803The number of occurrences of the vincular pattern |132 in a permutation. St000804The number of occurrences of the vincular pattern |123 in a permutation. St000870The product of the hook lengths of the diagonal cells in an integer partition. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000984The number of boxes below precisely one peak. St001098The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for vertex labelled trees. St001128The exponens consonantiae of a partition. St001130The number of two successive successions in a permutation. St001177Twice the mean value of the major index among all standard Young tableaux of a partition. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001249Sum of the odd parts of a partition. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001360The number of covering relations in Young's lattice below a partition. St001378The product of the cohook lengths of the integer partition. St001380The number of monomer-dimer tilings of a Ferrers diagram. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001552The number of inversions between excedances and fixed points of a permutation. St001556The number of inversions of the third entry of a permutation. St001607The number of coloured graphs such that the multiplicities of colours are given by a partition. St001608The number of coloured rooted trees such that the multiplicities of colours are given by a partition. St001611The number of multiset partitions such that the multiplicities of elements are given by a partition. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001811The Castelnuovo-Mumford regularity of a permutation. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001933The largest multiplicity of a part in an integer partition. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000477The weight of a partition according to Alladi. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000618The number of self-evacuating tableaux of given shape. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000658The number of rises of length 2 of a Dyck path. St000659The number of rises of length at least 2 of a Dyck path. St000667The greatest common divisor of the parts of the partition. St000681The Grundy value of Chomp on Ferrers diagrams. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000735The last entry on the main diagonal of a standard tableau. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000770The major index of an integer partition when read from bottom to top. St000938The number of zeros of the symmetric group character corresponding to the partition. St000940The number of characters of the symmetric group whose value on the partition is zero. St000947The major index east count of a Dyck path. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001176The size of a partition minus its first part. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001283The number of finite solvable groups that are realised by the given partition over the complex numbers. St001284The number of finite groups that are realised by the given partition over the complex numbers. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001389The number of partitions of the same length below the given integer partition. St001432The order dimension of the partition. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001527The cyclic permutation representation number of an integer partition. St001571The Cartan determinant of the integer partition. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001602The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on endofunctions. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001627The number of coloured connected graphs such that the multiplicities of colours are given by a partition. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001763The Hurwitz number of an integer partition. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001780The order of promotion on the set of standard tableaux of given shape. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001924The number of cells in an integer partition whose arm and leg length coincide. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St001938The number of transitive monotone factorizations of genus zero of a permutation of given cycle type. St001961The sum of the greatest common divisors of all pairs of parts. St001967The coefficient of the monomial corresponding to the integer partition in a certain power series. St001968The coefficient of the monomial corresponding to the integer partition in a certain power series. St000046The largest eigenvalue of the random to random operator acting on the simple module corresponding to the given partition. St000137The Grundy value of an integer partition. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000509The diagonal index (content) of a partition. St000661The number of rises of length 3 of a Dyck path. St000683The number of points below the Dyck path such that the diagonal to the north-east hits the path between two down steps, and the diagonal to the north-west hits the path between two up steps. St000749The smallest integer d such that the restriction of the representation corresponding to a partition of n to the symmetric group on n-d letters has a constituent of odd degree. St000790The number of pairs of centered tunnels, one strictly containing the other, of a Dyck path. St000791The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. St000931The number of occurrences of the pattern UUU in a Dyck path. St000936The number of even values of the symmetric group character corresponding to the partition. St000944The 3-degree of an integer partition. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001139The number of occurrences of hills of size 2 in a Dyck path. St001141The number of occurrences of hills of size 3 in a Dyck path. St001175The size of a partition minus the hook length of the base cell. St001178Twelve times the variance of the major index among all standard Young tableaux of a partition. St001383The BG-rank of an integer partition. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001525The number of symmetric hooks on the diagonal of a partition. St001541The Gini index of an integer partition. St001586The number of odd parts smaller than the largest even part in an integer partition. St001587Half of the largest even part of an integer partition. St001593This is the number of standard Young tableaux of the given shifted shape. St001600The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple graphs. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001657The number of twos in an integer partition. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001939The number of parts that are equal to their multiplicity in the integer partition. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St000145The Dyson rank of a partition. St000474Dyson's crank of a partition. St000997The even-odd crank of an integer partition. St000716The dimension of the irreducible representation of Sp(6) labelled by an integer partition. St001816Eigenvalues of the top-to-random operator acting on a simple module. St000075The orbit size of a standard tableau under promotion. St001235The global dimension of the corresponding Comp-Nakayama algebra. St000023The number of inner peaks of a permutation. St000136The dinv of a parking function. St000174The flush statistic of a semistandard tableau. St000194The number of primary dinversion pairs of a labelled dyck path corresponding to a parking function. St000219The number of occurrences of the pattern 231 in a permutation. St000353The number of inner valleys of a permutation. St000366The number of double descents of a permutation. St000456The monochromatic index of a connected graph. St000461The rix statistic of a permutation. St000495The number of inversions of distance at most 2 of a permutation. St000519The largest length of a factor maximising the subword complexity. St000589The number of occurrences of the pattern {{1},{2,3}} such that 1 is maximal, (2,3) are consecutive in a block. St000601The number of occurrences of the pattern {{1},{2,3}} such that 1,2 are minimal, (2,3) are consecutive in a block. St000606The number of occurrences of the pattern {{1},{2,3}} such that 1,3 are maximal, (2,3) are consecutive in a block. St000611The number of occurrences of the pattern {{1},{2,3}} such that 1 is maximal. St000614The number of occurrences of the pattern {{1},{2,3}} such that 1 is minimal, 3 is maximal, (2,3) are consecutive in a block. St000711The number of big exceedences of a permutation. St000801The number of occurrences of the vincular pattern |312 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St000988The orbit size of a permutation under Foata's bijection. St001164Number of indecomposable injective modules whose socle has projective dimension at most g-1 (g the global dimension) minus the number of indecomposable projective-injective modules. St001174The Gorenstein dimension of the algebra $A/I$ when $I$ is the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001419The length of the longest palindromic factor beginning with a one of a binary word. St001645The pebbling number of a connected graph. St001728The number of invisible descents of a permutation. St001772The number of occurrences of the signed pattern 12 in a signed permutation. St001783The number of odd automorphisms of a graph. St001839The number of excedances of a set partition. St001840The number of descents of a set partition. St001842The major index of a set partition. St001862The number of crossings of a signed permutation. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St001926Sparre Andersen's position of the maximum of a signed permutation. St001935The number of ascents in a parking function. St000089The absolute variation of a composition. St000090The variation of a composition. St000091The descent variation of a composition. St000092The number of outer peaks of a permutation. St000099The number of valleys of a permutation, including the boundary. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000166The depth minus 1 of an ordered tree. St000287The number of connected components of a graph. St000308The height of the tree associated to a permutation. St000335The difference of lower and upper interactions. St000352The Elizalde-Pak rank of a permutation. St000492The rob statistic of a set partition. St000522The number of 1-protected nodes of a rooted tree. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000577The number of occurrences of the pattern {{1},{2}} such that 1 is a maximal element. St000654The first descent of a permutation. St000679The pruning number of an ordered tree. St000726The normalized sum of the leaf labels of the increasing binary tree associated to a permutation. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St000923The minimal number with no two order isomorphic substrings of this length in a permutation. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001060The distinguishing index of a graph. St001114The number of odd descents of a permutation. St001118The acyclic chromatic index of a graph. St001151The number of blocks with odd minimum. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St001405The number of bonds in a permutation. St001488The number of corners of a skew partition. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001530The depth of a Dyck path. St001597The Frobenius rank of a skew partition. St001621The number of atoms of a lattice. St001624The breadth of a lattice. St001644The dimension of a graph. St001652The length of a longest interval of consecutive numbers. St001661Half the permanent of the Identity matrix plus the permutation matrix associated to the permutation. St001662The length of the longest factor of consecutive numbers in a permutation. St001699The major index of a standard tableau minus the weighted size of its shape. St001713The difference of the first and last value in the first row of the Gelfand-Tsetlin pattern. St001734The lettericity of a graph. St001741The largest integer such that all patterns of this size are contained in the permutation. St001773The number of minimal elements in Bruhat order not less than the signed permutation. St001784The minimum of the smallest closer and the second element of the block containing 1 in a set partition. St001863The number of weak excedances of a signed permutation. St001864The number of excedances of a signed permutation. St001928The number of non-overlapping descents in a permutation. St001948The number of augmented double ascents of a permutation. St000383The last part of an integer composition. St000521The number of distinct subtrees of an ordered tree. St000542The number of left-to-right-minima of a permutation. St000839The largest opener of a set partition. St000891The number of distinct diagonal sums of a permutation matrix. St000973The length of the boundary of an ordered tree. St000975The length of the boundary minus the length of the trunk of an ordered tree. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001890The maximum magnitude of the Möbius function of a poset. St000230Sum of the minimal elements of the blocks of a set partition. St001520The number of strict 3-descents.