searching the database
Your data matches 161 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: St000658
(load all 37 compositions to match this statistic)
(load all 37 compositions to match this statistic)
St000658: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> 0
[1,1,0,0]
=> 1
[1,0,1,0,1,0]
=> 0
[1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> 1
[1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,0]
=> 1
[1,0,1,1,1,0,0,0]
=> 0
[1,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> 1
[1,1,0,1,1,0,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> 0
[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]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> 2
[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]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> 0
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)
(load all 5 compositions to match this statistic)
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%
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,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
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 0
Description
The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra.
Matching statistic: St001139
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001139: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001139: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,1] => [1,0,1,0]
=> 0
[1,1,0,0]
=> [2] => [1,1,0,0]
=> 1
[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]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [1,3] => [1,0,1,1,1,0,0,0]
=> 0
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 0
[1,1,1,0,0,1,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 0
[1,1,1,0,1,0,0,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 0
[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]
=> 1
[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]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2
[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]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 2
[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
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 0
Description
The number of occurrences of hills of size 2 in a Dyck path.
A hill of size two is a subpath beginning at height zero, consisting of two up steps followed by two down steps.
Matching statistic: St001276
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
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%
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,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
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 0
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]] .
Matching statistic: St001657
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00108: Permutations —cycle type⟶ Integer partitions
St001657: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00108: Permutations —cycle type⟶ Integer partitions
St001657: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,2] => [1,1]
=> 0
[1,1,0,0]
=> [2,1] => [2]
=> 1
[1,0,1,0,1,0]
=> [1,2,3] => [1,1,1]
=> 0
[1,0,1,1,0,0]
=> [1,3,2] => [2,1]
=> 1
[1,1,0,0,1,0]
=> [2,1,3] => [2,1]
=> 1
[1,1,0,1,0,0]
=> [2,3,1] => [3]
=> 0
[1,1,1,0,0,0]
=> [3,2,1] => [2,1]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,1,1,1]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [2,1,1]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [2,1,1]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [3,1]
=> 0
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [2,1,1]
=> 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,1]
=> 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,2]
=> 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,1]
=> 0
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [4]
=> 0
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [3,1]
=> 0
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [2,1,1]
=> 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [3,1]
=> 0
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [2,1,1]
=> 1
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [2,2]
=> 2
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,1,1,1,1]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [2,1,1,1]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [2,1,1,1]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [3,1,1]
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [2,1,1,1]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [2,1,1,1]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [2,2,1]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [3,1,1]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [4,1]
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [3,1,1]
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [2,1,1,1]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [3,1,1]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [2,1,1,1]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [2,2,1]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,1,1]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,2,1]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,2,1]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [3,2]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [2,2,1]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [3,1,1]
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [3,2]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [4,1]
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [5]
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [4,1]
=> 0
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [3,1,1]
=> 0
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [4,1]
=> 0
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [3,1,1]
=> 0
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [3,2]
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => [2,1,1,1]
=> 1
Description
The number of twos in an integer partition.
The total number of twos in all partitions of $n$ is equal to the total number of singletons [[St001484]] in all partitions of $n-1$, see [1].
Matching statistic: St000683
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00012: Binary trees —to Dyck path: up step, left tree, down step, right tree⟶ Dyck paths
St000683: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00012: Binary trees —to Dyck path: up step, left tree, down step, right tree⟶ Dyck paths
St000683: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,2] => [.,[.,.]]
=> [1,0,1,0]
=> 0
[1,1,0,0]
=> [2,1] => [[.,.],.]
=> [1,1,0,0]
=> 1
[1,0,1,0,1,0]
=> [1,2,3] => [.,[.,[.,.]]]
=> [1,0,1,0,1,0]
=> 0
[1,0,1,1,0,0]
=> [1,3,2] => [.,[[.,.],.]]
=> [1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [2,1,3] => [[.,.],[.,.]]
=> [1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> [2,3,1] => [[.,[.,.]],.]
=> [1,1,0,1,0,0]
=> 0
[1,1,1,0,0,0]
=> [3,1,2] => [[.,.],[.,.]]
=> [1,1,0,0,1,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [.,[.,[[.,.],.]]]
=> [1,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [.,[[.,.],[.,.]]]
=> [1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [.,[[.,[.,.]],.]]
=> [1,0,1,1,0,1,0,0]
=> 0
[1,0,1,1,1,0,0,0]
=> [1,4,2,3] => [.,[[.,.],[.,.]]]
=> [1,0,1,1,0,0,1,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [[.,.],[[.,.],.]]
=> [1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 0
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [[.,[.,[.,.]]],.]
=> [1,1,0,1,0,1,0,0]
=> 0
[1,1,0,1,1,0,0,0]
=> [2,4,1,3] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 0
[1,1,1,0,0,0,1,0]
=> [3,1,2,4] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [3,1,4,2] => [[.,.],[[.,.],.]]
=> [1,1,0,0,1,1,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [3,4,1,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 0
[1,1,1,1,0,0,0,0]
=> [4,1,2,3] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [.,[.,[[.,.],[.,.]]]]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [.,[.,[[.,[.,.]],.]]]
=> [1,0,1,0,1,1,0,1,0,0]
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => [.,[.,[[.,.],[.,.]]]]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [.,[[.,.],[[.,.],.]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [.,[[.,[.,.]],[.,.]]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [.,[[.,[.,[.,.]]],.]]
=> [1,0,1,1,0,1,0,1,0,0]
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [.,[[.,[.,.]],[.,.]]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,2,5,3] => [.,[[.,.],[[.,.],.]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,2,3] => [.,[[.,[.,.]],[.,.]]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,2,3,4] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [[.,.],[.,[[.,.],.]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [[.,.],[[.,[.,.]],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [[.,[.,[.,[.,.]]]],.]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 0
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,1,3,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 0
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,5,3] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,1,3] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 0
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,1,3,4] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 0
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,2,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
Description
The 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.
Matching statistic: St000932
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00020: Binary trees —to Tamari-corresponding Dyck path⟶ Dyck paths
St000932: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00020: Binary trees —to Tamari-corresponding Dyck path⟶ Dyck paths
St000932: 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,0,1,0]
=> 1
[1,1,0,0]
=> [1,2] => [.,[.,.]]
=> [1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> [2,1,3] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 1
[1,0,1,1,0,0]
=> [2,3,1] => [[.,[.,.]],.]
=> [1,1,0,0,1,0]
=> 0
[1,1,0,0,1,0]
=> [3,1,2] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 1
[1,1,0,1,0,0]
=> [1,3,2] => [.,[[.,.],.]]
=> [1,1,0,1,0,0]
=> 1
[1,1,1,0,0,0]
=> [1,2,3] => [.,[.,[.,.]]]
=> [1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [2,1,4,3] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,0,1,0,1,1,0,0]
=> [2,4,1,3] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 0
[1,0,1,1,0,0,1,0]
=> [2,1,3,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [2,3,1,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 0
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => [[.,[.,[.,.]]],.]
=> [1,1,1,0,0,0,1,0]
=> 0
[1,1,0,0,1,0,1,0]
=> [3,1,4,2] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 0
[1,1,0,1,0,0,1,0]
=> [3,1,2,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [1,3,2,4] => [.,[[.,.],[.,.]]]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [1,3,4,2] => [.,[[.,[.,.]],.]]
=> [1,1,1,0,0,1,0,0]
=> 0
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [.,[[.,.],[.,.]]]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,1,1,0,1,0,0,0]
=> [1,2,4,3] => [.,[.,[[.,.],.]]]
=> [1,1,1,0,1,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [2,1,4,3,5] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,0,1,0,1,0,1,1,0,0]
=> [2,4,1,3,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [2,1,4,5,3] => [[.,.],[[.,[.,.]],.]]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [2,4,1,5,3] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,4,5,1,3] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,5,3,4] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [2,5,1,3,4] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [2,1,3,5,4] => [[.,.],[.,[[.,.],.]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [2,3,1,5,4] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [2,3,1,4,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [2,3,4,1,5] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [[.,[.,[.,[.,.]]]],.]
=> [1,1,1,1,0,0,0,0,1,0]
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> [3,1,4,2,5] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [3,4,1,2,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [3,1,4,5,2] => [[.,.],[[.,[.,.]],.]]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [3,4,1,5,2] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,5,2,4] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [3,5,1,2,4] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> [3,1,2,5,4] => [[.,.],[.,[[.,.],.]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => [.,[[.,.],[[.,.],.]]]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [.,[[.,[.,.]],[.,.]]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 0
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,3,4,2,5] => [.,[[.,[.,.]],[.,.]]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 0
[1,1,0,1,1,1,0,0,0,0]
=> [1,3,4,5,2] => [.,[[.,[.,[.,.]]],.]]
=> [1,1,1,1,0,0,0,1,0,0]
=> 0
[1,1,1,0,0,0,1,0,1,0]
=> [4,1,5,2,3] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
Description
The number of occurrences of the pattern UDU in a Dyck path.
The number of Dyck paths with statistic value 0 are counted by the Motzkin numbers [1].
Matching statistic: St001067
Mp00024: Dyck paths —to 321-avoiding permutation⟶ Permutations
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00020: Binary trees —to Tamari-corresponding Dyck path⟶ Dyck paths
St001067: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00020: Binary trees —to Tamari-corresponding Dyck path⟶ Dyck paths
St001067: 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,0,1,0]
=> 1
[1,1,0,0]
=> [1,2] => [.,[.,.]]
=> [1,1,0,0]
=> 0
[1,0,1,0,1,0]
=> [2,1,3] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 1
[1,0,1,1,0,0]
=> [2,3,1] => [[.,[.,.]],.]
=> [1,1,0,0,1,0]
=> 0
[1,1,0,0,1,0]
=> [3,1,2] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 1
[1,1,0,1,0,0]
=> [1,3,2] => [.,[[.,.],.]]
=> [1,1,0,1,0,0]
=> 1
[1,1,1,0,0,0]
=> [1,2,3] => [.,[.,[.,.]]]
=> [1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [2,1,4,3] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,0,1,0,1,1,0,0]
=> [2,4,1,3] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 0
[1,0,1,1,0,0,1,0]
=> [2,1,3,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [2,3,1,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 0
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => [[.,[.,[.,.]]],.]
=> [1,1,1,0,0,0,1,0]
=> 0
[1,1,0,0,1,0,1,0]
=> [3,1,4,2] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 0
[1,1,0,1,0,0,1,0]
=> [3,1,2,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [1,3,2,4] => [.,[[.,.],[.,.]]]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [1,3,4,2] => [.,[[.,[.,.]],.]]
=> [1,1,1,0,0,1,0,0]
=> 0
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [.,[[.,.],[.,.]]]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,1,1,0,1,0,0,0]
=> [1,2,4,3] => [.,[.,[[.,.],.]]]
=> [1,1,1,0,1,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [2,1,4,3,5] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,0,1,0,1,0,1,1,0,0]
=> [2,4,1,3,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0
[1,0,1,0,1,1,0,0,1,0]
=> [2,1,4,5,3] => [[.,.],[[.,[.,.]],.]]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [2,4,1,5,3] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [2,4,5,1,3] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [2,1,5,3,4] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,0,1,1,0,0,1,1,0,0]
=> [2,5,1,3,4] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [2,1,3,5,4] => [[.,.],[.,[[.,.],.]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,0,1,0,1,0,0]
=> [2,3,1,5,4] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [2,3,1,4,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [2,3,4,1,5] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [[.,[.,[.,[.,.]]]],.]
=> [1,1,1,1,0,0,0,0,1,0]
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> [3,1,4,2,5] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [3,4,1,2,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [3,1,4,5,2] => [[.,.],[[.,[.,.]],.]]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [3,4,1,5,2] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,1,0,0,0,1,1,0,0]
=> 0
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,5,2,4] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [3,5,1,2,4] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0
[1,1,0,1,0,1,0,0,1,0]
=> [3,1,2,5,4] => [[.,.],[.,[[.,.],.]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => [.,[[.,.],[[.,.],.]]]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [.,[[.,[.,.]],[.,.]]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 0
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,3,4,2,5] => [.,[[.,[.,.]],[.,.]]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 0
[1,1,0,1,1,1,0,0,0,0]
=> [1,3,4,5,2] => [.,[[.,[.,[.,.]]],.]]
=> [1,1,1,1,0,0,0,1,0,0]
=> 0
[1,1,1,0,0,0,1,0,1,0]
=> [4,1,5,2,3] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
Description
The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra.
Matching statistic: St001189
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00012: Binary trees —to Dyck path: up step, left tree, down step, right tree⟶ Dyck paths
St001189: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00061: Permutations —to increasing tree⟶ Binary trees
Mp00012: Binary trees —to Dyck path: up step, left tree, down step, right tree⟶ Dyck paths
St001189: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,2] => [.,[.,.]]
=> [1,0,1,0]
=> 0
[1,1,0,0]
=> [2,1] => [[.,.],.]
=> [1,1,0,0]
=> 1
[1,0,1,0,1,0]
=> [1,2,3] => [.,[.,[.,.]]]
=> [1,0,1,0,1,0]
=> 0
[1,0,1,1,0,0]
=> [1,3,2] => [.,[[.,.],.]]
=> [1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [2,1,3] => [[.,.],[.,.]]
=> [1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> [2,3,1] => [[.,[.,.]],.]
=> [1,1,0,1,0,0]
=> 0
[1,1,1,0,0,0]
=> [3,1,2] => [[.,.],[.,.]]
=> [1,1,0,0,1,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [.,[.,[[.,.],.]]]
=> [1,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [.,[[.,.],[.,.]]]
=> [1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [.,[[.,[.,.]],.]]
=> [1,0,1,1,0,1,0,0]
=> 0
[1,0,1,1,1,0,0,0]
=> [1,4,2,3] => [.,[[.,.],[.,.]]]
=> [1,0,1,1,0,0,1,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [[.,.],[[.,.],.]]
=> [1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 0
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [[.,[.,[.,.]]],.]
=> [1,1,0,1,0,1,0,0]
=> 0
[1,1,0,1,1,0,0,0]
=> [2,4,1,3] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 0
[1,1,1,0,0,0,1,0]
=> [3,1,2,4] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> [3,1,4,2] => [[.,.],[[.,.],.]]
=> [1,1,0,0,1,1,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [3,4,1,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 0
[1,1,1,1,0,0,0,0]
=> [4,1,2,3] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [.,[.,[[.,.],[.,.]]]]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [.,[.,[[.,[.,.]],.]]]
=> [1,0,1,0,1,1,0,1,0,0]
=> 0
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => [.,[.,[[.,.],[.,.]]]]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [.,[[.,.],[[.,.],.]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [.,[[.,[.,.]],[.,.]]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 0
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [.,[[.,[.,[.,.]]],.]]
=> [1,0,1,1,0,1,0,1,0,0]
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [.,[[.,[.,.]],[.,.]]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,2,5,3] => [.,[[.,.],[[.,.],.]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,2,3] => [.,[[.,[.,.]],[.,.]]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,2,3,4] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [[.,.],[.,[[.,.],.]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [[.,.],[[.,[.,.]],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 0
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [[.,[.,[.,[.,.]]]],.]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 0
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,1,3,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 0
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,5,3] => [[.,[.,.]],[[.,.],.]]
=> [1,1,0,1,0,0,1,1,0,0]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,1,3] => [[.,[.,[.,.]]],[.,.]]
=> [1,1,0,1,0,1,0,0,1,0]
=> 0
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,1,3,4] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 0
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,2,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
Description
The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St000011
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00228: Dyck paths —reflect parallelogram polyomino⟶ Dyck paths
St000011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00228: Dyck paths —reflect parallelogram polyomino⟶ Dyck paths
St000011: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,0]
=> [1,1] => [1,0,1,0]
=> [1,1,0,0]
=> 1 = 0 + 1
[1,1,0,0]
=> [2] => [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,1,1] => [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0]
=> [1,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,0,1,0]
=> [2,1] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0]
=> [2,1] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,1,0,0,0]
=> [3] => [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 1 + 1
[1,0,1,1,1,0,0,0]
=> [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,1,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,1,0,0,0]
=> [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,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,0,0,1,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,0,0,1,0,0]
=> 1 = 0 + 1
[1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1 = 0 + 1
[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]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 2 = 1 + 1
[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,0,1,1,0,0]
=> 2 = 1 + 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,0,1,1,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 1 = 0 + 1
[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,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 3 = 2 + 1
[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,0,1,1,0,1,0,0]
=> 2 = 1 + 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,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 1 = 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]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2 = 1 + 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]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 1 = 0 + 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.
The following 151 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000502The number of successions of a set partitions. St001693The excess length of a longest path consisting of elements and blocks of a set partition. St001479The number of bridges of a graph. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St001061The number of indices that are both descents and recoils of a permutation. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St000884The number of isolated descents of a permutation. St001484The number of singletons of an integer partition. St000941The number of characters of the symmetric group whose value on the partition is even. 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. St001877Number of indecomposable injective modules with projective dimension 2. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St000137The Grundy value of an integer partition. St001587Half of the largest even part of an integer partition. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. 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. 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. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001128The exponens consonantiae of a partition. St000260The radius of a connected graph. St001461The number of topologically connected components of the chord diagram of a permutation. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000542The number of left-to-right-minima of a permutation. St000214The number of adjacencies of a permutation. St000237The number of small exceedances. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St001568The smallest positive integer that does not appear twice in the partition. St000659The number of rises of length at least 2 of 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. 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. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St000225Difference between largest and smallest parts in a partition. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001175The size of a partition minus the hook length of the base cell. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001280The number of parts of an integer partition that are at least two. 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. St001525The number of symmetric hooks on the diagonal of a partition. St001913The number of preimages of an integer partition in Bulgarian solitaire. 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. St000929The constant term of the character polynomial of an integer partition. St001432The order dimension of the partition. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St000441The number of successions of a permutation. St000665The number of rafts of a permutation. St000145The Dyson rank of a partition. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000618The number of self-evacuating tableaux of given shape. St000681The Grundy value of Chomp on Ferrers diagrams. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000706The product of the factorials of the multiplicities of an integer partition. St000781The number of proper colouring schemes of a Ferrers diagram. St000934The 2-degree of an integer partition. St000944The 3-degree of an integer partition. St000993The multiplicity of the largest part of an integer partition. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001383The BG-rank of an integer partition. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001564The value of the forgotten symmetric functions when all variables set to 1. St001593This is the number of standard Young tableaux of the given shifted shape. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. 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. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001924The number of cells in an integer partition whose arm and leg length coincide. St001933The largest multiplicity of a part in an integer partition. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000456The monochromatic index of a connected graph. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001274The number of indecomposable injective modules with projective dimension equal to two. 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. St001390The number of bumps occurring when Schensted-inserting the letter 1 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. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001498The normalised height of a Nakayama algebra with magnitude 1. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. 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. 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. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000648The number of 2-excedences of a permutation. St000454The largest eigenvalue of a graph if it is integral. St001960The number of descents of a permutation minus one if its first entry is not one. St000940The number of characters of the symmetric group whose value on the partition is zero. 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. St001651The Frankl number of a lattice. St000028The number of stack-sorts needed to sort a permutation. St000374The number of exclusive right-to-left minima of a permutation. St001004The number of indices that are either left-to-right maxima or right-to-left minima. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001948The number of augmented double ascents of a permutation. 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. St000455The second largest eigenvalue of a graph if it is integral. St001096The size of the overlap set of a permutation. St000632The jump number of the poset. St000298The order dimension or Dushnik-Miller dimension of a poset. St000307The number of rowmotion orbits of a poset. 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$. St001330The hat guessing number of a graph. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001820The size of the image of the pop stack sorting operator. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St000891The number of distinct diagonal sums of a permutation matrix. 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.
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!