Your data matches 71 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001435
Mapping
St001435: Skew partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1],[]]
 => 0
[[2],[]]
 => 0
[[1,1],[]]
 => 0
[[2,1],[1]]
 => 1
[[3],[]]
 => 0
[[2,1],[]]
 => 0
[[3,1],[1]]
 => 1
[[2,2],[1]]
 => 1
[[3,2],[2]]
 => 2
[[1,1,1],[]]
 => 0
[[2,2,1],[1,1]]
 => 1
[[2,1,1],[1]]
 => 1
[[3,2,1],[2,1]]
 => 2
[[4],[]]
 => 0
[[3,1],[]]
 => 0
[[4,1],[1]]
 => 1
[[2,2],[]]
 => 0
[[3,2],[1]]
 => 1
[[4,2],[2]]
 => 2
[[2,1,1],[]]
 => 0
[[3,2,1],[1,1]]
 => 1
[[3,1,1],[1]]
 => 1
[[4,2,1],[2,1]]
 => 2
[[3,3],[2]]
 => 2
[[4,3],[3]]
 => 3
[[2,2,1],[1]]
 => 1
[[3,3,1],[2,1]]
 => 2
[[3,2,1],[2]]
 => 2
[[4,3,1],[3,1]]
 => 3
[[2,2,2],[1,1]]
 => 1
[[3,3,2],[2,2]]
 => 2
[[3,2,2],[2,1]]
 => 2
[[4,3,2],[3,2]]
 => 3
[[1,1,1,1],[]]
 => 0
[[2,2,2,1],[1,1,1]]
 => 1
[[2,2,1,1],[1,1]]
 => 1
[[3,3,2,1],[2,2,1]]
 => 2
[[2,1,1,1],[1]]
 => 1
[[3,2,2,1],[2,1,1]]
 => 2
[[3,2,1,1],[2,1]]
 => 2
[[4,3,2,1],[3,2,1]]
 => 3
[[5],[]]
 => 0
[[4,1],[]]
 => 0
[[5,1],[1]]
 => 1
[[3,2],[]]
 => 0
[[4,2],[1]]
 => 1
[[5,2],[2]]
 => 2
[[3,1,1],[]]
 => 0
[[4,2,1],[1,1]]
 => 1
[[4,1,1],[1]]
 => 1
Description
The number of missing boxes in the first row.
Matching statistic: St000147
Mapping
Mp00183: Skew partitions —inner shape⟶ Integer partitions
St000147: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1],[]]
 => []
 => 0
[[2],[]]
 => []
 => 0
[[1,1],[]]
 => []
 => 0
[[2,1],[1]]
 => [1]
 => 1
[[3],[]]
 => []
 => 0
[[2,1],[]]
 => []
 => 0
[[3,1],[1]]
 => [1]
 => 1
[[2,2],[1]]
 => [1]
 => 1
[[3,2],[2]]
 => [2]
 => 2
[[1,1,1],[]]
 => []
 => 0
[[2,2,1],[1,1]]
 => [1,1]
 => 1
[[2,1,1],[1]]
 => [1]
 => 1
[[3,2,1],[2,1]]
 => [2,1]
 => 2
[[4],[]]
 => []
 => 0
[[3,1],[]]
 => []
 => 0
[[4,1],[1]]
 => [1]
 => 1
[[2,2],[]]
 => []
 => 0
[[3,2],[1]]
 => [1]
 => 1
[[4,2],[2]]
 => [2]
 => 2
[[2,1,1],[]]
 => []
 => 0
[[3,2,1],[1,1]]
 => [1,1]
 => 1
[[3,1,1],[1]]
 => [1]
 => 1
[[4,2,1],[2,1]]
 => [2,1]
 => 2
[[3,3],[2]]
 => [2]
 => 2
[[4,3],[3]]
 => [3]
 => 3
[[2,2,1],[1]]
 => [1]
 => 1
[[3,3,1],[2,1]]
 => [2,1]
 => 2
[[3,2,1],[2]]
 => [2]
 => 2
[[4,3,1],[3,1]]
 => [3,1]
 => 3
[[2,2,2],[1,1]]
 => [1,1]
 => 1
[[3,3,2],[2,2]]
 => [2,2]
 => 2
[[3,2,2],[2,1]]
 => [2,1]
 => 2
[[4,3,2],[3,2]]
 => [3,2]
 => 3
[[1,1,1,1],[]]
 => []
 => 0
[[2,2,2,1],[1,1,1]]
 => [1,1,1]
 => 1
[[2,2,1,1],[1,1]]
 => [1,1]
 => 1
[[3,3,2,1],[2,2,1]]
 => [2,2,1]
 => 2
[[2,1,1,1],[1]]
 => [1]
 => 1
[[3,2,2,1],[2,1,1]]
 => [2,1,1]
 => 2
[[3,2,1,1],[2,1]]
 => [2,1]
 => 2
[[4,3,2,1],[3,2,1]]
 => [3,2,1]
 => 3
[[5],[]]
 => []
 => 0
[[4,1],[]]
 => []
 => 0
[[5,1],[1]]
 => [1]
 => 1
[[3,2],[]]
 => []
 => 0
[[4,2],[1]]
 => [1]
 => 1
[[5,2],[2]]
 => [2]
 => 2
[[3,1,1],[]]
 => []
 => 0
[[4,2,1],[1,1]]
 => [1,1]
 => 1
[[4,1,1],[1]]
 => [1]
 => 1
Description
The largest part of an integer partition.
Matching statistic: St000010
(load all 2 compositions to match this statistic)
Mapping
Mp00183: Skew partitions —inner shape⟶ Integer partitions
Mp00044: Integer partitions —conjugate⟶ Integer partitions
St000010: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1],[]]
 => []
 => []
 => 0
[[2],[]]
 => []
 => []
 => 0
[[1,1],[]]
 => []
 => []
 => 0
[[2,1],[1]]
 => [1]
 => [1]
 => 1
[[3],[]]
 => []
 => []
 => 0
[[2,1],[]]
 => []
 => []
 => 0
[[3,1],[1]]
 => [1]
 => [1]
 => 1
[[2,2],[1]]
 => [1]
 => [1]
 => 1
[[3,2],[2]]
 => [2]
 => [1,1]
 => 2
[[1,1,1],[]]
 => []
 => []
 => 0
[[2,2,1],[1,1]]
 => [1,1]
 => [2]
 => 1
[[2,1,1],[1]]
 => [1]
 => [1]
 => 1
[[3,2,1],[2,1]]
 => [2,1]
 => [2,1]
 => 2
[[4],[]]
 => []
 => []
 => 0
[[3,1],[]]
 => []
 => []
 => 0
[[4,1],[1]]
 => [1]
 => [1]
 => 1
[[2,2],[]]
 => []
 => []
 => 0
[[3,2],[1]]
 => [1]
 => [1]
 => 1
[[4,2],[2]]
 => [2]
 => [1,1]
 => 2
[[2,1,1],[]]
 => []
 => []
 => 0
[[3,2,1],[1,1]]
 => [1,1]
 => [2]
 => 1
[[3,1,1],[1]]
 => [1]
 => [1]
 => 1
[[4,2,1],[2,1]]
 => [2,1]
 => [2,1]
 => 2
[[3,3],[2]]
 => [2]
 => [1,1]
 => 2
[[4,3],[3]]
 => [3]
 => [1,1,1]
 => 3
[[2,2,1],[1]]
 => [1]
 => [1]
 => 1
[[3,3,1],[2,1]]
 => [2,1]
 => [2,1]
 => 2
[[3,2,1],[2]]
 => [2]
 => [1,1]
 => 2
[[4,3,1],[3,1]]
 => [3,1]
 => [2,1,1]
 => 3
[[2,2,2],[1,1]]
 => [1,1]
 => [2]
 => 1
[[3,3,2],[2,2]]
 => [2,2]
 => [2,2]
 => 2
[[3,2,2],[2,1]]
 => [2,1]
 => [2,1]
 => 2
[[4,3,2],[3,2]]
 => [3,2]
 => [2,2,1]
 => 3
[[1,1,1,1],[]]
 => []
 => []
 => 0
[[2,2,2,1],[1,1,1]]
 => [1,1,1]
 => [3]
 => 1
[[2,2,1,1],[1,1]]
 => [1,1]
 => [2]
 => 1
[[3,3,2,1],[2,2,1]]
 => [2,2,1]
 => [3,2]
 => 2
[[2,1,1,1],[1]]
 => [1]
 => [1]
 => 1
[[3,2,2,1],[2,1,1]]
 => [2,1,1]
 => [3,1]
 => 2
[[3,2,1,1],[2,1]]
 => [2,1]
 => [2,1]
 => 2
[[4,3,2,1],[3,2,1]]
 => [3,2,1]
 => [3,2,1]
 => 3
[[5],[]]
 => []
 => []
 => 0
[[4,1],[]]
 => []
 => []
 => 0
[[5,1],[1]]
 => [1]
 => [1]
 => 1
[[3,2],[]]
 => []
 => []
 => 0
[[4,2],[1]]
 => [1]
 => [1]
 => 1
[[5,2],[2]]
 => [2]
 => [1,1]
 => 2
[[3,1,1],[]]
 => []
 => []
 => 0
[[4,2,1],[1,1]]
 => [1,1]
 => [2]
 => 1
[[4,1,1],[1]]
 => [1]
 => [1]
 => 1
Description
The length of the partition.
Matching statistic: St000225
Mapping
Mp00189: Skew partitions —rotate⟶ Skew partitions
Mp00182: Skew partitions —outer shape⟶ Integer partitions
St000225: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1],[]]
 => [[1],[]]
 => [1]
 => 0
[[2],[]]
 => [[2],[]]
 => [2]
 => 0
[[1,1],[]]
 => [[1,1],[]]
 => [1,1]
 => 0
[[2,1],[1]]
 => [[2,1],[1]]
 => [2,1]
 => 1
[[3],[]]
 => [[3],[]]
 => [3]
 => 0
[[2,1],[]]
 => [[2,2],[1]]
 => [2,2]
 => 0
[[3,1],[1]]
 => [[3,2],[2]]
 => [3,2]
 => 1
[[2,2],[1]]
 => [[2,1],[]]
 => [2,1]
 => 1
[[3,2],[2]]
 => [[3,1],[1]]
 => [3,1]
 => 2
[[1,1,1],[]]
 => [[1,1,1],[]]
 => [1,1,1]
 => 0
[[2,2,1],[1,1]]
 => [[2,1,1],[1]]
 => [2,1,1]
 => 1
[[2,1,1],[1]]
 => [[2,2,1],[1,1]]
 => [2,2,1]
 => 1
[[3,2,1],[2,1]]
 => [[3,2,1],[2,1]]
 => [3,2,1]
 => 2
[[4],[]]
 => [[4],[]]
 => [4]
 => 0
[[3,1],[]]
 => [[3,3],[2]]
 => [3,3]
 => 0
[[4,1],[1]]
 => [[4,3],[3]]
 => [4,3]
 => 1
[[2,2],[]]
 => [[2,2],[]]
 => [2,2]
 => 0
[[3,2],[1]]
 => [[3,2],[1]]
 => [3,2]
 => 1
[[4,2],[2]]
 => [[4,2],[2]]
 => [4,2]
 => 2
[[2,1,1],[]]
 => [[2,2,2],[1,1]]
 => [2,2,2]
 => 0
[[3,2,1],[1,1]]
 => [[3,2,2],[2,1]]
 => [3,2,2]
 => 1
[[3,1,1],[1]]
 => [[3,3,2],[2,2]]
 => [3,3,2]
 => 1
[[4,2,1],[2,1]]
 => [[4,3,2],[3,2]]
 => [4,3,2]
 => 2
[[3,3],[2]]
 => [[3,1],[]]
 => [3,1]
 => 2
[[4,3],[3]]
 => [[4,1],[1]]
 => [4,1]
 => 3
[[2,2,1],[1]]
 => [[2,2,1],[1]]
 => [2,2,1]
 => 1
[[3,3,1],[2,1]]
 => [[3,2,1],[2]]
 => [3,2,1]
 => 2
[[3,2,1],[2]]
 => [[3,3,1],[2,1]]
 => [3,3,1]
 => 2
[[4,3,1],[3,1]]
 => [[4,3,1],[3,1]]
 => [4,3,1]
 => 3
[[2,2,2],[1,1]]
 => [[2,1,1],[]]
 => [2,1,1]
 => 1
[[3,3,2],[2,2]]
 => [[3,1,1],[1]]
 => [3,1,1]
 => 2
[[3,2,2],[2,1]]
 => [[3,2,1],[1,1]]
 => [3,2,1]
 => 2
[[4,3,2],[3,2]]
 => [[4,2,1],[2,1]]
 => [4,2,1]
 => 3
[[1,1,1,1],[]]
 => [[1,1,1,1],[]]
 => [1,1,1,1]
 => 0
[[2,2,2,1],[1,1,1]]
 => [[2,1,1,1],[1]]
 => [2,1,1,1]
 => 1
[[2,2,1,1],[1,1]]
 => [[2,2,1,1],[1,1]]
 => [2,2,1,1]
 => 1
[[3,3,2,1],[2,2,1]]
 => [[3,2,1,1],[2,1]]
 => [3,2,1,1]
 => 2
[[2,1,1,1],[1]]
 => [[2,2,2,1],[1,1,1]]
 => [2,2,2,1]
 => 1
[[3,2,2,1],[2,1,1]]
 => [[3,2,2,1],[2,1,1]]
 => [3,2,2,1]
 => 2
[[3,2,1,1],[2,1]]
 => [[3,3,2,1],[2,2,1]]
 => [3,3,2,1]
 => 2
[[4,3,2,1],[3,2,1]]
 => [[4,3,2,1],[3,2,1]]
 => [4,3,2,1]
 => 3
[[5],[]]
 => [[5],[]]
 => [5]
 => 0
[[4,1],[]]
 => [[4,4],[3]]
 => [4,4]
 => 0
[[5,1],[1]]
 => [[5,4],[4]]
 => [5,4]
 => 1
[[3,2],[]]
 => [[3,3],[1]]
 => [3,3]
 => 0
[[4,2],[1]]
 => [[4,3],[2]]
 => [4,3]
 => 1
[[5,2],[2]]
 => [[5,3],[3]]
 => [5,3]
 => 2
[[3,1,1],[]]
 => [[3,3,3],[2,2]]
 => [3,3,3]
 => 0
[[4,2,1],[1,1]]
 => [[4,3,3],[3,2]]
 => [4,3,3]
 => 1
[[4,1,1],[1]]
 => [[4,4,3],[3,3]]
 => [4,4,3]
 => 1
Description
Difference between largest and smallest parts in a partition.
Matching statistic: St000676
(load all 2 compositions to match this statistic)
Mapping
Mp00183: Skew partitions —inner shape⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St000676: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1],[]]
 => []
 => []
 => 0
[[2],[]]
 => []
 => []
 => 0
[[1,1],[]]
 => []
 => []
 => 0
[[2,1],[1]]
 => [1]
 => [1,0]
 => 1
[[3],[]]
 => []
 => []
 => 0
[[2,1],[]]
 => []
 => []
 => 0
[[3,1],[1]]
 => [1]
 => [1,0]
 => 1
[[2,2],[1]]
 => [1]
 => [1,0]
 => 1
[[3,2],[2]]
 => [2]
 => [1,0,1,0]
 => 2
[[1,1,1],[]]
 => []
 => []
 => 0
[[2,2,1],[1,1]]
 => [1,1]
 => [1,1,0,0]
 => 1
[[2,1,1],[1]]
 => [1]
 => [1,0]
 => 1
[[3,2,1],[2,1]]
 => [2,1]
 => [1,0,1,1,0,0]
 => 2
[[4],[]]
 => []
 => []
 => 0
[[3,1],[]]
 => []
 => []
 => 0
[[4,1],[1]]
 => [1]
 => [1,0]
 => 1
[[2,2],[]]
 => []
 => []
 => 0
[[3,2],[1]]
 => [1]
 => [1,0]
 => 1
[[4,2],[2]]
 => [2]
 => [1,0,1,0]
 => 2
[[2,1,1],[]]
 => []
 => []
 => 0
[[3,2,1],[1,1]]
 => [1,1]
 => [1,1,0,0]
 => 1
[[3,1,1],[1]]
 => [1]
 => [1,0]
 => 1
[[4,2,1],[2,1]]
 => [2,1]
 => [1,0,1,1,0,0]
 => 2
[[3,3],[2]]
 => [2]
 => [1,0,1,0]
 => 2
[[4,3],[3]]
 => [3]
 => [1,0,1,0,1,0]
 => 3
[[2,2,1],[1]]
 => [1]
 => [1,0]
 => 1
[[3,3,1],[2,1]]
 => [2,1]
 => [1,0,1,1,0,0]
 => 2
[[3,2,1],[2]]
 => [2]
 => [1,0,1,0]
 => 2
[[4,3,1],[3,1]]
 => [3,1]
 => [1,0,1,0,1,1,0,0]
 => 3
[[2,2,2],[1,1]]
 => [1,1]
 => [1,1,0,0]
 => 1
[[3,3,2],[2,2]]
 => [2,2]
 => [1,1,1,0,0,0]
 => 2
[[3,2,2],[2,1]]
 => [2,1]
 => [1,0,1,1,0,0]
 => 2
[[4,3,2],[3,2]]
 => [3,2]
 => [1,0,1,1,1,0,0,0]
 => 3
[[1,1,1,1],[]]
 => []
 => []
 => 0
[[2,2,2,1],[1,1,1]]
 => [1,1,1]
 => [1,1,0,1,0,0]
 => 1
[[2,2,1,1],[1,1]]
 => [1,1]
 => [1,1,0,0]
 => 1
[[3,3,2,1],[2,2,1]]
 => [2,2,1]
 => [1,1,1,0,0,1,0,0]
 => 2
[[2,1,1,1],[1]]
 => [1]
 => [1,0]
 => 1
[[3,2,2,1],[2,1,1]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => 2
[[3,2,1,1],[2,1]]
 => [2,1]
 => [1,0,1,1,0,0]
 => 2
[[4,3,2,1],[3,2,1]]
 => [3,2,1]
 => [1,0,1,1,1,0,0,1,0,0]
 => 3
[[5],[]]
 => []
 => []
 => 0
[[4,1],[]]
 => []
 => []
 => 0
[[5,1],[1]]
 => [1]
 => [1,0]
 => 1
[[3,2],[]]
 => []
 => []
 => 0
[[4,2],[1]]
 => [1]
 => [1,0]
 => 1
[[5,2],[2]]
 => [2]
 => [1,0,1,0]
 => 2
[[3,1,1],[]]
 => []
 => []
 => 0
[[4,2,1],[1,1]]
 => [1,1]
 => [1,1,0,0]
 => 1
[[4,1,1],[1]]
 => [1]
 => [1,0]
 => 1
Description
The number of odd rises of a Dyck path. This is the number of ones at an odd position, with the initial position equal to 1. The number of Dyck paths of semilength $n$ with $k$ up steps in odd positions and $k$ returns to the main diagonal are counted by the binomial coefficient $\binom{n-1}{k-1}$ [3,4].
Matching statistic: St000013
Mapping
Mp00183: Skew partitions —inner shape⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St000013: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1],[]]
 => []
 => []
 => []
 => 0
[[2],[]]
 => []
 => []
 => []
 => 0
[[1,1],[]]
 => []
 => []
 => []
 => 0
[[2,1],[1]]
 => [1]
 => [1,0]
 => [1,0]
 => 1
[[3],[]]
 => []
 => []
 => []
 => 0
[[2,1],[]]
 => []
 => []
 => []
 => 0
[[3,1],[1]]
 => [1]
 => [1,0]
 => [1,0]
 => 1
[[2,2],[1]]
 => [1]
 => [1,0]
 => [1,0]
 => 1
[[3,2],[2]]
 => [2]
 => [1,0,1,0]
 => [1,1,0,0]
 => 2
[[1,1,1],[]]
 => []
 => []
 => []
 => 0
[[2,2,1],[1,1]]
 => [1,1]
 => [1,1,0,0]
 => [1,0,1,0]
 => 1
[[2,1,1],[1]]
 => [1]
 => [1,0]
 => [1,0]
 => 1
[[3,2,1],[2,1]]
 => [2,1]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 2
[[4],[]]
 => []
 => []
 => []
 => 0
[[3,1],[]]
 => []
 => []
 => []
 => 0
[[4,1],[1]]
 => [1]
 => [1,0]
 => [1,0]
 => 1
[[2,2],[]]
 => []
 => []
 => []
 => 0
[[3,2],[1]]
 => [1]
 => [1,0]
 => [1,0]
 => 1
[[4,2],[2]]
 => [2]
 => [1,0,1,0]
 => [1,1,0,0]
 => 2
[[2,1,1],[]]
 => []
 => []
 => []
 => 0
[[3,2,1],[1,1]]
 => [1,1]
 => [1,1,0,0]
 => [1,0,1,0]
 => 1
[[3,1,1],[1]]
 => [1]
 => [1,0]
 => [1,0]
 => 1
[[4,2,1],[2,1]]
 => [2,1]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 2
[[3,3],[2]]
 => [2]
 => [1,0,1,0]
 => [1,1,0,0]
 => 2
[[4,3],[3]]
 => [3]
 => [1,0,1,0,1,0]
 => [1,1,1,0,0,0]
 => 3
[[2,2,1],[1]]
 => [1]
 => [1,0]
 => [1,0]
 => 1
[[3,3,1],[2,1]]
 => [2,1]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 2
[[3,2,1],[2]]
 => [2]
 => [1,0,1,0]
 => [1,1,0,0]
 => 2
[[4,3,1],[3,1]]
 => [3,1]
 => [1,0,1,0,1,1,0,0]
 => [1,1,1,0,0,0,1,0]
 => 3
[[2,2,2],[1,1]]
 => [1,1]
 => [1,1,0,0]
 => [1,0,1,0]
 => 1
[[3,3,2],[2,2]]
 => [2,2]
 => [1,1,1,0,0,0]
 => [1,1,0,1,0,0]
 => 2
[[3,2,2],[2,1]]
 => [2,1]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 2
[[4,3,2],[3,2]]
 => [3,2]
 => [1,0,1,1,1,0,0,0]
 => [1,1,1,0,0,1,0,0]
 => 3
[[1,1,1,1],[]]
 => []
 => []
 => []
 => 0
[[2,2,2,1],[1,1,1]]
 => [1,1,1]
 => [1,1,0,1,0,0]
 => [1,0,1,0,1,0]
 => 1
[[2,2,1,1],[1,1]]
 => [1,1]
 => [1,1,0,0]
 => [1,0,1,0]
 => 1
[[3,3,2,1],[2,2,1]]
 => [2,2,1]
 => [1,1,1,0,0,1,0,0]
 => [1,1,0,1,0,0,1,0]
 => 2
[[2,1,1,1],[1]]
 => [1]
 => [1,0]
 => [1,0]
 => 1
[[3,2,2,1],[2,1,1]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => [1,1,0,0,1,0,1,0]
 => 2
[[3,2,1,1],[2,1]]
 => [2,1]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 2
[[4,3,2,1],[3,2,1]]
 => [3,2,1]
 => [1,0,1,1,1,0,0,1,0,0]
 => [1,1,1,0,0,1,0,0,1,0]
 => 3
[[5],[]]
 => []
 => []
 => []
 => 0
[[4,1],[]]
 => []
 => []
 => []
 => 0
[[5,1],[1]]
 => [1]
 => [1,0]
 => [1,0]
 => 1
[[3,2],[]]
 => []
 => []
 => []
 => 0
[[4,2],[1]]
 => [1]
 => [1,0]
 => [1,0]
 => 1
[[5,2],[2]]
 => [2]
 => [1,0,1,0]
 => [1,1,0,0]
 => 2
[[3,1,1],[]]
 => []
 => []
 => []
 => 0
[[4,2,1],[1,1]]
 => [1,1]
 => [1,1,0,0]
 => [1,0,1,0]
 => 1
[[4,1,1],[1]]
 => [1]
 => [1,0]
 => [1,0]
 => 1
Description
The height of a Dyck path. The height of a Dyck path $D$ of semilength $n$ is defined as the maximal height of a peak of $D$. The height of $D$ at position $i$ is the number of up-steps minus the number of down-steps before position $i$.
Matching statistic: St000025
Mapping
Mp00183: Skew partitions —inner shape⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St000025: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1],[]]
 => []
 => []
 => []
 => 0
[[2],[]]
 => []
 => []
 => []
 => 0
[[1,1],[]]
 => []
 => []
 => []
 => 0
[[2,1],[1]]
 => [1]
 => [1,0]
 => [1,0]
 => 1
[[3],[]]
 => []
 => []
 => []
 => 0
[[2,1],[]]
 => []
 => []
 => []
 => 0
[[3,1],[1]]
 => [1]
 => [1,0]
 => [1,0]
 => 1
[[2,2],[1]]
 => [1]
 => [1,0]
 => [1,0]
 => 1
[[3,2],[2]]
 => [2]
 => [1,0,1,0]
 => [1,1,0,0]
 => 2
[[1,1,1],[]]
 => []
 => []
 => []
 => 0
[[2,2,1],[1,1]]
 => [1,1]
 => [1,1,0,0]
 => [1,0,1,0]
 => 1
[[2,1,1],[1]]
 => [1]
 => [1,0]
 => [1,0]
 => 1
[[3,2,1],[2,1]]
 => [2,1]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 2
[[4],[]]
 => []
 => []
 => []
 => 0
[[3,1],[]]
 => []
 => []
 => []
 => 0
[[4,1],[1]]
 => [1]
 => [1,0]
 => [1,0]
 => 1
[[2,2],[]]
 => []
 => []
 => []
 => 0
[[3,2],[1]]
 => [1]
 => [1,0]
 => [1,0]
 => 1
[[4,2],[2]]
 => [2]
 => [1,0,1,0]
 => [1,1,0,0]
 => 2
[[2,1,1],[]]
 => []
 => []
 => []
 => 0
[[3,2,1],[1,1]]
 => [1,1]
 => [1,1,0,0]
 => [1,0,1,0]
 => 1
[[3,1,1],[1]]
 => [1]
 => [1,0]
 => [1,0]
 => 1
[[4,2,1],[2,1]]
 => [2,1]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 2
[[3,3],[2]]
 => [2]
 => [1,0,1,0]
 => [1,1,0,0]
 => 2
[[4,3],[3]]
 => [3]
 => [1,0,1,0,1,0]
 => [1,1,1,0,0,0]
 => 3
[[2,2,1],[1]]
 => [1]
 => [1,0]
 => [1,0]
 => 1
[[3,3,1],[2,1]]
 => [2,1]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 2
[[3,2,1],[2]]
 => [2]
 => [1,0,1,0]
 => [1,1,0,0]
 => 2
[[4,3,1],[3,1]]
 => [3,1]
 => [1,0,1,0,1,1,0,0]
 => [1,1,1,0,0,0,1,0]
 => 3
[[2,2,2],[1,1]]
 => [1,1]
 => [1,1,0,0]
 => [1,0,1,0]
 => 1
[[3,3,2],[2,2]]
 => [2,2]
 => [1,1,1,0,0,0]
 => [1,1,0,1,0,0]
 => 2
[[3,2,2],[2,1]]
 => [2,1]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 2
[[4,3,2],[3,2]]
 => [3,2]
 => [1,0,1,1,1,0,0,0]
 => [1,1,1,0,0,1,0,0]
 => 3
[[1,1,1,1],[]]
 => []
 => []
 => []
 => 0
[[2,2,2,1],[1,1,1]]
 => [1,1,1]
 => [1,1,0,1,0,0]
 => [1,0,1,0,1,0]
 => 1
[[2,2,1,1],[1,1]]
 => [1,1]
 => [1,1,0,0]
 => [1,0,1,0]
 => 1
[[3,3,2,1],[2,2,1]]
 => [2,2,1]
 => [1,1,1,0,0,1,0,0]
 => [1,1,0,1,0,0,1,0]
 => 2
[[2,1,1,1],[1]]
 => [1]
 => [1,0]
 => [1,0]
 => 1
[[3,2,2,1],[2,1,1]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => [1,1,0,0,1,0,1,0]
 => 2
[[3,2,1,1],[2,1]]
 => [2,1]
 => [1,0,1,1,0,0]
 => [1,1,0,0,1,0]
 => 2
[[4,3,2,1],[3,2,1]]
 => [3,2,1]
 => [1,0,1,1,1,0,0,1,0,0]
 => [1,1,1,0,0,1,0,0,1,0]
 => 3
[[5],[]]
 => []
 => []
 => []
 => 0
[[4,1],[]]
 => []
 => []
 => []
 => 0
[[5,1],[1]]
 => [1]
 => [1,0]
 => [1,0]
 => 1
[[3,2],[]]
 => []
 => []
 => []
 => 0
[[4,2],[1]]
 => [1]
 => [1,0]
 => [1,0]
 => 1
[[5,2],[2]]
 => [2]
 => [1,0,1,0]
 => [1,1,0,0]
 => 2
[[3,1,1],[]]
 => []
 => []
 => []
 => 0
[[4,2,1],[1,1]]
 => [1,1]
 => [1,1,0,0]
 => [1,0,1,0]
 => 1
[[4,1,1],[1]]
 => [1]
 => [1,0]
 => [1,0]
 => 1
Description
The number of initial rises of a Dyck path. In other words, this is the height of the first peak of $D$.
Matching statistic: St000378
Mapping
Mp00183: Skew partitions —inner shape⟶ Integer partitions
Mp00044: Integer partitions —conjugate⟶ Integer partitions
Mp00322: Integer partitions —Loehr-Warrington⟶ Integer partitions
St000378: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1],[]]
 => []
 => []
 => []
 => 0
[[2],[]]
 => []
 => []
 => []
 => 0
[[1,1],[]]
 => []
 => []
 => []
 => 0
[[2,1],[1]]
 => [1]
 => [1]
 => [1]
 => 1
[[3],[]]
 => []
 => []
 => []
 => 0
[[2,1],[]]
 => []
 => []
 => []
 => 0
[[3,1],[1]]
 => [1]
 => [1]
 => [1]
 => 1
[[2,2],[1]]
 => [1]
 => [1]
 => [1]
 => 1
[[3,2],[2]]
 => [2]
 => [1,1]
 => [2]
 => 2
[[1,1,1],[]]
 => []
 => []
 => []
 => 0
[[2,2,1],[1,1]]
 => [1,1]
 => [2]
 => [1,1]
 => 1
[[2,1,1],[1]]
 => [1]
 => [1]
 => [1]
 => 1
[[3,2,1],[2,1]]
 => [2,1]
 => [2,1]
 => [3]
 => 2
[[4],[]]
 => []
 => []
 => []
 => 0
[[3,1],[]]
 => []
 => []
 => []
 => 0
[[4,1],[1]]
 => [1]
 => [1]
 => [1]
 => 1
[[2,2],[]]
 => []
 => []
 => []
 => 0
[[3,2],[1]]
 => [1]
 => [1]
 => [1]
 => 1
[[4,2],[2]]
 => [2]
 => [1,1]
 => [2]
 => 2
[[2,1,1],[]]
 => []
 => []
 => []
 => 0
[[3,2,1],[1,1]]
 => [1,1]
 => [2]
 => [1,1]
 => 1
[[3,1,1],[1]]
 => [1]
 => [1]
 => [1]
 => 1
[[4,2,1],[2,1]]
 => [2,1]
 => [2,1]
 => [3]
 => 2
[[3,3],[2]]
 => [2]
 => [1,1]
 => [2]
 => 2
[[4,3],[3]]
 => [3]
 => [1,1,1]
 => [2,1]
 => 3
[[2,2,1],[1]]
 => [1]
 => [1]
 => [1]
 => 1
[[3,3,1],[2,1]]
 => [2,1]
 => [2,1]
 => [3]
 => 2
[[3,2,1],[2]]
 => [2]
 => [1,1]
 => [2]
 => 2
[[4,3,1],[3,1]]
 => [3,1]
 => [2,1,1]
 => [2,2]
 => 3
[[2,2,2],[1,1]]
 => [1,1]
 => [2]
 => [1,1]
 => 1
[[3,3,2],[2,2]]
 => [2,2]
 => [2,2]
 => [4]
 => 2
[[3,2,2],[2,1]]
 => [2,1]
 => [2,1]
 => [3]
 => 2
[[4,3,2],[3,2]]
 => [3,2]
 => [2,2,1]
 => [2,2,1]
 => 3
[[1,1,1,1],[]]
 => []
 => []
 => []
 => 0
[[2,2,2,1],[1,1,1]]
 => [1,1,1]
 => [3]
 => [1,1,1]
 => 1
[[2,2,1,1],[1,1]]
 => [1,1]
 => [2]
 => [1,1]
 => 1
[[3,3,2,1],[2,2,1]]
 => [2,2,1]
 => [3,2]
 => [5]
 => 2
[[2,1,1,1],[1]]
 => [1]
 => [1]
 => [1]
 => 1
[[3,2,2,1],[2,1,1]]
 => [2,1,1]
 => [3,1]
 => [2,1,1]
 => 2
[[3,2,1,1],[2,1]]
 => [2,1]
 => [2,1]
 => [3]
 => 2
[[4,3,2,1],[3,2,1]]
 => [3,2,1]
 => [3,2,1]
 => [5,1]
 => 3
[[5],[]]
 => []
 => []
 => []
 => 0
[[4,1],[]]
 => []
 => []
 => []
 => 0
[[5,1],[1]]
 => [1]
 => [1]
 => [1]
 => 1
[[3,2],[]]
 => []
 => []
 => []
 => 0
[[4,2],[1]]
 => [1]
 => [1]
 => [1]
 => 1
[[5,2],[2]]
 => [2]
 => [1,1]
 => [2]
 => 2
[[3,1,1],[]]
 => []
 => []
 => []
 => 0
[[4,2,1],[1,1]]
 => [1,1]
 => [2]
 => [1,1]
 => 1
[[4,1,1],[1]]
 => [1]
 => [1]
 => [1]
 => 1
Description
The diagonal inversion number of an integer partition. The dinv of a partition is the number of cells $c$ in the diagram of an integer partition $\lambda$ for which $\operatorname{arm}(c)-\operatorname{leg}(c) \in \{0,1\}$. See also exercise 3.19 of [2]. This statistic is equidistributed with the length of the partition, see [3].
Matching statistic: St000745
Mapping
Mp00183: Skew partitions —inner shape⟶ Integer partitions
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
Mp00084: Standard tableaux —conjugate⟶ Standard tableaux
St000745: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1],[]]
 => []
 => []
 => []
 => 0
[[2],[]]
 => []
 => []
 => []
 => 0
[[1,1],[]]
 => []
 => []
 => []
 => 0
[[2,1],[1]]
 => [1]
 => [[1]]
 => [[1]]
 => 1
[[3],[]]
 => []
 => []
 => []
 => 0
[[2,1],[]]
 => []
 => []
 => []
 => 0
[[3,1],[1]]
 => [1]
 => [[1]]
 => [[1]]
 => 1
[[2,2],[1]]
 => [1]
 => [[1]]
 => [[1]]
 => 1
[[3,2],[2]]
 => [2]
 => [[1,2]]
 => [[1],[2]]
 => 2
[[1,1,1],[]]
 => []
 => []
 => []
 => 0
[[2,2,1],[1,1]]
 => [1,1]
 => [[1],[2]]
 => [[1,2]]
 => 1
[[2,1,1],[1]]
 => [1]
 => [[1]]
 => [[1]]
 => 1
[[3,2,1],[2,1]]
 => [2,1]
 => [[1,2],[3]]
 => [[1,3],[2]]
 => 2
[[4],[]]
 => []
 => []
 => []
 => 0
[[3,1],[]]
 => []
 => []
 => []
 => 0
[[4,1],[1]]
 => [1]
 => [[1]]
 => [[1]]
 => 1
[[2,2],[]]
 => []
 => []
 => []
 => 0
[[3,2],[1]]
 => [1]
 => [[1]]
 => [[1]]
 => 1
[[4,2],[2]]
 => [2]
 => [[1,2]]
 => [[1],[2]]
 => 2
[[2,1,1],[]]
 => []
 => []
 => []
 => 0
[[3,2,1],[1,1]]
 => [1,1]
 => [[1],[2]]
 => [[1,2]]
 => 1
[[3,1,1],[1]]
 => [1]
 => [[1]]
 => [[1]]
 => 1
[[4,2,1],[2,1]]
 => [2,1]
 => [[1,2],[3]]
 => [[1,3],[2]]
 => 2
[[3,3],[2]]
 => [2]
 => [[1,2]]
 => [[1],[2]]
 => 2
[[4,3],[3]]
 => [3]
 => [[1,2,3]]
 => [[1],[2],[3]]
 => 3
[[2,2,1],[1]]
 => [1]
 => [[1]]
 => [[1]]
 => 1
[[3,3,1],[2,1]]
 => [2,1]
 => [[1,2],[3]]
 => [[1,3],[2]]
 => 2
[[3,2,1],[2]]
 => [2]
 => [[1,2]]
 => [[1],[2]]
 => 2
[[4,3,1],[3,1]]
 => [3,1]
 => [[1,2,3],[4]]
 => [[1,4],[2],[3]]
 => 3
[[2,2,2],[1,1]]
 => [1,1]
 => [[1],[2]]
 => [[1,2]]
 => 1
[[3,3,2],[2,2]]
 => [2,2]
 => [[1,2],[3,4]]
 => [[1,3],[2,4]]
 => 2
[[3,2,2],[2,1]]
 => [2,1]
 => [[1,2],[3]]
 => [[1,3],[2]]
 => 2
[[4,3,2],[3,2]]
 => [3,2]
 => [[1,2,3],[4,5]]
 => [[1,4],[2,5],[3]]
 => 3
[[1,1,1,1],[]]
 => []
 => []
 => []
 => 0
[[2,2,2,1],[1,1,1]]
 => [1,1,1]
 => [[1],[2],[3]]
 => [[1,2,3]]
 => 1
[[2,2,1,1],[1,1]]
 => [1,1]
 => [[1],[2]]
 => [[1,2]]
 => 1
[[3,3,2,1],[2,2,1]]
 => [2,2,1]
 => [[1,2],[3,4],[5]]
 => [[1,3,5],[2,4]]
 => 2
[[2,1,1,1],[1]]
 => [1]
 => [[1]]
 => [[1]]
 => 1
[[3,2,2,1],[2,1,1]]
 => [2,1,1]
 => [[1,2],[3],[4]]
 => [[1,3,4],[2]]
 => 2
[[3,2,1,1],[2,1]]
 => [2,1]
 => [[1,2],[3]]
 => [[1,3],[2]]
 => 2
[[4,3,2,1],[3,2,1]]
 => [3,2,1]
 => [[1,2,3],[4,5],[6]]
 => [[1,4,6],[2,5],[3]]
 => 3
[[5],[]]
 => []
 => []
 => []
 => 0
[[4,1],[]]
 => []
 => []
 => []
 => 0
[[5,1],[1]]
 => [1]
 => [[1]]
 => [[1]]
 => 1
[[3,2],[]]
 => []
 => []
 => []
 => 0
[[4,2],[1]]
 => [1]
 => [[1]]
 => [[1]]
 => 1
[[5,2],[2]]
 => [2]
 => [[1,2]]
 => [[1],[2]]
 => 2
[[3,1,1],[]]
 => []
 => []
 => []
 => 0
[[4,2,1],[1,1]]
 => [1,1]
 => [[1],[2]]
 => [[1,2]]
 => 1
[[4,1,1],[1]]
 => [1]
 => [[1]]
 => [[1]]
 => 1
Description
The index of the last row whose first entry is the row number in a standard Young tableau.
Matching statistic: St000740
(load all 2 compositions to match this statistic)
Mapping
Mp00183: Skew partitions —inner shape⟶ Integer partitions
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00201: Dyck paths —Ringel⟶ Permutations
St000740: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[[1],[]]
 => []
 => []
 => [1] => 1 = 0 + 1
[[2],[]]
 => []
 => []
 => [1] => 1 = 0 + 1
[[1,1],[]]
 => []
 => []
 => [1] => 1 = 0 + 1
[[2,1],[1]]
 => [1]
 => [1,0,1,0]
 => [3,1,2] => 2 = 1 + 1
[[3],[]]
 => []
 => []
 => [1] => 1 = 0 + 1
[[2,1],[]]
 => []
 => []
 => [1] => 1 = 0 + 1
[[3,1],[1]]
 => [1]
 => [1,0,1,0]
 => [3,1,2] => 2 = 1 + 1
[[2,2],[1]]
 => [1]
 => [1,0,1,0]
 => [3,1,2] => 2 = 1 + 1
[[3,2],[2]]
 => [2]
 => [1,1,0,0,1,0]
 => [2,4,1,3] => 3 = 2 + 1
[[1,1,1],[]]
 => []
 => []
 => [1] => 1 = 0 + 1
[[2,2,1],[1,1]]
 => [1,1]
 => [1,0,1,1,0,0]
 => [3,1,4,2] => 2 = 1 + 1
[[2,1,1],[1]]
 => [1]
 => [1,0,1,0]
 => [3,1,2] => 2 = 1 + 1
[[3,2,1],[2,1]]
 => [2,1]
 => [1,0,1,0,1,0]
 => [4,1,2,3] => 3 = 2 + 1
[[4],[]]
 => []
 => []
 => [1] => 1 = 0 + 1
[[3,1],[]]
 => []
 => []
 => [1] => 1 = 0 + 1
[[4,1],[1]]
 => [1]
 => [1,0,1,0]
 => [3,1,2] => 2 = 1 + 1
[[2,2],[]]
 => []
 => []
 => [1] => 1 = 0 + 1
[[3,2],[1]]
 => [1]
 => [1,0,1,0]
 => [3,1,2] => 2 = 1 + 1
[[4,2],[2]]
 => [2]
 => [1,1,0,0,1,0]
 => [2,4,1,3] => 3 = 2 + 1
[[2,1,1],[]]
 => []
 => []
 => [1] => 1 = 0 + 1
[[3,2,1],[1,1]]
 => [1,1]
 => [1,0,1,1,0,0]
 => [3,1,4,2] => 2 = 1 + 1
[[3,1,1],[1]]
 => [1]
 => [1,0,1,0]
 => [3,1,2] => 2 = 1 + 1
[[4,2,1],[2,1]]
 => [2,1]
 => [1,0,1,0,1,0]
 => [4,1,2,3] => 3 = 2 + 1
[[3,3],[2]]
 => [2]
 => [1,1,0,0,1,0]
 => [2,4,1,3] => 3 = 2 + 1
[[4,3],[3]]
 => [3]
 => [1,1,1,0,0,0,1,0]
 => [2,3,5,1,4] => 4 = 3 + 1
[[2,2,1],[1]]
 => [1]
 => [1,0,1,0]
 => [3,1,2] => 2 = 1 + 1
[[3,3,1],[2,1]]
 => [2,1]
 => [1,0,1,0,1,0]
 => [4,1,2,3] => 3 = 2 + 1
[[3,2,1],[2]]
 => [2]
 => [1,1,0,0,1,0]
 => [2,4,1,3] => 3 = 2 + 1
[[4,3,1],[3,1]]
 => [3,1]
 => [1,1,0,1,0,0,1,0]
 => [5,3,1,2,4] => 4 = 3 + 1
[[2,2,2],[1,1]]
 => [1,1]
 => [1,0,1,1,0,0]
 => [3,1,4,2] => 2 = 1 + 1
[[3,3,2],[2,2]]
 => [2,2]
 => [1,1,0,0,1,1,0,0]
 => [2,4,1,5,3] => 3 = 2 + 1
[[3,2,2],[2,1]]
 => [2,1]
 => [1,0,1,0,1,0]
 => [4,1,2,3] => 3 = 2 + 1
[[4,3,2],[3,2]]
 => [3,2]
 => [1,1,0,0,1,0,1,0]
 => [2,5,1,3,4] => 4 = 3 + 1
[[1,1,1,1],[]]
 => []
 => []
 => [1] => 1 = 0 + 1
[[2,2,2,1],[1,1,1]]
 => [1,1,1]
 => [1,0,1,1,1,0,0,0]
 => [3,1,4,5,2] => 2 = 1 + 1
[[2,2,1,1],[1,1]]
 => [1,1]
 => [1,0,1,1,0,0]
 => [3,1,4,2] => 2 = 1 + 1
[[3,3,2,1],[2,2,1]]
 => [2,2,1]
 => [1,0,1,0,1,1,0,0]
 => [4,1,2,5,3] => 3 = 2 + 1
[[2,1,1,1],[1]]
 => [1]
 => [1,0,1,0]
 => [3,1,2] => 2 = 1 + 1
[[3,2,2,1],[2,1,1]]
 => [2,1,1]
 => [1,0,1,1,0,1,0,0]
 => [5,1,4,2,3] => 3 = 2 + 1
[[3,2,1,1],[2,1]]
 => [2,1]
 => [1,0,1,0,1,0]
 => [4,1,2,3] => 3 = 2 + 1
[[4,3,2,1],[3,2,1]]
 => [3,2,1]
 => [1,0,1,0,1,0,1,0]
 => [5,1,2,3,4] => 4 = 3 + 1
[[5],[]]
 => []
 => []
 => [1] => 1 = 0 + 1
[[4,1],[]]
 => []
 => []
 => [1] => 1 = 0 + 1
[[5,1],[1]]
 => [1]
 => [1,0,1,0]
 => [3,1,2] => 2 = 1 + 1
[[3,2],[]]
 => []
 => []
 => [1] => 1 = 0 + 1
[[4,2],[1]]
 => [1]
 => [1,0,1,0]
 => [3,1,2] => 2 = 1 + 1
[[5,2],[2]]
 => [2]
 => [1,1,0,0,1,0]
 => [2,4,1,3] => 3 = 2 + 1
[[3,1,1],[]]
 => []
 => []
 => [1] => 1 = 0 + 1
[[4,2,1],[1,1]]
 => [1,1]
 => [1,0,1,1,0,0]
 => [3,1,4,2] => 2 = 1 + 1
[[4,1,1],[1]]
 => [1]
 => [1,0,1,0]
 => [3,1,2] => 2 = 1 + 1
Description
The last entry of a permutation. This statistic is undefined for the empty permutation.
The following 61 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St000031The number of cycles in the cycle decomposition of a permutation. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000734The last entry in the first row of a standard tableau. St000141The maximum drop size of a permutation. St000288The number of ones in a binary word. St000316The number of non-left-to-right-maxima of a permutation. St000382The first part of an integer composition. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000653The last descent of a permutation. St000691The number of changes of a binary word. St000733The row containing the largest entry of a standard tableau. St000840The number of closers smaller than the largest opener in a perfect matching. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. 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. St001480The number of simple summands of the module J^2/J^3. St001809The index of the step at the first peak of maximal height in a Dyck path. St000054The first entry of the permutation. St000199The column of the unique '1' in the last row of the alternating sign matrix. St000200The row of the unique '1' in the last column of the alternating sign matrix. St000439The position of the first down step of a Dyck path. St001497The position of the largest weak excedence of a permutation. 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. St000381The largest part of an integer composition. St000443The number of long tunnels of a Dyck path. St000808The number of up steps of the associated bargraph. 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. St001461The number of topologically connected components of the chord diagram of a permutation. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St000738The first entry in the last row of a standard tableau. St000383The last part of an integer composition. St000505The biggest entry in the block containing the 1. St000746The number of pairs with odd minimum in a perfect matching. St000971The smallest closer of a set partition. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St000062The length of the longest increasing subsequence of the permutation. St000308The height of the tree associated to a permutation. St000314The number of left-to-right-maxima of a permutation. St000991The number of right-to-left minima of a permutation. St001652The length of a longest interval of consecutive numbers. St001662The length of the longest factor of consecutive numbers in a permutation. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St000326The position of the first one in a binary word after appending a 1 at the end. St000444The length of the maximal rise of a Dyck path. St000442The maximal area to the right of an up step of a Dyck path. St000874The position of the last double rise in a Dyck path. St000702The number of weak deficiencies of a permutation. St000083The number of left oriented leafs of a binary tree except the first one. St000504The cardinality of the first block of a set partition. St000823The number of unsplittable factors of the set partition. St001062The maximal size of a block of a set partition. St000503The maximal difference between two elements in a common block. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St000989The number of final rises of a permutation. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001330The hat guessing number of a graph.