- FindStat

Your data matches 227 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)

Matching statistic: St001222
(load all 10 compositions to match this statistic)

Mapping

St001222: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[1,0]
 => 0
[1,0,1,0]
 => 1
[1,1,0,0]
 => 0
[1,0,1,0,1,0]
 => 1
[1,0,1,1,0,0]
 => 1
[1,1,0,0,1,0]
 => 1
[1,1,0,1,0,0]
 => 0
[1,1,1,0,0,0]
 => 0
[1,0,1,0,1,0,1,0]
 => 1
[1,0,1,0,1,1,0,0]
 => 1
[1,0,1,1,0,0,1,0]
 => 2
[1,0,1,1,0,1,0,0]
 => 2
[1,0,1,1,1,0,0,0]
 => 1
[1,1,0,0,1,0,1,0]
 => 1
[1,1,0,0,1,1,0,0]
 => 1
[1,1,0,1,0,0,1,0]
 => 0
[1,1,0,1,0,1,0,0]
 => 0
[1,1,0,1,1,0,0,0]
 => 0
[1,1,1,0,0,0,1,0]
 => 1
[1,1,1,0,0,1,0,0]
 => 0
[1,1,1,0,1,0,0,0]
 => 0
[1,1,1,1,0,0,0,0]
 => 0
[1,0,1,0,1,0,1,0,1,0]
 => 1
[1,0,1,0,1,0,1,1,0,0]
 => 1
[1,0,1,0,1,1,0,0,1,0]
 => 2
[1,0,1,0,1,1,0,1,0,0]
 => 2
[1,0,1,0,1,1,1,0,0,0]
 => 1
[1,0,1,1,0,0,1,0,1,0]
 => 2
[1,0,1,1,0,0,1,1,0,0]
 => 2
[1,0,1,1,0,1,0,0,1,0]
 => 2
[1,0,1,1,0,1,0,1,0,0]
 => 2
[1,0,1,1,0,1,1,0,0,0]
 => 2
[1,0,1,1,1,0,0,0,1,0]
 => 2
[1,0,1,1,1,0,0,1,0,0]
 => 1
[1,0,1,1,1,0,1,0,0,0]
 => 1
[1,0,1,1,1,1,0,0,0,0]
 => 1
[1,1,0,0,1,0,1,0,1,0]
 => 1
[1,1,0,0,1,0,1,1,0,0]
 => 1
[1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,0,1,1,0,1,0,0]
 => 2
[1,1,0,0,1,1,1,0,0,0]
 => 1
[1,1,0,1,0,0,1,0,1,0]
 => 0
[1,1,0,1,0,0,1,1,0,0]
 => 0
[1,1,0,1,0,1,0,0,1,0]
 => 0
[1,1,0,1,0,1,0,1,0,0]
 => 0
[1,1,0,1,0,1,1,0,0,0]
 => 0
[1,1,0,1,1,0,0,0,1,0]
 => 1
[1,1,0,1,1,0,0,1,0,0]
 => 1
[1,1,0,1,1,0,1,0,0,0]
 => 1
[1,1,0,1,1,1,0,0,0,0]
 => 0

Description

Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module.

Matching statistic: St000884
(load all 71 compositions to match this statistic)

Mapping

Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
St000884: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[1,0]
 => [1] => 0
[1,0,1,0]
 => [1,2] => 0
[1,1,0,0]
 => [2,1] => 1
[1,0,1,0,1,0]
 => [1,2,3] => 0
[1,0,1,1,0,0]
 => [1,3,2] => 1
[1,1,0,0,1,0]
 => [2,1,3] => 1
[1,1,0,1,0,0]
 => [2,3,1] => 1
[1,1,1,0,0,0]
 => [3,2,1] => 0
[1,0,1,0,1,0,1,0]
 => [1,2,3,4] => 0
[1,0,1,0,1,1,0,0]
 => [1,2,4,3] => 1
[1,0,1,1,0,0,1,0]
 => [1,3,2,4] => 1
[1,0,1,1,0,1,0,0]
 => [1,3,4,2] => 1
[1,0,1,1,1,0,0,0]
 => [1,4,3,2] => 0
[1,1,0,0,1,0,1,0]
 => [2,1,3,4] => 1
[1,1,0,0,1,1,0,0]
 => [2,1,4,3] => 2
[1,1,0,1,0,0,1,0]
 => [2,3,1,4] => 1
[1,1,0,1,0,1,0,0]
 => [2,3,4,1] => 1
[1,1,0,1,1,0,0,0]
 => [2,4,3,1] => 0
[1,1,1,0,0,0,1,0]
 => [3,2,1,4] => 0
[1,1,1,0,0,1,0,0]
 => [3,2,4,1] => 2
[1,1,1,0,1,0,0,0]
 => [3,4,2,1] => 0
[1,1,1,1,0,0,0,0]
 => [4,3,2,1] => 0
[1,0,1,0,1,0,1,0,1,0]
 => [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,1,0,0]
 => [1,2,3,5,4] => 1
[1,0,1,0,1,1,0,0,1,0]
 => [1,2,4,3,5] => 1
[1,0,1,0,1,1,0,1,0,0]
 => [1,2,4,5,3] => 1
[1,0,1,0,1,1,1,0,0,0]
 => [1,2,5,4,3] => 0
[1,0,1,1,0,0,1,0,1,0]
 => [1,3,2,4,5] => 1
[1,0,1,1,0,0,1,1,0,0]
 => [1,3,2,5,4] => 2
[1,0,1,1,0,1,0,0,1,0]
 => [1,3,4,2,5] => 1
[1,0,1,1,0,1,0,1,0,0]
 => [1,3,4,5,2] => 1
[1,0,1,1,0,1,1,0,0,0]
 => [1,3,5,4,2] => 0
[1,0,1,1,1,0,0,0,1,0]
 => [1,4,3,2,5] => 0
[1,0,1,1,1,0,0,1,0,0]
 => [1,4,3,5,2] => 2
[1,0,1,1,1,0,1,0,0,0]
 => [1,4,5,3,2] => 0
[1,0,1,1,1,1,0,0,0,0]
 => [1,5,4,3,2] => 0
[1,1,0,0,1,0,1,0,1,0]
 => [2,1,3,4,5] => 1
[1,1,0,0,1,0,1,1,0,0]
 => [2,1,3,5,4] => 2
[1,1,0,0,1,1,0,0,1,0]
 => [2,1,4,3,5] => 2
[1,1,0,0,1,1,0,1,0,0]
 => [2,1,4,5,3] => 2
[1,1,0,0,1,1,1,0,0,0]
 => [2,1,5,4,3] => 1
[1,1,0,1,0,0,1,0,1,0]
 => [2,3,1,4,5] => 1
[1,1,0,1,0,0,1,1,0,0]
 => [2,3,1,5,4] => 2
[1,1,0,1,0,1,0,0,1,0]
 => [2,3,4,1,5] => 1
[1,1,0,1,0,1,0,1,0,0]
 => [2,3,4,5,1] => 1
[1,1,0,1,0,1,1,0,0,0]
 => [2,3,5,4,1] => 0
[1,1,0,1,1,0,0,0,1,0]
 => [2,4,3,1,5] => 0
[1,1,0,1,1,0,0,1,0,0]
 => [2,4,3,5,1] => 2
[1,1,0,1,1,0,1,0,0,0]
 => [2,4,5,3,1] => 0
[1,1,0,1,1,1,0,0,0,0]
 => [2,5,4,3,1] => 0

Description

The number of isolated descents of a permutation. A descent

$i$ is isolated if neither

$i+1$ nor

$i-1$ are descents. If a permutation has only isolated descents, then it is called primitive in [1].

Matching statistic: St000214
(load all 4 compositions to match this statistic)

Mapping

Mp00035: Dyck paths —to alternating sign matrix⟶ Alternating sign matrices
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
St000214: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[1,0]
 => [[1]]
 => [1] => 0
[1,0,1,0]
 => [[1,0],[0,1]]
 => [1,2] => 0
[1,1,0,0]
 => [[0,1],[1,0]]
 => [2,1] => 1
[1,0,1,0,1,0]
 => [[1,0,0],[0,1,0],[0,0,1]]
 => [1,2,3] => 0
[1,0,1,1,0,0]
 => [[1,0,0],[0,0,1],[0,1,0]]
 => [1,3,2] => 1
[1,1,0,0,1,0]
 => [[0,1,0],[1,0,0],[0,0,1]]
 => [2,1,3] => 1
[1,1,0,1,0,0]
 => [[0,1,0],[1,-1,1],[0,1,0]]
 => [1,3,2] => 1
[1,1,1,0,0,0]
 => [[0,0,1],[1,0,0],[0,1,0]]
 => [3,1,2] => 0
[1,0,1,0,1,0,1,0]
 => [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
 => [1,2,3,4] => 0
[1,0,1,0,1,1,0,0]
 => [[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]]
 => [1,2,4,3] => 1
[1,0,1,1,0,0,1,0]
 => [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]]
 => [1,3,2,4] => 1
[1,0,1,1,0,1,0,0]
 => [[1,0,0,0],[0,0,1,0],[0,1,-1,1],[0,0,1,0]]
 => [1,2,4,3] => 1
[1,0,1,1,1,0,0,0]
 => [[1,0,0,0],[0,0,0,1],[0,1,0,0],[0,0,1,0]]
 => [1,4,2,3] => 0
[1,1,0,0,1,0,1,0]
 => [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
 => [2,1,3,4] => 1
[1,1,0,0,1,1,0,0]
 => [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
 => [2,1,4,3] => 2
[1,1,0,1,0,0,1,0]
 => [[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]]
 => [1,3,2,4] => 1
[1,1,0,1,0,1,0,0]
 => [[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
 => [1,2,4,3] => 1
[1,1,0,1,1,0,0,0]
 => [[0,1,0,0],[1,-1,0,1],[0,1,0,0],[0,0,1,0]]
 => [1,4,2,3] => 0
[1,1,1,0,0,0,1,0]
 => [[0,0,1,0],[1,0,0,0],[0,1,0,0],[0,0,0,1]]
 => [3,1,2,4] => 0
[1,1,1,0,0,1,0,0]
 => [[0,0,1,0],[1,0,0,0],[0,1,-1,1],[0,0,1,0]]
 => [2,1,4,3] => 2
[1,1,1,0,1,0,0,0]
 => [[0,0,1,0],[1,0,-1,1],[0,1,0,0],[0,0,1,0]]
 => [1,4,2,3] => 0
[1,1,1,1,0,0,0,0]
 => [[0,0,0,1],[1,0,0,0],[0,1,0,0],[0,0,1,0]]
 => [4,1,2,3] => 0
[1,0,1,0,1,0,1,0,1,0]
 => [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
 => [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,1,0,0]
 => [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
 => [1,2,3,5,4] => 1
[1,0,1,0,1,1,0,0,1,0]
 => [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
 => [1,2,4,3,5] => 1
[1,0,1,0,1,1,0,1,0,0]
 => [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
 => [1,2,3,5,4] => 1
[1,0,1,0,1,1,1,0,0,0]
 => [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
 => [1,2,5,3,4] => 0
[1,0,1,1,0,0,1,0,1,0]
 => [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
 => [1,3,2,4,5] => 1
[1,0,1,1,0,0,1,1,0,0]
 => [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
 => [1,3,2,5,4] => 2
[1,0,1,1,0,1,0,0,1,0]
 => [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
 => [1,2,4,3,5] => 1
[1,0,1,1,0,1,0,1,0,0]
 => [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
 => [1,2,3,5,4] => 1
[1,0,1,1,0,1,1,0,0,0]
 => [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
 => [1,2,5,3,4] => 0
[1,0,1,1,1,0,0,0,1,0]
 => [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
 => [1,4,2,3,5] => 0
[1,0,1,1,1,0,0,1,0,0]
 => [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
 => [1,3,2,5,4] => 2
[1,0,1,1,1,0,1,0,0,0]
 => [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
 => [1,2,5,3,4] => 0
[1,0,1,1,1,1,0,0,0,0]
 => [[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
 => [1,5,2,3,4] => 0
[1,1,0,0,1,0,1,0,1,0]
 => [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
 => [2,1,3,4,5] => 1
[1,1,0,0,1,0,1,1,0,0]
 => [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
 => [2,1,3,5,4] => 2
[1,1,0,0,1,1,0,0,1,0]
 => [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
 => [2,1,4,3,5] => 2
[1,1,0,0,1,1,0,1,0,0]
 => [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
 => [2,1,3,5,4] => 2
[1,1,0,0,1,1,1,0,0,0]
 => [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
 => [2,1,5,3,4] => 1
[1,1,0,1,0,0,1,0,1,0]
 => [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
 => [1,3,2,4,5] => 1
[1,1,0,1,0,0,1,1,0,0]
 => [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
 => [1,3,2,5,4] => 2
[1,1,0,1,0,1,0,0,1,0]
 => [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
 => [1,2,4,3,5] => 1
[1,1,0,1,0,1,0,1,0,0]
 => [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
 => [1,2,3,5,4] => 1
[1,1,0,1,0,1,1,0,0,0]
 => [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
 => [1,2,5,3,4] => 0
[1,1,0,1,1,0,0,0,1,0]
 => [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
 => [1,4,2,3,5] => 0
[1,1,0,1,1,0,0,1,0,0]
 => [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
 => [1,3,2,5,4] => 2
[1,1,0,1,1,0,1,0,0,0]
 => [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
 => [1,2,5,3,4] => 0
[1,1,0,1,1,1,0,0,0,0]
 => [[0,1,0,0,0],[1,-1,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
 => [1,5,2,3,4] => 0

Description

The number of adjacencies of a permutation. An adjacency of a permutation

$\pi$ is an index

$i$ such that

$\pi(i)-1 = \pi(i+1)$ . Adjacencies are also known as ''small descents''. This can be also described as an occurrence of the bivincular pattern ([2,1], {((0,1),(1,0),(1,1),(1,2),(2,1)}), i.e., the middle row and the middle column are shaded, see [3].

Matching statistic: St000237
(load all 2 compositions to match this statistic)

Mapping

Mp00035: Dyck paths —to alternating sign matrix⟶ Alternating sign matrices
Mp00002: Alternating sign matrices —to left key permutation⟶ Permutations
St000237: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[1,0]
 => [[1]]
 => [1] => 0
[1,0,1,0]
 => [[1,0],[0,1]]
 => [1,2] => 0
[1,1,0,0]
 => [[0,1],[1,0]]
 => [2,1] => 1
[1,0,1,0,1,0]
 => [[1,0,0],[0,1,0],[0,0,1]]
 => [1,2,3] => 0
[1,0,1,1,0,0]
 => [[1,0,0],[0,0,1],[0,1,0]]
 => [1,3,2] => 1
[1,1,0,0,1,0]
 => [[0,1,0],[1,0,0],[0,0,1]]
 => [2,1,3] => 1
[1,1,0,1,0,0]
 => [[0,1,0],[1,-1,1],[0,1,0]]
 => [1,3,2] => 1
[1,1,1,0,0,0]
 => [[0,0,1],[1,0,0],[0,1,0]]
 => [3,1,2] => 0
[1,0,1,0,1,0,1,0]
 => [[1,0,0,0],[0,1,0,0],[0,0,1,0],[0,0,0,1]]
 => [1,2,3,4] => 0
[1,0,1,0,1,1,0,0]
 => [[1,0,0,0],[0,1,0,0],[0,0,0,1],[0,0,1,0]]
 => [1,2,4,3] => 1
[1,0,1,1,0,0,1,0]
 => [[1,0,0,0],[0,0,1,0],[0,1,0,0],[0,0,0,1]]
 => [1,3,2,4] => 1
[1,0,1,1,0,1,0,0]
 => [[1,0,0,0],[0,0,1,0],[0,1,-1,1],[0,0,1,0]]
 => [1,2,4,3] => 1
[1,0,1,1,1,0,0,0]
 => [[1,0,0,0],[0,0,0,1],[0,1,0,0],[0,0,1,0]]
 => [1,4,2,3] => 0
[1,1,0,0,1,0,1,0]
 => [[0,1,0,0],[1,0,0,0],[0,0,1,0],[0,0,0,1]]
 => [2,1,3,4] => 1
[1,1,0,0,1,1,0,0]
 => [[0,1,0,0],[1,0,0,0],[0,0,0,1],[0,0,1,0]]
 => [2,1,4,3] => 2
[1,1,0,1,0,0,1,0]
 => [[0,1,0,0],[1,-1,1,0],[0,1,0,0],[0,0,0,1]]
 => [1,3,2,4] => 1
[1,1,0,1,0,1,0,0]
 => [[0,1,0,0],[1,-1,1,0],[0,1,-1,1],[0,0,1,0]]
 => [1,2,4,3] => 1
[1,1,0,1,1,0,0,0]
 => [[0,1,0,0],[1,-1,0,1],[0,1,0,0],[0,0,1,0]]
 => [1,4,2,3] => 0
[1,1,1,0,0,0,1,0]
 => [[0,0,1,0],[1,0,0,0],[0,1,0,0],[0,0,0,1]]
 => [3,1,2,4] => 0
[1,1,1,0,0,1,0,0]
 => [[0,0,1,0],[1,0,0,0],[0,1,-1,1],[0,0,1,0]]
 => [2,1,4,3] => 2
[1,1,1,0,1,0,0,0]
 => [[0,0,1,0],[1,0,-1,1],[0,1,0,0],[0,0,1,0]]
 => [1,4,2,3] => 0
[1,1,1,1,0,0,0,0]
 => [[0,0,0,1],[1,0,0,0],[0,1,0,0],[0,0,1,0]]
 => [4,1,2,3] => 0
[1,0,1,0,1,0,1,0,1,0]
 => [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
 => [1,2,3,4,5] => 0
[1,0,1,0,1,0,1,1,0,0]
 => [[1,0,0,0,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
 => [1,2,3,5,4] => 1
[1,0,1,0,1,1,0,0,1,0]
 => [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
 => [1,2,4,3,5] => 1
[1,0,1,0,1,1,0,1,0,0]
 => [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
 => [1,2,3,5,4] => 1
[1,0,1,0,1,1,1,0,0,0]
 => [[1,0,0,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
 => [1,2,5,3,4] => 0
[1,0,1,1,0,0,1,0,1,0]
 => [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
 => [1,3,2,4,5] => 1
[1,0,1,1,0,0,1,1,0,0]
 => [[1,0,0,0,0],[0,0,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
 => [1,3,2,5,4] => 2
[1,0,1,1,0,1,0,0,1,0]
 => [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
 => [1,2,4,3,5] => 1
[1,0,1,1,0,1,0,1,0,0]
 => [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
 => [1,2,3,5,4] => 1
[1,0,1,1,0,1,1,0,0,0]
 => [[1,0,0,0,0],[0,0,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
 => [1,2,5,3,4] => 0
[1,0,1,1,1,0,0,0,1,0]
 => [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
 => [1,4,2,3,5] => 0
[1,0,1,1,1,0,0,1,0,0]
 => [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
 => [1,3,2,5,4] => 2
[1,0,1,1,1,0,1,0,0,0]
 => [[1,0,0,0,0],[0,0,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
 => [1,2,5,3,4] => 0
[1,0,1,1,1,1,0,0,0,0]
 => [[1,0,0,0,0],[0,0,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
 => [1,5,2,3,4] => 0
[1,1,0,0,1,0,1,0,1,0]
 => [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,1,0],[0,0,0,0,1]]
 => [2,1,3,4,5] => 1
[1,1,0,0,1,0,1,1,0,0]
 => [[0,1,0,0,0],[1,0,0,0,0],[0,0,1,0,0],[0,0,0,0,1],[0,0,0,1,0]]
 => [2,1,3,5,4] => 2
[1,1,0,0,1,1,0,0,1,0]
 => [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,0,0],[0,0,0,0,1]]
 => [2,1,4,3,5] => 2
[1,1,0,0,1,1,0,1,0,0]
 => [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
 => [2,1,3,5,4] => 2
[1,1,0,0,1,1,1,0,0,0]
 => [[0,1,0,0,0],[1,0,0,0,0],[0,0,0,0,1],[0,0,1,0,0],[0,0,0,1,0]]
 => [2,1,5,3,4] => 1
[1,1,0,1,0,0,1,0,1,0]
 => [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,1,0],[0,0,0,0,1]]
 => [1,3,2,4,5] => 1
[1,1,0,1,0,0,1,1,0,0]
 => [[0,1,0,0,0],[1,-1,1,0,0],[0,1,0,0,0],[0,0,0,0,1],[0,0,0,1,0]]
 => [1,3,2,5,4] => 2
[1,1,0,1,0,1,0,0,1,0]
 => [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,0,0],[0,0,0,0,1]]
 => [1,2,4,3,5] => 1
[1,1,0,1,0,1,0,1,0,0]
 => [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,1,0],[0,0,1,-1,1],[0,0,0,1,0]]
 => [1,2,3,5,4] => 1
[1,1,0,1,0,1,1,0,0,0]
 => [[0,1,0,0,0],[1,-1,1,0,0],[0,1,-1,0,1],[0,0,1,0,0],[0,0,0,1,0]]
 => [1,2,5,3,4] => 0
[1,1,0,1,1,0,0,0,1,0]
 => [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,0,1]]
 => [1,4,2,3,5] => 0
[1,1,0,1,1,0,0,1,0,0]
 => [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,0,0],[0,0,1,-1,1],[0,0,0,1,0]]
 => [1,3,2,5,4] => 2
[1,1,0,1,1,0,1,0,0,0]
 => [[0,1,0,0,0],[1,-1,0,1,0],[0,1,0,-1,1],[0,0,1,0,0],[0,0,0,1,0]]
 => [1,2,5,3,4] => 0
[1,1,0,1,1,1,0,0,0,0]
 => [[0,1,0,0,0],[1,-1,0,0,1],[0,1,0,0,0],[0,0,1,0,0],[0,0,0,1,0]]
 => [1,5,2,3,4] => 0

Description

The number of small exceedances. This is the number of indices

$i$ such that

$\pi_i=i+1$ .

Matching statistic: St000658
(load all 33 compositions to match this statistic)

Mapping

Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00120: Dyck paths —Lalanne-Kreweras involution⟶ Dyck paths
St000658: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[1,0]
 => [1,1,0,0]
 => [1,0,1,0]
 => 0
[1,0,1,0]
 => [1,1,0,1,0,0]
 => [1,1,0,1,0,0]
 => 1
[1,1,0,0]
 => [1,1,1,0,0,0]
 => [1,0,1,0,1,0]
 => 0
[1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,0]
 => [1,1,1,0,1,0,0,0]
 => 0
[1,0,1,1,0,0]
 => [1,1,0,1,1,0,0,0]
 => [1,1,0,1,0,0,1,0]
 => 1
[1,1,0,0,1,0]
 => [1,1,1,0,0,1,0,0]
 => [1,0,1,1,0,1,0,0]
 => 1
[1,1,0,1,0,0]
 => [1,1,1,0,1,0,0,0]
 => [1,1,0,1,0,1,0,0]
 => 1
[1,1,1,0,0,0]
 => [1,1,1,1,0,0,0,0]
 => [1,0,1,0,1,0,1,0]
 => 0
[1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => [1,1,1,1,0,1,0,0,0,0]
 => 0
[1,0,1,0,1,1,0,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => [1,1,1,0,1,0,0,0,1,0]
 => 0
[1,0,1,1,0,0,1,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => [1,1,0,1,1,0,0,1,0,0]
 => 2
[1,0,1,1,0,1,0,0]
 => [1,1,0,1,1,0,1,0,0,0]
 => [1,1,1,0,1,0,0,1,0,0]
 => 0
[1,0,1,1,1,0,0,0]
 => [1,1,0,1,1,1,0,0,0,0]
 => [1,1,0,1,0,0,1,0,1,0]
 => 1
[1,1,0,0,1,0,1,0]
 => [1,1,1,0,0,1,0,1,0,0]
 => [1,0,1,1,1,0,1,0,0,0]
 => 0
[1,1,0,0,1,1,0,0]
 => [1,1,1,0,0,1,1,0,0,0]
 => [1,0,1,1,0,1,0,0,1,0]
 => 1
[1,1,0,1,0,0,1,0]
 => [1,1,1,0,1,0,0,1,0,0]
 => [1,1,0,1,1,0,1,0,0,0]
 => 2
[1,1,0,1,0,1,0,0]
 => [1,1,1,0,1,0,1,0,0,0]
 => [1,1,1,0,1,0,1,0,0,0]
 => 0
[1,1,0,1,1,0,0,0]
 => [1,1,1,0,1,1,0,0,0,0]
 => [1,1,0,1,0,1,0,0,1,0]
 => 1
[1,1,1,0,0,0,1,0]
 => [1,1,1,1,0,0,0,1,0,0]
 => [1,0,1,0,1,1,0,1,0,0]
 => 1
[1,1,1,0,0,1,0,0]
 => [1,1,1,1,0,0,1,0,0,0]
 => [1,0,1,1,0,1,0,1,0,0]
 => 1
[1,1,1,0,1,0,0,0]
 => [1,1,1,1,0,1,0,0,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 1
[1,1,1,1,0,0,0,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => [1,0,1,0,1,0,1,0,1,0]
 => 0
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,0,1,0,1,0,1,0,1,0,0]
 => [1,1,1,1,1,0,1,0,0,0,0,0]
 => 0
[1,0,1,0,1,0,1,1,0,0]
 => [1,1,0,1,0,1,0,1,1,0,0,0]
 => [1,1,1,1,0,1,0,0,0,0,1,0]
 => 0
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,1,0,0]
 => [1,1,1,0,1,1,0,0,0,1,0,0]
 => 1
[1,0,1,0,1,1,0,1,0,0]
 => [1,1,0,1,0,1,1,0,1,0,0,0]
 => [1,1,1,1,0,1,0,0,0,1,0,0]
 => 0
[1,0,1,0,1,1,1,0,0,0]
 => [1,1,0,1,0,1,1,1,0,0,0,0]
 => [1,1,1,0,1,0,0,0,1,0,1,0]
 => 0
[1,0,1,1,0,0,1,0,1,0]
 => [1,1,0,1,1,0,0,1,0,1,0,0]
 => [1,1,0,1,1,1,0,0,1,0,0,0]
 => 1
[1,0,1,1,0,0,1,1,0,0]
 => [1,1,0,1,1,0,0,1,1,0,0,0]
 => [1,1,0,1,1,0,0,1,0,0,1,0]
 => 2
[1,0,1,1,0,1,0,0,1,0]
 => [1,1,0,1,1,0,1,0,0,1,0,0]
 => [1,1,1,0,1,1,0,0,1,0,0,0]
 => 1
[1,0,1,1,0,1,0,1,0,0]
 => [1,1,0,1,1,0,1,0,1,0,0,0]
 => [1,1,1,1,0,1,0,0,1,0,0,0]
 => 0
[1,0,1,1,0,1,1,0,0,0]
 => [1,1,0,1,1,0,1,1,0,0,0,0]
 => [1,1,1,0,1,0,0,1,0,0,1,0]
 => 0
[1,0,1,1,1,0,0,0,1,0]
 => [1,1,0,1,1,1,0,0,0,1,0,0]
 => [1,1,0,1,0,0,1,1,0,1,0,0]
 => 2
[1,0,1,1,1,0,0,1,0,0]
 => [1,1,0,1,1,1,0,0,1,0,0,0]
 => [1,1,0,1,1,0,0,1,0,1,0,0]
 => 2
[1,0,1,1,1,0,1,0,0,0]
 => [1,1,0,1,1,1,0,1,0,0,0,0]
 => [1,1,1,0,1,0,0,1,0,1,0,0]
 => 0
[1,0,1,1,1,1,0,0,0,0]
 => [1,1,0,1,1,1,1,0,0,0,0,0]
 => [1,1,0,1,0,0,1,0,1,0,1,0]
 => 1
[1,1,0,0,1,0,1,0,1,0]
 => [1,1,1,0,0,1,0,1,0,1,0,0]
 => [1,0,1,1,1,1,0,1,0,0,0,0]
 => 0
[1,1,0,0,1,0,1,1,0,0]
 => [1,1,1,0,0,1,0,1,1,0,0,0]
 => [1,0,1,1,1,0,1,0,0,0,1,0]
 => 0
[1,1,0,0,1,1,0,0,1,0]
 => [1,1,1,0,0,1,1,0,0,1,0,0]
 => [1,0,1,1,0,1,1,0,0,1,0,0]
 => 2
[1,1,0,0,1,1,0,1,0,0]
 => [1,1,1,0,0,1,1,0,1,0,0,0]
 => [1,0,1,1,1,0,1,0,0,1,0,0]
 => 0
[1,1,0,0,1,1,1,0,0,0]
 => [1,1,1,0,0,1,1,1,0,0,0,0]
 => [1,0,1,1,0,1,0,0,1,0,1,0]
 => 1
[1,1,0,1,0,0,1,0,1,0]
 => [1,1,1,0,1,0,0,1,0,1,0,0]
 => [1,1,0,1,1,1,0,1,0,0,0,0]
 => 1
[1,1,0,1,0,0,1,1,0,0]
 => [1,1,1,0,1,0,0,1,1,0,0,0]
 => [1,1,0,1,1,0,1,0,0,0,1,0]
 => 2
[1,1,0,1,0,1,0,0,1,0]
 => [1,1,1,0,1,0,1,0,0,1,0,0]
 => [1,1,1,0,1,1,0,1,0,0,0,0]
 => 1
[1,1,0,1,0,1,0,1,0,0]
 => [1,1,1,0,1,0,1,0,1,0,0,0]
 => [1,1,1,1,0,1,0,1,0,0,0,0]
 => 0
[1,1,0,1,0,1,1,0,0,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => [1,1,1,0,1,0,1,0,0,0,1,0]
 => 0
[1,1,0,1,1,0,0,0,1,0]
 => [1,1,1,0,1,1,0,0,0,1,0,0]
 => [1,1,0,1,0,1,1,0,0,1,0,0]
 => 2
[1,1,0,1,1,0,0,1,0,0]
 => [1,1,1,0,1,1,0,0,1,0,0,0]
 => [1,1,0,1,1,0,1,0,0,1,0,0]
 => 2
[1,1,0,1,1,0,1,0,0,0]
 => [1,1,1,0,1,1,0,1,0,0,0,0]
 => [1,1,1,0,1,0,1,0,0,1,0,0]
 => 0
[1,1,0,1,1,1,0,0,0,0]
 => [1,1,1,0,1,1,1,0,0,0,0,0]
 => [1,1,0,1,0,1,0,0,1,0,1,0]
 => 1

Description

The number of rises of length 2 of a Dyck path. This is also the number of

$(1,1)$ steps of the associated Łukasiewicz path, see [1]. A related statistic is the number of double rises in a Dyck path, [[St000024]].

Matching statistic: St001125
(load all 5 compositions to match this statistic)

Mapping

Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001125: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[1,0]
 => [1] => [1,0]
 => 0
[1,0,1,0]
 => [1,1] => [1,0,1,0]
 => 1
[1,1,0,0]
 => [2] => [1,1,0,0]
 => 0
[1,0,1,0,1,0]
 => [1,1,1] => [1,0,1,0,1,0]
 => 0
[1,0,1,1,0,0]
 => [1,2] => [1,0,1,1,0,0]
 => 1
[1,1,0,0,1,0]
 => [2,1] => [1,1,0,0,1,0]
 => 1
[1,1,0,1,0,0]
 => [2,1] => [1,1,0,0,1,0]
 => 1
[1,1,1,0,0,0]
 => [3] => [1,1,1,0,0,0]
 => 0
[1,0,1,0,1,0,1,0]
 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 0
[1,0,1,0,1,1,0,0]
 => [1,1,2] => [1,0,1,0,1,1,0,0]
 => 0
[1,0,1,1,0,0,1,0]
 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 2
[1,0,1,1,0,1,0,0]
 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 2
[1,0,1,1,1,0,0,0]
 => [1,3] => [1,0,1,1,1,0,0,0]
 => 1
[1,1,0,0,1,0,1,0]
 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 0
[1,1,0,0,1,1,0,0]
 => [2,2] => [1,1,0,0,1,1,0,0]
 => 1
[1,1,0,1,0,0,1,0]
 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 0
[1,1,0,1,0,1,0,0]
 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 0
[1,1,0,1,1,0,0,0]
 => [2,2] => [1,1,0,0,1,1,0,0]
 => 1
[1,1,1,0,0,0,1,0]
 => [3,1] => [1,1,1,0,0,0,1,0]
 => 1
[1,1,1,0,0,1,0,0]
 => [3,1] => [1,1,1,0,0,0,1,0]
 => 1
[1,1,1,0,1,0,0,0]
 => [3,1] => [1,1,1,0,0,0,1,0]
 => 1
[1,1,1,1,0,0,0,0]
 => [4] => [1,1,1,1,0,0,0,0]
 => 0
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => 0
[1,0,1,0,1,0,1,1,0,0]
 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
 => 0
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => 1
[1,0,1,0,1,1,0,1,0,0]
 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => 1
[1,0,1,0,1,1,1,0,0,0]
 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
 => 0
[1,0,1,1,0,0,1,0,1,0]
 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 1
[1,0,1,1,0,0,1,1,0,0]
 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 2
[1,0,1,1,0,1,0,0,1,0]
 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 1
[1,0,1,1,0,1,0,1,0,0]
 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 1
[1,0,1,1,0,1,1,0,0,0]
 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 2
[1,0,1,1,1,0,0,0,1,0]
 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2
[1,0,1,1,1,0,0,1,0,0]
 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2
[1,0,1,1,1,0,1,0,0,0]
 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2
[1,0,1,1,1,1,0,0,0,0]
 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => 1
[1,1,0,0,1,0,1,0,1,0]
 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 0
[1,1,0,0,1,0,1,1,0,0]
 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 0
[1,1,0,0,1,1,0,0,1,0]
 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,0,1,1,0,1,0,0]
 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,0,1,1,1,0,0,0]
 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => 1
[1,1,0,1,0,0,1,0,1,0]
 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 0
[1,1,0,1,0,0,1,1,0,0]
 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 0
[1,1,0,1,0,1,0,0,1,0]
 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 0
[1,1,0,1,0,1,0,1,0,0]
 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 0
[1,1,0,1,0,1,1,0,0,0]
 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 0
[1,1,0,1,1,0,0,0,1,0]
 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,1,1,0,0,1,0,0]
 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,1,1,0,1,0,0,0]
 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,1,1,1,0,0,0,0]
 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => 1

Description

The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra.

Matching statistic: St001216
(load all 3 compositions to match this statistic)

Mapping

Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001216: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[1,0]
 => [1] => [1,0]
 => 0
[1,0,1,0]
 => [1,1] => [1,0,1,0]
 => 1
[1,1,0,0]
 => [2] => [1,1,0,0]
 => 0
[1,0,1,0,1,0]
 => [1,1,1] => [1,0,1,0,1,0]
 => 0
[1,0,1,1,0,0]
 => [1,2] => [1,0,1,1,0,0]
 => 1
[1,1,0,0,1,0]
 => [2,1] => [1,1,0,0,1,0]
 => 1
[1,1,0,1,0,0]
 => [2,1] => [1,1,0,0,1,0]
 => 1
[1,1,1,0,0,0]
 => [3] => [1,1,1,0,0,0]
 => 0
[1,0,1,0,1,0,1,0]
 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 0
[1,0,1,0,1,1,0,0]
 => [1,1,2] => [1,0,1,0,1,1,0,0]
 => 0
[1,0,1,1,0,0,1,0]
 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 2
[1,0,1,1,0,1,0,0]
 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 2
[1,0,1,1,1,0,0,0]
 => [1,3] => [1,0,1,1,1,0,0,0]
 => 1
[1,1,0,0,1,0,1,0]
 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 0
[1,1,0,0,1,1,0,0]
 => [2,2] => [1,1,0,0,1,1,0,0]
 => 1
[1,1,0,1,0,0,1,0]
 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 0
[1,1,0,1,0,1,0,0]
 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 0
[1,1,0,1,1,0,0,0]
 => [2,2] => [1,1,0,0,1,1,0,0]
 => 1
[1,1,1,0,0,0,1,0]
 => [3,1] => [1,1,1,0,0,0,1,0]
 => 1
[1,1,1,0,0,1,0,0]
 => [3,1] => [1,1,1,0,0,0,1,0]
 => 1
[1,1,1,0,1,0,0,0]
 => [3,1] => [1,1,1,0,0,0,1,0]
 => 1
[1,1,1,1,0,0,0,0]
 => [4] => [1,1,1,1,0,0,0,0]
 => 0
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => 0
[1,0,1,0,1,0,1,1,0,0]
 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
 => 0
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => 1
[1,0,1,0,1,1,0,1,0,0]
 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => 1
[1,0,1,0,1,1,1,0,0,0]
 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
 => 0
[1,0,1,1,0,0,1,0,1,0]
 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 1
[1,0,1,1,0,0,1,1,0,0]
 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 2
[1,0,1,1,0,1,0,0,1,0]
 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 1
[1,0,1,1,0,1,0,1,0,0]
 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 1
[1,0,1,1,0,1,1,0,0,0]
 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 2
[1,0,1,1,1,0,0,0,1,0]
 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2
[1,0,1,1,1,0,0,1,0,0]
 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2
[1,0,1,1,1,0,1,0,0,0]
 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2
[1,0,1,1,1,1,0,0,0,0]
 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => 1
[1,1,0,0,1,0,1,0,1,0]
 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 0
[1,1,0,0,1,0,1,1,0,0]
 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 0
[1,1,0,0,1,1,0,0,1,0]
 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,0,1,1,0,1,0,0]
 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,0,1,1,1,0,0,0]
 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => 1
[1,1,0,1,0,0,1,0,1,0]
 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 0
[1,1,0,1,0,0,1,1,0,0]
 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 0
[1,1,0,1,0,1,0,0,1,0]
 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 0
[1,1,0,1,0,1,0,1,0,0]
 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 0
[1,1,0,1,0,1,1,0,0,0]
 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 0
[1,1,0,1,1,0,0,0,1,0]
 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,1,1,0,0,1,0,0]
 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,1,1,0,1,0,0,0]
 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,1,1,1,0,0,0,0]
 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => 1

Description

The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module.

Matching statistic: St001230
(load all 4 compositions to match this statistic)

Mapping

Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001230: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[1,0]
 => [1] => [1,0]
 => 0
[1,0,1,0]
 => [1,1] => [1,0,1,0]
 => 1
[1,1,0,0]
 => [2] => [1,1,0,0]
 => 0
[1,0,1,0,1,0]
 => [1,1,1] => [1,0,1,0,1,0]
 => 0
[1,0,1,1,0,0]
 => [1,2] => [1,0,1,1,0,0]
 => 1
[1,1,0,0,1,0]
 => [2,1] => [1,1,0,0,1,0]
 => 1
[1,1,0,1,0,0]
 => [2,1] => [1,1,0,0,1,0]
 => 1
[1,1,1,0,0,0]
 => [3] => [1,1,1,0,0,0]
 => 0
[1,0,1,0,1,0,1,0]
 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 0
[1,0,1,0,1,1,0,0]
 => [1,1,2] => [1,0,1,0,1,1,0,0]
 => 0
[1,0,1,1,0,0,1,0]
 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 2
[1,0,1,1,0,1,0,0]
 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 2
[1,0,1,1,1,0,0,0]
 => [1,3] => [1,0,1,1,1,0,0,0]
 => 1
[1,1,0,0,1,0,1,0]
 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 0
[1,1,0,0,1,1,0,0]
 => [2,2] => [1,1,0,0,1,1,0,0]
 => 1
[1,1,0,1,0,0,1,0]
 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 0
[1,1,0,1,0,1,0,0]
 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 0
[1,1,0,1,1,0,0,0]
 => [2,2] => [1,1,0,0,1,1,0,0]
 => 1
[1,1,1,0,0,0,1,0]
 => [3,1] => [1,1,1,0,0,0,1,0]
 => 1
[1,1,1,0,0,1,0,0]
 => [3,1] => [1,1,1,0,0,0,1,0]
 => 1
[1,1,1,0,1,0,0,0]
 => [3,1] => [1,1,1,0,0,0,1,0]
 => 1
[1,1,1,1,0,0,0,0]
 => [4] => [1,1,1,1,0,0,0,0]
 => 0
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => 0
[1,0,1,0,1,0,1,1,0,0]
 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
 => 0
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => 1
[1,0,1,0,1,1,0,1,0,0]
 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => 1
[1,0,1,0,1,1,1,0,0,0]
 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
 => 0
[1,0,1,1,0,0,1,0,1,0]
 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 1
[1,0,1,1,0,0,1,1,0,0]
 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 2
[1,0,1,1,0,1,0,0,1,0]
 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 1
[1,0,1,1,0,1,0,1,0,0]
 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 1
[1,0,1,1,0,1,1,0,0,0]
 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 2
[1,0,1,1,1,0,0,0,1,0]
 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2
[1,0,1,1,1,0,0,1,0,0]
 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2
[1,0,1,1,1,0,1,0,0,0]
 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2
[1,0,1,1,1,1,0,0,0,0]
 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => 1
[1,1,0,0,1,0,1,0,1,0]
 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 0
[1,1,0,0,1,0,1,1,0,0]
 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 0
[1,1,0,0,1,1,0,0,1,0]
 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,0,1,1,0,1,0,0]
 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,0,1,1,1,0,0,0]
 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => 1
[1,1,0,1,0,0,1,0,1,0]
 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 0
[1,1,0,1,0,0,1,1,0,0]
 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 0
[1,1,0,1,0,1,0,0,1,0]
 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 0
[1,1,0,1,0,1,0,1,0,0]
 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 0
[1,1,0,1,0,1,1,0,0,0]
 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 0
[1,1,0,1,1,0,0,0,1,0]
 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,1,1,0,0,1,0,0]
 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,1,1,0,1,0,0,0]
 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,1,1,1,0,0,0,0]
 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => 1

Description

The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property.

Matching statistic: St001274
(load all 3 compositions to match this statistic)

Mapping

Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001274: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[1,0]
 => [1] => [1,0]
 => 0
[1,0,1,0]
 => [1,1] => [1,0,1,0]
 => 1
[1,1,0,0]
 => [2] => [1,1,0,0]
 => 0
[1,0,1,0,1,0]
 => [1,1,1] => [1,0,1,0,1,0]
 => 0
[1,0,1,1,0,0]
 => [1,2] => [1,0,1,1,0,0]
 => 1
[1,1,0,0,1,0]
 => [2,1] => [1,1,0,0,1,0]
 => 1
[1,1,0,1,0,0]
 => [2,1] => [1,1,0,0,1,0]
 => 1
[1,1,1,0,0,0]
 => [3] => [1,1,1,0,0,0]
 => 0
[1,0,1,0,1,0,1,0]
 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 0
[1,0,1,0,1,1,0,0]
 => [1,1,2] => [1,0,1,0,1,1,0,0]
 => 0
[1,0,1,1,0,0,1,0]
 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 2
[1,0,1,1,0,1,0,0]
 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 2
[1,0,1,1,1,0,0,0]
 => [1,3] => [1,0,1,1,1,0,0,0]
 => 1
[1,1,0,0,1,0,1,0]
 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 0
[1,1,0,0,1,1,0,0]
 => [2,2] => [1,1,0,0,1,1,0,0]
 => 1
[1,1,0,1,0,0,1,0]
 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 0
[1,1,0,1,0,1,0,0]
 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 0
[1,1,0,1,1,0,0,0]
 => [2,2] => [1,1,0,0,1,1,0,0]
 => 1
[1,1,1,0,0,0,1,0]
 => [3,1] => [1,1,1,0,0,0,1,0]
 => 1
[1,1,1,0,0,1,0,0]
 => [3,1] => [1,1,1,0,0,0,1,0]
 => 1
[1,1,1,0,1,0,0,0]
 => [3,1] => [1,1,1,0,0,0,1,0]
 => 1
[1,1,1,1,0,0,0,0]
 => [4] => [1,1,1,1,0,0,0,0]
 => 0
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => 0
[1,0,1,0,1,0,1,1,0,0]
 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
 => 0
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => 1
[1,0,1,0,1,1,0,1,0,0]
 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => 1
[1,0,1,0,1,1,1,0,0,0]
 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
 => 0
[1,0,1,1,0,0,1,0,1,0]
 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 1
[1,0,1,1,0,0,1,1,0,0]
 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 2
[1,0,1,1,0,1,0,0,1,0]
 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 1
[1,0,1,1,0,1,0,1,0,0]
 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 1
[1,0,1,1,0,1,1,0,0,0]
 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 2
[1,0,1,1,1,0,0,0,1,0]
 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2
[1,0,1,1,1,0,0,1,0,0]
 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2
[1,0,1,1,1,0,1,0,0,0]
 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2
[1,0,1,1,1,1,0,0,0,0]
 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => 1
[1,1,0,0,1,0,1,0,1,0]
 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 0
[1,1,0,0,1,0,1,1,0,0]
 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 0
[1,1,0,0,1,1,0,0,1,0]
 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,0,1,1,0,1,0,0]
 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,0,1,1,1,0,0,0]
 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => 1
[1,1,0,1,0,0,1,0,1,0]
 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 0
[1,1,0,1,0,0,1,1,0,0]
 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 0
[1,1,0,1,0,1,0,0,1,0]
 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 0
[1,1,0,1,0,1,0,1,0,0]
 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 0
[1,1,0,1,0,1,1,0,0,0]
 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 0
[1,1,0,1,1,0,0,0,1,0]
 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,1,1,0,0,1,0,0]
 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,1,1,0,1,0,0,0]
 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,1,1,1,0,0,0,0]
 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => 1

Description

The number of indecomposable injective modules with projective dimension equal to two.

Matching statistic: St001276
(load all 3 compositions to match this statistic)

Mapping

Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001276: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[1,0]
 => [1] => [1,0]
 => 0
[1,0,1,0]
 => [1,1] => [1,0,1,0]
 => 1
[1,1,0,0]
 => [2] => [1,1,0,0]
 => 0
[1,0,1,0,1,0]
 => [1,1,1] => [1,0,1,0,1,0]
 => 0
[1,0,1,1,0,0]
 => [1,2] => [1,0,1,1,0,0]
 => 1
[1,1,0,0,1,0]
 => [2,1] => [1,1,0,0,1,0]
 => 1
[1,1,0,1,0,0]
 => [2,1] => [1,1,0,0,1,0]
 => 1
[1,1,1,0,0,0]
 => [3] => [1,1,1,0,0,0]
 => 0
[1,0,1,0,1,0,1,0]
 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 0
[1,0,1,0,1,1,0,0]
 => [1,1,2] => [1,0,1,0,1,1,0,0]
 => 0
[1,0,1,1,0,0,1,0]
 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 2
[1,0,1,1,0,1,0,0]
 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 2
[1,0,1,1,1,0,0,0]
 => [1,3] => [1,0,1,1,1,0,0,0]
 => 1
[1,1,0,0,1,0,1,0]
 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 0
[1,1,0,0,1,1,0,0]
 => [2,2] => [1,1,0,0,1,1,0,0]
 => 1
[1,1,0,1,0,0,1,0]
 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 0
[1,1,0,1,0,1,0,0]
 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 0
[1,1,0,1,1,0,0,0]
 => [2,2] => [1,1,0,0,1,1,0,0]
 => 1
[1,1,1,0,0,0,1,0]
 => [3,1] => [1,1,1,0,0,0,1,0]
 => 1
[1,1,1,0,0,1,0,0]
 => [3,1] => [1,1,1,0,0,0,1,0]
 => 1
[1,1,1,0,1,0,0,0]
 => [3,1] => [1,1,1,0,0,0,1,0]
 => 1
[1,1,1,1,0,0,0,0]
 => [4] => [1,1,1,1,0,0,0,0]
 => 0
[1,0,1,0,1,0,1,0,1,0]
 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => 0
[1,0,1,0,1,0,1,1,0,0]
 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
 => 0
[1,0,1,0,1,1,0,0,1,0]
 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => 1
[1,0,1,0,1,1,0,1,0,0]
 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => 1
[1,0,1,0,1,1,1,0,0,0]
 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
 => 0
[1,0,1,1,0,0,1,0,1,0]
 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 1
[1,0,1,1,0,0,1,1,0,0]
 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 2
[1,0,1,1,0,1,0,0,1,0]
 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 1
[1,0,1,1,0,1,0,1,0,0]
 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 1
[1,0,1,1,0,1,1,0,0,0]
 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 2
[1,0,1,1,1,0,0,0,1,0]
 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2
[1,0,1,1,1,0,0,1,0,0]
 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2
[1,0,1,1,1,0,1,0,0,0]
 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2
[1,0,1,1,1,1,0,0,0,0]
 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => 1
[1,1,0,0,1,0,1,0,1,0]
 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 0
[1,1,0,0,1,0,1,1,0,0]
 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 0
[1,1,0,0,1,1,0,0,1,0]
 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,0,1,1,0,1,0,0]
 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,0,1,1,1,0,0,0]
 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => 1
[1,1,0,1,0,0,1,0,1,0]
 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 0
[1,1,0,1,0,0,1,1,0,0]
 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 0
[1,1,0,1,0,1,0,0,1,0]
 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 0
[1,1,0,1,0,1,0,1,0,0]
 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 0
[1,1,0,1,0,1,1,0,0,0]
 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 0
[1,1,0,1,1,0,0,0,1,0]
 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,1,1,0,0,1,0,0]
 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,1,1,0,1,0,0,0]
 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
[1,1,0,1,1,1,0,0,0,0]
 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => 1

Description

The number of 2-regular indecomposable modules in the corresponding Nakayama algebra. Generalising the notion of k-regular modules from simple to arbitrary indecomposable modules, we call an indecomposable module

$M$ over an algebra

$A$ k-regular in case it has projective dimension k and

$Ext_A^i(M,A)=0$ for

$i \neq k$ and

$Ext_A^k(M,A)$ is 1-dimensional. The number of Dyck paths where the statistic returns 0 might be given by [[OEIS:A035929]] .

The following 217 statistics, ordered by result quality, also match your data. Click on any of them to see the details.

St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St001657The number of twos in an integer partition. St000441The number of successions of a permutation. St000665The number of rafts of a permutation. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. 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. St001479The number of bridges of a graph. St001484The number of singletons of an integer partition. St000011The number of touch points (or returns) of a Dyck path. St000542The number of left-to-right-minima of a permutation. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001461The number of topologically connected components of the chord diagram of a permutation. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St001061The number of indices that are both descents and recoils of a permutation. St001139The number of occurrences of hills of size 2 in a Dyck path. St000502The number of successions of a set partitions. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. 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. St000932The number of occurrences of the pattern UDU in a Dyck path. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000442The maximal area to the right of an up step of a Dyck path. St000885The number of critical steps in the Catalan decomposition of a binary word. St001008Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001010Number of indecomposable injective modules with projective dimension g-1 when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001017Number of indecomposable injective modules with projective dimension equal to the codominant dimension in the Nakayama algebra corresponding to the Dyck path. St001027Number of simple modules with projective dimension equal to injective dimension in the Nakayama algebra corresponding to the Dyck path. St001126Number of simple module that are 1-regular in the corresponding Nakayama algebra. 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. St001480The number of simple summands of the module J^2/J^3. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001955The number of natural descents for set-valued two row standard Young tableaux. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St000259The diameter of a connected graph. St000260The radius of a connected graph. St001632The number of indecomposable injective modules

$I$ with

$dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St000934The 2-degree of an integer partition. St000941The number of characters of the symmetric group whose value on the partition is even. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St000624The normalized sum of the minimal distances to a greater element. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000648The number of 2-excedences of a permutation. St000137The Grundy value of an integer partition. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St001280The number of parts of an integer partition that are at least two. St001587Half of the largest even part of an integer partition. St001593This is the number of standard Young tableaux of the given shifted shape. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000938The number of zeros of the symmetric group character corresponding to the partition. St001568The smallest positive integer that does not appear twice in the partition. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000659The number of rises of length at least 2 of a Dyck path. St000744The length of the path to the largest entry in a standard Young tableau. St000946The sum of the skew hook positions in a Dyck path. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001195The global dimension of the algebra

$A/AfA$ of the corresponding Nakayama algebra

$A$ with minimal left faithful projective-injective module

$Af$ . St001204Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series

$L=[c_0,c_1,...,c_{n−1}]$ such that

$n=c_0 < c_i$ for all

$i > 0$ a special CNakayama algebra. 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. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001651The Frankl number of a lattice. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000668The least common multiple of the parts of the partition. St000929The constant term of the character polynomial of an integer partition. St000940The number of characters of the symmetric group whose value on the partition is zero. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001128The exponens consonantiae of a partition. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St001960The number of descents of a permutation minus one if its first entry is not one. St000028The number of stack-sorts needed to sort a permutation. St000374The number of exclusive right-to-left minima of a permutation. St001877Number of indecomposable injective modules with projective dimension 2. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000456The monochromatic index of a connected graph. St000353The number of inner valleys of a permutation. St001114The number of odd descents of a permutation. St001388The number of non-attacking neighbors of a permutation. St001948The number of augmented double ascents of a permutation. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000460The hook length of the last cell along the main diagonal of an integer partition. St000618The number of self-evacuating tableaux of given shape. St000667The greatest common divisor of the parts of the partition. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000781The number of proper colouring schemes of a Ferrers diagram. St000870The product of the hook lengths of the diagonal cells in an integer partition. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001176The size of a partition minus its first part. St001199The dominant dimension of

$eAe$ for the corresponding Nakayama algebra

$A$ with minimal faithful projective-injective module

$eA$ . 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. 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. St001389The number of partitions of the same length below the given integer partition. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the 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. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001498The normalised height of a Nakayama algebra with magnitude 1. St001525The number of symmetric hooks on the diagonal of a partition. St001571The Cartan determinant of the integer partition. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. 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. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001924The number of cells in an integer partition whose arm and leg length coincide. St001933The largest multiplicity of a part in an integer partition. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. 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. St001961The sum of the greatest common divisors of all pairs of parts. St001118The acyclic chromatic index of a graph. St000845The maximal number of elements covered by an element in a poset. St000846The maximal number of elements covering an element of a poset. St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. St000633The size of the automorphism group of a poset. St000640The rank of the largest boolean interval in a poset. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000225Difference between largest and smallest parts in a partition. St000478Another weight of a partition according to Alladi. St000714The number of semistandard Young tableau of given shape, with entries at most 2. 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. St000993The multiplicity of the largest part of an integer partition. St001175The size of a partition minus the hook length of the base cell. St001383The BG-rank of an integer partition. St001586The number of odd parts smaller than the largest even part in an integer partition. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St000455The second largest eigenvalue of a graph if it is integral. St000145The Dyson rank of a partition. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000284The Plancherel distribution on integer partitions. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000567The sum of the products of all pairs of parts. St000681The Grundy value of Chomp on Ferrers diagrams. St000706The product of the factorials of the multiplicities of an integer partition. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000928The sum of the coefficients of the character polynomial of an integer partition. St000936The number of even values of the symmetric group character corresponding to the partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St000944The 3-degree of an integer partition. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. 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. 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. St001177Twice the mean value of the major index among all standard Young tableaux of a partition. St001178Twelve times the variance of the major index among all standard Young tableaux of a partition. St001248Sum of the even parts of a partition. 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. St001564The value of the forgotten symmetric functions when all variables set to 1. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001608The number of coloured rooted trees such that the multiplicities of colours are given by a partition. 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. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. 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. St000454The largest eigenvalue of a graph if it is integral. St000632The jump number of the poset. St000298The order dimension or Dushnik-Miller dimension of a poset. St000307The number of rowmotion orbits of a poset. St001096The size of the overlap set of a permutation. 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$ . St000741The Colin de Verdière graph invariant. St001820The size of the image of the pop stack sorting operator. St001330The hat guessing number of a graph. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St000891The number of distinct diagonal sums of a permutation matrix. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. 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. St000937The number of positive values of the symmetric group character corresponding to the partition. St001964The interval resolution global dimension of a poset. St001621The number of atoms of a lattice. St001414Half the length of the longest odd length palindromic prefix of a binary word. St000317The cycle descent number of a permutation. St000989The number of final rises of a permutation. St001423The number of distinct cubes in a binary word. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St000335The difference of lower and upper interactions. St001624The breadth of a lattice. St001115The number of even descents of a permutation. St000007The number of saliances of the permutation. 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$ . St000366The number of double descents of a permutation.