searching the database
Your data matches 51 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St001004
(load all 14 compositions to match this statistic)
(load all 14 compositions to match this statistic)
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St001004: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001004: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => 1
[1,0,1,0]
=> [1,2] => 2
[1,1,0,0]
=> [2,1] => 2
[1,0,1,0,1,0]
=> [1,2,3] => 3
[1,0,1,1,0,0]
=> [1,3,2] => 3
[1,1,0,0,1,0]
=> [2,1,3] => 3
[1,1,0,1,0,0]
=> [2,3,1] => 3
[1,1,1,0,0,0]
=> [3,2,1] => 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 4
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 4
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 4
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 4
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 3
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 4
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 4
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 4
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 4
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => 3
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 3
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 3
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => 2
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 5
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 5
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => 4
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 5
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 5
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => 5
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 5
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => 4
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => 4
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => 3
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 5
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => 5
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => 5
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => 5
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => 4
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 5
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => 5
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 5
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 5
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => 4
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => 4
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => 4
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => 3
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => 3
Description
The number of indices that are either left-to-right maxima or right-to-left minima.
The (bivariate) generating function for this statistic is (essentially) given in [1], the mid points of a $321$ pattern in the permutation are those elements which are neither left-to-right maxima nor a right-to-left minima, see [[St000371]] and [[St000372]].
Matching statistic: St001240
(load all 22 compositions to match this statistic)
(load all 22 compositions to match this statistic)
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
St001240: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
St001240: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> 2 = 1 + 1
[1,0,1,0]
=> [1,1,0,0]
=> 3 = 2 + 1
[1,1,0,0]
=> [1,0,1,0]
=> 3 = 2 + 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 4 = 3 + 1
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 3 = 2 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 4 = 3 + 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 5 = 4 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 4 = 3 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 4 = 3 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 3 = 2 + 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 6 = 5 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 6 = 5 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 6 = 5 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 6 = 5 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 6 = 5 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 6 = 5 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 6 = 5 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 4 = 3 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 6 = 5 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 6 = 5 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 6 = 5 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 6 = 5 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 6 = 5 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 6 = 5 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 6 = 5 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 4 = 3 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 4 = 3 + 1
Description
The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra
Matching statistic: St000314
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
St000314: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
St000314: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => 1
[1,0,1,0]
=> [1,2] => [1,2] => 2
[1,1,0,0]
=> [2,1] => [1,2] => 2
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => 3
[1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => 3
[1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => 3
[1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => 3
[1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => 4
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => 4
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => 4
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => 4
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,2,4,3] => 3
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => 4
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => 4
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => 4
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,2,3,4] => 4
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [1,2,4,3] => 3
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,3,2,4] => 3
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,3,4,2] => 3
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [1,4,2,3] => 2
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,4,2,3] => 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,4,5] => 5
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,3,4,5] => 5
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,3,5,4] => 4
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => 5
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,2,3,4,5] => 5
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,2,3,4,5] => 5
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,2,3,4,5] => 5
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,2,3,5,4] => 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,2,4,3,5] => 4
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,2,4,5,3] => 4
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,2,5,3,4] => 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,2,5,3,4] => 3
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => 5
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => 5
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [1,2,3,4,5] => 5
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [1,2,3,4,5] => 5
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [1,2,3,5,4] => 4
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,2,3,4,5] => 5
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [1,2,3,4,5] => 5
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [1,2,3,4,5] => 5
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => 5
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [1,2,3,5,4] => 4
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [1,2,4,3,5] => 4
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [1,2,4,5,3] => 4
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [1,2,5,3,4] => 3
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [1,2,5,3,4] => 3
Description
The number of left-to-right-maxima of a permutation.
An integer $\sigma_i$ in the one-line notation of a permutation $\sigma$ is a '''left-to-right-maximum''' if there does not exist a $j < i$ such that $\sigma_j > \sigma_i$.
This is also the number of weak exceedences of a permutation that are not mid-points of a decreasing subsequence of length 3, see [1] for more on the later description.
Matching statistic: St000011
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St000011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St000011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,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,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3 = 2 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 3 = 2 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,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,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,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,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 5 = 4 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> 4 = 3 + 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,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,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,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 5 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> 4 = 3 + 1
Description
The number of touch points (or returns) of a Dyck path.
This is the number of points, excluding the origin, where the Dyck path has height 0.
Matching statistic: St000007
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00064: Permutations —reverse⟶ Permutations
St000007: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00064: Permutations —reverse⟶ Permutations
St000007: Permutations ⟶ ℤ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]
=> [1,2] => [1,2] => [2,1] => 2
[1,1,0,0]
=> [2,1] => [1,2] => [2,1] => 2
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [3,2,1] => 3
[1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => [3,2,1] => 3
[1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => [3,2,1] => 3
[1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => [3,2,1] => 3
[1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => [2,3,1] => 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [4,3,2,1] => 4
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => [4,3,2,1] => 4
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => [4,3,2,1] => 4
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => [4,3,2,1] => 4
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,2,4,3] => [3,4,2,1] => 3
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => [4,3,2,1] => 4
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => [4,3,2,1] => 4
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => [4,3,2,1] => 4
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,2,3,4] => [4,3,2,1] => 4
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [1,2,4,3] => [3,4,2,1] => 3
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,3,2,4] => [4,2,3,1] => 3
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,3,4,2] => [2,4,3,1] => 3
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [1,4,2,3] => [3,2,4,1] => 2
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,4,2,3] => [3,2,4,1] => 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,3,5,4] => [4,5,3,2,1] => 4
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,2,3,5,4] => [4,5,3,2,1] => 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,2,4,3,5] => [5,3,4,2,1] => 4
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,2,4,5,3] => [3,5,4,2,1] => 4
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,2,5,3,4] => [4,3,5,2,1] => 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,2,5,3,4] => [4,3,5,2,1] => 3
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [1,2,3,5,4] => [4,5,3,2,1] => 4
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => [5,4,3,2,1] => 5
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [1,2,3,5,4] => [4,5,3,2,1] => 4
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [1,2,4,3,5] => [5,3,4,2,1] => 4
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [1,2,4,5,3] => [3,5,4,2,1] => 4
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [1,2,5,3,4] => [4,3,5,2,1] => 3
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [1,2,5,3,4] => [4,3,5,2,1] => 3
Description
The number of saliances of the permutation.
A saliance is a right-to-left maximum. This can be described as an occurrence of the mesh pattern $([1], {(1,1)})$, i.e., the upper right quadrant is shaded, see [1].
Matching statistic: St000015
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St000015: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00127: Permutations —left-to-right-maxima to Dyck path⟶ Dyck paths
St000015: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [1,0]
=> 1
[1,0,1,0]
=> [1,2] => [1,2] => [1,0,1,0]
=> 2
[1,1,0,0]
=> [2,1] => [1,2] => [1,0,1,0]
=> 2
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [1,0,1,0,1,0]
=> 3
[1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => [1,0,1,0,1,0]
=> 3
[1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => [1,0,1,0,1,0]
=> 3
[1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => [1,0,1,0,1,0]
=> 3
[1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => [1,0,1,1,0,0]
=> 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 4
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 4
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 4
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 4
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> 3
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 4
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 4
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 4
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 4
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> 3
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> 3
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,3,4,2] => [1,0,1,1,0,1,0,0]
=> 3
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> 2
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0]
=> 4
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0]
=> 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0]
=> 4
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,2,4,5,3] => [1,0,1,0,1,1,0,1,0,0]
=> 4
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0]
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0]
=> 3
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0]
=> 4
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0]
=> 4
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0]
=> 4
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [1,2,4,5,3] => [1,0,1,0,1,1,0,1,0,0]
=> 4
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [1,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0]
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [1,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0]
=> 3
Description
The number of peaks of a Dyck path.
Matching statistic: St000031
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00086: Permutations —first fundamental transformation⟶ Permutations
St000031: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00086: Permutations —first fundamental transformation⟶ Permutations
St000031: Permutations ⟶ ℤ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]
=> [1,2] => [1,2] => [1,2] => 2
[1,1,0,0]
=> [2,1] => [1,2] => [1,2] => 2
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [1,2,3] => 3
[1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => [1,2,3] => 3
[1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => [1,2,3] => 3
[1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => [1,2,3] => 3
[1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => [1,3,2] => 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [1,2,3,4] => 4
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => [1,2,3,4] => 4
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => [1,2,3,4] => 4
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => [1,2,3,4] => 4
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,2,4,3] => [1,2,4,3] => 3
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => [1,2,3,4] => 4
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => [1,2,3,4] => 4
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => [1,2,3,4] => 4
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,2,3,4] => [1,2,3,4] => 4
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [1,2,4,3] => [1,2,4,3] => 3
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,3,2,4] => [1,3,2,4] => 3
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,3,4,2] => [1,4,3,2] => 3
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [1,4,2,3] => [1,3,4,2] => 2
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,4,2,3] => [1,3,4,2] => 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,3,5,4] => [1,2,3,5,4] => 4
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,2,3,5,4] => [1,2,3,5,4] => 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,2,4,3,5] => [1,2,4,3,5] => 4
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,2,4,5,3] => [1,2,5,4,3] => 4
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,2,5,3,4] => [1,2,4,5,3] => 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,2,5,3,4] => [1,2,4,5,3] => 3
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [1,2,3,5,4] => [1,2,3,5,4] => 4
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => [1,2,3,4,5] => 5
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [1,2,3,5,4] => [1,2,3,5,4] => 4
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [1,2,4,3,5] => [1,2,4,3,5] => 4
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [1,2,4,5,3] => [1,2,5,4,3] => 4
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [1,2,5,3,4] => [1,2,4,5,3] => 3
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [1,2,5,3,4] => [1,2,4,5,3] => 3
Description
The number of cycles in the cycle decomposition of a permutation.
Matching statistic: St000160
Mp00232: Dyck paths —parallelogram poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00044: Integer partitions —conjugate⟶ Integer partitions
St000160: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00044: Integer partitions —conjugate⟶ Integer partitions
St000160: Integer partitions ⟶ ℤ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]
=> ([(0,1)],2)
=> [2]
=> [1,1]
=> 2
[1,1,0,0]
=> ([(0,1)],2)
=> [2]
=> [1,1]
=> 2
[1,0,1,0,1,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> [1,1,1]
=> 3
[1,0,1,1,0,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> [1,1,1]
=> 3
[1,1,0,0,1,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> [1,1,1]
=> 3
[1,1,0,1,0,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> [1,1,1]
=> 3
[1,1,1,0,0,0]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> [3,1]
=> [2,1,1]
=> 2
[1,0,1,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> [1,1,1,1]
=> 4
[1,0,1,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> [1,1,1,1]
=> 4
[1,0,1,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> [1,1,1,1]
=> 4
[1,0,1,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> [1,1,1,1]
=> 4
[1,0,1,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [4,1]
=> [2,1,1,1]
=> 3
[1,1,0,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> [1,1,1,1]
=> 4
[1,1,0,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> [1,1,1,1]
=> 4
[1,1,0,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> [1,1,1,1]
=> 4
[1,1,0,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> [1,1,1,1]
=> 4
[1,1,0,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [4,1]
=> [2,1,1,1]
=> 3
[1,1,1,0,0,0,1,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [4,1]
=> [2,1,1,1]
=> 3
[1,1,1,0,0,1,0,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [4,1]
=> [2,1,1,1]
=> 3
[1,1,1,0,1,0,0,0]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> [4,2]
=> [2,2,1,1]
=> 2
[1,1,1,1,0,0,0,0]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> [4,2]
=> [2,2,1,1]
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,0,1,0,1,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,0,1,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,0,1,0,1,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [5,1]
=> [2,1,1,1,1]
=> 4
[1,0,1,1,0,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,0,1,1,0,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,0,1,1,0,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,0,1,1,0,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,0,1,1,0,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [5,1]
=> [2,1,1,1,1]
=> 4
[1,0,1,1,1,0,0,0,1,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [5,1]
=> [2,1,1,1,1]
=> 4
[1,0,1,1,1,0,0,1,0,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [5,1]
=> [2,1,1,1,1]
=> 4
[1,0,1,1,1,0,1,0,0,0]
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [5,2]
=> [2,2,1,1,1]
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [5,2]
=> [2,2,1,1,1]
=> 3
[1,1,0,0,1,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,1,0,0,1,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,1,0,0,1,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,1,0,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,1,0,0,1,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [5,1]
=> [2,1,1,1,1]
=> 4
[1,1,0,1,0,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,1,0,1,0,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,1,0,1,0,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,1,0,1,0,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,1,0,1,0,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [5,1]
=> [2,1,1,1,1]
=> 4
[1,1,0,1,1,0,0,0,1,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [5,1]
=> [2,1,1,1,1]
=> 4
[1,1,0,1,1,0,0,1,0,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [5,1]
=> [2,1,1,1,1]
=> 4
[1,1,0,1,1,0,1,0,0,0]
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [5,2]
=> [2,2,1,1,1]
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [5,2]
=> [2,2,1,1,1]
=> 3
Description
The multiplicity of the smallest part of a partition.
This counts the number of occurrences of the smallest part $spt(\lambda)$ of a partition $\lambda$.
The sum $spt(n) = \sum_{\lambda \vdash n} spt(\lambda)$ satisfies the congruences
\begin{align*}
spt(5n+4) &\equiv 0\quad \pmod{5}\\\
spt(7n+5) &\equiv 0\quad \pmod{7}\\\
spt(13n+6) &\equiv 0\quad \pmod{13},
\end{align*}
analogous to those of the counting function of partitions, see [1] and [2].
Matching statistic: St000203
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00072: Permutations —binary search tree: left to right⟶ Binary trees
St000203: Binary trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00072: Permutations —binary search tree: left to right⟶ Binary trees
St000203: Binary trees ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [.,.]
=> 1
[1,0,1,0]
=> [1,2] => [1,2] => [.,[.,.]]
=> 2
[1,1,0,0]
=> [2,1] => [1,2] => [.,[.,.]]
=> 2
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [.,[.,[.,.]]]
=> 3
[1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => [.,[.,[.,.]]]
=> 3
[1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => [.,[.,[.,.]]]
=> 3
[1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => [.,[.,[.,.]]]
=> 3
[1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => [.,[[.,.],.]]
=> 2
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> 4
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> 4
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> 4
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> 4
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,2,4,3] => [.,[.,[[.,.],.]]]
=> 3
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> 4
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> 4
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> 4
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> 4
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [1,2,4,3] => [.,[.,[[.,.],.]]]
=> 3
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [1,3,2,4] => [.,[[.,.],[.,.]]]
=> 3
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [1,3,4,2] => [.,[[.,.],[.,.]]]
=> 3
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [1,4,2,3] => [.,[[.,[.,.]],.]]
=> 2
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,4,2,3] => [.,[[.,[.,.]],.]]
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
=> 4
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
=> 4
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,2,4,3,5] => [.,[.,[[.,.],[.,.]]]]
=> 4
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,2,4,5,3] => [.,[.,[[.,.],[.,.]]]]
=> 4
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,2,5,3,4] => [.,[.,[[.,[.,.]],.]]]
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,2,5,3,4] => [.,[.,[[.,[.,.]],.]]]
=> 3
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
=> 4
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> 5
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
=> 4
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [1,2,4,3,5] => [.,[.,[[.,.],[.,.]]]]
=> 4
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [1,2,4,5,3] => [.,[.,[[.,.],[.,.]]]]
=> 4
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [1,2,5,3,4] => [.,[.,[[.,[.,.]],.]]]
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [1,2,5,3,4] => [.,[.,[[.,[.,.]],.]]]
=> 3
Description
The number of external nodes of a binary tree.
That is, the number of nodes that can be reached from the root by only left steps or only right steps, plus $1$ for the root node itself. A counting formula for the number of external node in all binary trees of size $n$ can be found in [1].
Matching statistic: St000475
Mp00232: Dyck paths —parallelogram poset⟶ Posets
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00044: Integer partitions —conjugate⟶ Integer partitions
St000475: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00110: Posets —Greene-Kleitman invariant⟶ Integer partitions
Mp00044: Integer partitions —conjugate⟶ Integer partitions
St000475: Integer partitions ⟶ ℤ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]
=> ([(0,1)],2)
=> [2]
=> [1,1]
=> 2
[1,1,0,0]
=> ([(0,1)],2)
=> [2]
=> [1,1]
=> 2
[1,0,1,0,1,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> [1,1,1]
=> 3
[1,0,1,1,0,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> [1,1,1]
=> 3
[1,1,0,0,1,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> [1,1,1]
=> 3
[1,1,0,1,0,0]
=> ([(0,2),(2,1)],3)
=> [3]
=> [1,1,1]
=> 3
[1,1,1,0,0,0]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> [3,1]
=> [2,1,1]
=> 2
[1,0,1,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> [1,1,1,1]
=> 4
[1,0,1,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> [1,1,1,1]
=> 4
[1,0,1,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> [1,1,1,1]
=> 4
[1,0,1,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> [1,1,1,1]
=> 4
[1,0,1,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [4,1]
=> [2,1,1,1]
=> 3
[1,1,0,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> [1,1,1,1]
=> 4
[1,1,0,0,1,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> [1,1,1,1]
=> 4
[1,1,0,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> [1,1,1,1]
=> 4
[1,1,0,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> [4]
=> [1,1,1,1]
=> 4
[1,1,0,1,1,0,0,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [4,1]
=> [2,1,1,1]
=> 3
[1,1,1,0,0,0,1,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [4,1]
=> [2,1,1,1]
=> 3
[1,1,1,0,0,1,0,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [4,1]
=> [2,1,1,1]
=> 3
[1,1,1,0,1,0,0,0]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> [4,2]
=> [2,2,1,1]
=> 2
[1,1,1,1,0,0,0,0]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> [4,2]
=> [2,2,1,1]
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,0,1,0,1,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,0,1,0,1,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,0,1,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,0,1,0,1,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [5,1]
=> [2,1,1,1,1]
=> 4
[1,0,1,1,0,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,0,1,1,0,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,0,1,1,0,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,0,1,1,0,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,0,1,1,0,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [5,1]
=> [2,1,1,1,1]
=> 4
[1,0,1,1,1,0,0,0,1,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [5,1]
=> [2,1,1,1,1]
=> 4
[1,0,1,1,1,0,0,1,0,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [5,1]
=> [2,1,1,1,1]
=> 4
[1,0,1,1,1,0,1,0,0,0]
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [5,2]
=> [2,2,1,1,1]
=> 3
[1,0,1,1,1,1,0,0,0,0]
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [5,2]
=> [2,2,1,1,1]
=> 3
[1,1,0,0,1,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,1,0,0,1,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,1,0,0,1,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,1,0,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,1,0,0,1,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [5,1]
=> [2,1,1,1,1]
=> 4
[1,1,0,1,0,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,1,0,1,0,0,1,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,1,0,1,0,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,1,0,1,0,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> [1,1,1,1,1]
=> 5
[1,1,0,1,0,1,1,0,0,0]
=> ([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [5,1]
=> [2,1,1,1,1]
=> 4
[1,1,0,1,1,0,0,0,1,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [5,1]
=> [2,1,1,1,1]
=> 4
[1,1,0,1,1,0,0,1,0,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [5,1]
=> [2,1,1,1,1]
=> 4
[1,1,0,1,1,0,1,0,0,0]
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [5,2]
=> [2,2,1,1,1]
=> 3
[1,1,0,1,1,1,0,0,0,0]
=> ([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [5,2]
=> [2,2,1,1,1]
=> 3
Description
The number of parts equal to 1 in a partition.
The following 41 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000542The number of left-to-right-minima of a permutation. St000991The number of right-to-left minima of a permutation. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001461The number of topologically connected components of the chord diagram of a permutation. St001654The monophonic hull number of a graph. St000025The number of initial rises of a Dyck path. St000053The number of valleys of the Dyck path. St000331The number of upper interactions of a Dyck path. St000678The number of up steps after the last double rise 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. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St000439The position of the first down step of a Dyck path. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St000469The distinguishing number of a graph. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000776The maximal multiplicity of an eigenvalue in a graph. St000986The multiplicity of the eigenvalue zero of the adjacency matrix of the graph. St001691The number of kings in a graph. St000907The number of maximal antichains of minimal length in a poset. St000315The number of isolated vertices of a graph. St001342The number of vertices in the center of a graph. St001366The maximal multiplicity of a degree of a vertex of a graph. St001368The number of vertices of maximal degree in a graph. St001844The maximal degree of a generator of the invariant ring of the automorphism group of a graph. St001184Number of indecomposable injective modules with grade at least 1 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. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001234The number of indecomposable three dimensional modules with projective dimension one. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. 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. St001330The hat guessing number of a graph. St000454The largest eigenvalue of a graph if it is integral. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. 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. St000717The number of ordinal summands of a poset. St000942The number of critical left to right maxima of the parking functions. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001875The number of simple modules with projective dimension at most 1. St000742The number of big ascents of a permutation after prepending zero.
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!