searching the database
Your data matches 29 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 34 compositions to match this statistic)
(load all 34 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00142: Dyck paths —promotion⟶ Dyck paths
St000658: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00142: Dyck paths —promotion⟶ Dyck paths
St000658: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 0
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 0
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,1,0,0]
=> 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 0
[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]
=> 0
[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,1,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 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,1,0,0,0]
=> 0
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 0
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 0
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 0
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,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,0,1,1,0,0,0]
=> [1,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,0,1,0,0]
=> [1,0,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,0,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 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,1,0,0,0]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,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,0,1,0,0]
=> [1,0,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,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 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,1,0,1,1,0,0,0]
=> 2
[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,1,0,0,0,1,0]
=> 0
[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,1,0,0,1,0,0]
=> 0
[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,1,0,1,0,0,0]
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,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,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,1,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,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,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,0,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,0,1,0,0]
=> [1,0,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,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 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,1,0,1,0,1,1,0,0,0]
=> 2
[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,1,0,1,1,0,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,0,0]
=> 2
[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,1,0,1,1,1,0,0,0,0]
=> 1
Description
The number of rises of length 2 of a Dyck path.
This is also the number of $(1,1)$ steps of the associated Łukasiewicz path, see [1].
A related statistic is the number of double rises in a Dyck path, [[St000024]].
Matching statistic: St001657
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
St001657: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00040: Integer compositions —to partition⟶ Integer partitions
St001657: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1]
=> 0
[1,0,1,0]
=> [1,1] => [1,1]
=> 0
[1,1,0,0]
=> [2] => [2]
=> 1
[1,0,1,0,1,0]
=> [1,1,1] => [1,1,1]
=> 0
[1,0,1,1,0,0]
=> [1,2] => [2,1]
=> 1
[1,1,0,0,1,0]
=> [2,1] => [2,1]
=> 1
[1,1,0,1,0,0]
=> [2,1] => [2,1]
=> 1
[1,1,1,0,0,0]
=> [3] => [3]
=> 0
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [1,1,1,1]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [2,1,1]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [2,1,1]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [2,1,1]
=> 1
[1,0,1,1,1,0,0,0]
=> [1,3] => [3,1]
=> 0
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [2,1,1]
=> 1
[1,1,0,0,1,1,0,0]
=> [2,2] => [2,2]
=> 2
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [2,1,1]
=> 1
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [2,1,1]
=> 1
[1,1,0,1,1,0,0,0]
=> [2,2] => [2,2]
=> 2
[1,1,1,0,0,0,1,0]
=> [3,1] => [3,1]
=> 0
[1,1,1,0,0,1,0,0]
=> [3,1] => [3,1]
=> 0
[1,1,1,0,1,0,0,0]
=> [3,1] => [3,1]
=> 0
[1,1,1,1,0,0,0,0]
=> [4] => [4]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [1,1,1,1,1]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [2,1,1,1]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [2,1,1,1]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [2,1,1,1]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [3,1,1]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [2,1,1,1]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [2,2,1]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,2,1,1] => [2,1,1,1]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [2,1,1,1]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [2,2,1]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [3,1,1]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [3,1,1]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [3,1,1]
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [4,1]
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [2,1,1,1]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [2,2,1]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [2,2,1]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,2,1] => [2,2,1]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [3,2]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [2,1,1,1]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [2,2,1]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [2,1,1,1]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => [2,1,1,1]
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [2,2,1]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [2,2,1]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [2,2,1] => [2,2,1]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,2,1] => [2,2,1]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,3] => [3,2]
=> 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: St001067
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00072: Permutations —binary search tree: left to right⟶ 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%
Mp00072: Permutations —binary search tree: left to right⟶ 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] => [.,.]
=> [1,0]
=> 0
[1,0,1,0]
=> [1,2] => [.,[.,.]]
=> [1,1,0,0]
=> 0
[1,1,0,0]
=> [2,1] => [[.,.],.]
=> [1,0,1,0]
=> 1
[1,0,1,0,1,0]
=> [1,2,3] => [.,[.,[.,.]]]
=> [1,1,1,0,0,0]
=> 0
[1,0,1,1,0,0]
=> [1,3,2] => [.,[[.,.],.]]
=> [1,1,0,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [2,1,3] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 1
[1,1,0,1,0,0]
=> [2,3,1] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 1
[1,1,1,0,0,0]
=> [3,1,2] => [[.,[.,.]],.]
=> [1,1,0,0,1,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [.,[.,[[.,.],.]]]
=> [1,1,1,0,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [.,[[.,.],[.,.]]]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [.,[[.,.],[.,.]]]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [1,4,2,3] => [.,[[.,[.,.]],.]]
=> [1,1,1,0,0,1,0,0]
=> 0
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [2,4,1,3] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [3,1,2,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 0
[1,1,1,0,0,1,0,0]
=> [3,1,4,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 0
[1,1,1,0,1,0,0,0]
=> [3,4,1,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 0
[1,1,1,1,0,0,0,0]
=> [4,1,2,3] => [[.,[.,[.,.]]],.]
=> [1,1,1,0,0,0,1,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [.,[.,[[.,.],[.,.]]]]
=> [1,1,1,0,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [.,[.,[[.,.],[.,.]]]]
=> [1,1,1,0,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => [.,[.,[[.,[.,.]],.]]]
=> [1,1,1,1,0,0,1,0,0,0]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [.,[[.,.],[[.,.],.]]]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [.,[[.,.],[.,[.,.]]]]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [.,[[.,.],[[.,.],.]]]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => [.,[[.,[.,.]],[.,.]]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,2,5,3] => [.,[[.,[.,.]],[.,.]]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,2,3] => [.,[[.,[.,.]],[.,.]]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,2,3,4] => [.,[[.,[.,[.,.]]],.]]
=> [1,1,1,1,0,0,0,1,0,0]
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [[.,.],[.,[[.,.],.]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => [[.,.],[[.,[.,.]],.]]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [[.,.],[.,[[.,.],.]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [[.,.],[.,[.,[.,.]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => [[.,.],[.,[[.,.],.]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,1,3,5] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,5,3] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,1,3] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,1,3,4] => [[.,.],[[.,[.,.]],.]]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1
Description
The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra.
Matching statistic: St001125
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00041: Integer compositions —conjugate⟶ 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%
Mp00041: Integer compositions —conjugate⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001125: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [1,0]
=> 0
[1,0,1,0]
=> [1,1] => [2] => [1,1,0,0]
=> 0
[1,1,0,0]
=> [2] => [1,1] => [1,0,1,0]
=> 1
[1,0,1,0,1,0]
=> [1,1,1] => [3] => [1,1,1,0,0,0]
=> 0
[1,0,1,1,0,0]
=> [1,2] => [1,2] => [1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [2,1] => [2,1] => [1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> [2,1] => [2,1] => [1,1,0,0,1,0]
=> 1
[1,1,1,0,0,0]
=> [3] => [1,1,1] => [1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [4] => [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [2,2] => [1,1,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [2,2] => [1,1,0,0,1,1,0,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 0
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [2,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [2,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 0
[1,1,1,0,0,1,0,0]
=> [3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 0
[1,1,1,0,1,0,0,0]
=> [3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 0
[1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [5] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [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] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [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] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [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] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [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] => [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,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [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] => [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] => [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,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 1
Description
The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra.
Matching statistic: St001189
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00072: Permutations —binary search tree: left to right⟶ 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%
Mp00072: Permutations —binary search tree: left to right⟶ 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] => [.,.]
=> [1,0]
=> 0
[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,0,1,0]
=> 1
[1,1,1,0,0,0]
=> [3,1,2] => [[.,[.,.]],.]
=> [1,1,0,1,0,0]
=> 0
[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,0,1,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [1,4,2,3] => [.,[[.,[.,.]],.]]
=> [1,0,1,1,0,1,0,0]
=> 0
[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,0,1,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [2,4,1,3] => [[.,.],[[.,.],.]]
=> [1,1,0,0,1,1,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [3,1,2,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 0
[1,1,1,0,0,1,0,0]
=> [3,1,4,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 0
[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,1,0,1,0,0]
=> 0
[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,0,1,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => [.,[.,[[.,[.,.]],.]]]
=> [1,0,1,0,1,1,0,1,0,0]
=> 0
[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,0,1,0,1,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [.,[[.,.],[[.,.],.]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => [.,[[.,[.,.]],[.,.]]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,2,5,3] => [.,[[.,[.,.]],[.,.]]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 0
[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,1,0,1,0,0]
=> 0
[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,0,1,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => [[.,.],[[.,[.,.]],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [[.,.],[.,[[.,.],.]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [[.,.],[.,[.,[.,.]]]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => [[.,.],[.,[[.,.],.]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,1,3,5] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,5,3] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,1,3] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,1,3,4] => [[.,.],[[.,[.,.]],.]]
=> [1,1,0,0,1,1,0,1,0,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: St001276
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00102: Dyck paths —rise composition⟶ Integer compositions
Mp00041: Integer compositions —conjugate⟶ 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%
Mp00041: Integer compositions —conjugate⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St001276: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [1,0]
=> 0
[1,0,1,0]
=> [1,1] => [2] => [1,1,0,0]
=> 0
[1,1,0,0]
=> [2] => [1,1] => [1,0,1,0]
=> 1
[1,0,1,0,1,0]
=> [1,1,1] => [3] => [1,1,1,0,0,0]
=> 0
[1,0,1,1,0,0]
=> [1,2] => [1,2] => [1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [2,1] => [2,1] => [1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> [2,1] => [2,1] => [1,1,0,0,1,0]
=> 1
[1,1,1,0,0,0]
=> [3] => [1,1,1] => [1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [4] => [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [1,3] => [1,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [2,2] => [1,1,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,2,1] => [2,2] => [1,1,0,0,1,1,0,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
=> 0
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [2,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [2,1,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [2,1,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [2,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 0
[1,1,1,0,0,1,0,0]
=> [3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 0
[1,1,1,0,1,0,0,0]
=> [3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 0
[1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [5] => [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,2,1] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [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] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [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] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,2,1,1] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,2,2] => [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] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,3,1] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [1,3,1] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [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] => [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,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,1,1,1] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,1,2] => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,1,1,1] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,1,1,1] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,1,2] => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,2,1] => [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] => [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] => [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,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> 1
Description
The number of 2-regular indecomposable modules in the corresponding Nakayama algebra.
Generalising the notion of k-regular modules from simple to arbitrary indecomposable modules, we call an indecomposable module $M$ over an algebra $A$ k-regular in case it has projective dimension k and $Ext_A^i(M,A)=0$ for $i \neq k$ and $Ext_A^k(M,A)$ is 1-dimensional.
The number of Dyck paths where the statistic returns 0 might be given by [[OEIS:A035929]] .
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] => [1,0]
=> [1,0]
=> 1 = 0 + 1
[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
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: St001139
(load all 8 compositions to match this statistic)
(load all 8 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] => [1,0]
=> ? = 0
[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: St000683
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00072: Permutations —binary search tree: left to right⟶ 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%
Mp00072: Permutations —binary search tree: left to right⟶ 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] => [.,.]
=> [1,0]
=> ? = 0
[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,0,1,0]
=> 1
[1,1,1,0,0,0]
=> [3,1,2] => [[.,[.,.]],.]
=> [1,1,0,1,0,0]
=> 0
[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,0,1,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [1,4,2,3] => [.,[[.,[.,.]],.]]
=> [1,0,1,1,0,1,0,0]
=> 0
[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,0,1,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [[.,.],[.,[.,.]]]
=> [1,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [2,4,1,3] => [[.,.],[[.,.],.]]
=> [1,1,0,0,1,1,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [3,1,2,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 0
[1,1,1,0,0,1,0,0]
=> [3,1,4,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,1,0,0,1,0]
=> 0
[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,1,0,1,0,0]
=> 0
[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,0,1,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => [.,[.,[[.,[.,.]],.]]]
=> [1,0,1,0,1,1,0,1,0,0]
=> 0
[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,0,1,0,1,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [.,[[.,.],[.,[.,.]]]]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [.,[[.,.],[[.,.],.]]]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => [.,[[.,[.,.]],[.,.]]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,2,5,3] => [.,[[.,[.,.]],[.,.]]]
=> [1,0,1,1,0,1,0,0,1,0]
=> 0
[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,1,0,1,0,0]
=> 0
[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,0,1,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => [[.,.],[[.,[.,.]],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [[.,.],[.,[[.,.],.]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [[.,.],[.,[.,[.,.]]]]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => [[.,.],[.,[[.,.],.]]]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,1,3,5] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,5,3] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,1,3] => [[.,.],[[.,.],[.,.]]]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,1,3,4] => [[.,.],[[.,[.,.]],.]]
=> [1,1,0,0,1,1,0,1,0,0]
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,2,4,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,1,0,0,1,0,1,0]
=> 0
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
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
Mp00072: Permutations —binary search tree: left to right⟶ 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%
Mp00072: Permutations —binary search tree: left to right⟶ 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] => [.,.]
=> [1,0]
=> ? = 0
[1,0,1,0]
=> [1,2] => [.,[.,.]]
=> [1,1,0,0]
=> 0
[1,1,0,0]
=> [2,1] => [[.,.],.]
=> [1,0,1,0]
=> 1
[1,0,1,0,1,0]
=> [1,2,3] => [.,[.,[.,.]]]
=> [1,1,1,0,0,0]
=> 0
[1,0,1,1,0,0]
=> [1,3,2] => [.,[[.,.],.]]
=> [1,1,0,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [2,1,3] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 1
[1,1,0,1,0,0]
=> [2,3,1] => [[.,.],[.,.]]
=> [1,0,1,1,0,0]
=> 1
[1,1,1,0,0,0]
=> [3,1,2] => [[.,[.,.]],.]
=> [1,1,0,0,1,0]
=> 0
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [.,[.,[.,[.,.]]]]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [.,[.,[[.,.],.]]]
=> [1,1,1,0,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [.,[[.,.],[.,.]]]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [.,[[.,.],[.,.]]]
=> [1,1,0,1,1,0,0,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [1,4,2,3] => [.,[[.,[.,.]],.]]
=> [1,1,1,0,0,1,0,0]
=> 0
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [[.,.],[.,[.,.]]]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [2,4,1,3] => [[.,.],[[.,.],.]]
=> [1,0,1,1,0,1,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [3,1,2,4] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 0
[1,1,1,0,0,1,0,0]
=> [3,1,4,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 0
[1,1,1,0,1,0,0,0]
=> [3,4,1,2] => [[.,[.,.]],[.,.]]
=> [1,1,0,0,1,1,0,0]
=> 0
[1,1,1,1,0,0,0,0]
=> [4,1,2,3] => [[.,[.,[.,.]]],.]
=> [1,1,1,0,0,0,1,0]
=> 0
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [.,[.,[.,[.,[.,.]]]]]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [.,[.,[.,[[.,.],.]]]]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [.,[.,[[.,.],[.,.]]]]
=> [1,1,1,0,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [.,[.,[[.,.],[.,.]]]]
=> [1,1,1,0,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,3,4] => [.,[.,[[.,[.,.]],.]]]
=> [1,1,1,1,0,0,1,0,0,0]
=> 0
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [.,[[.,.],[[.,.],.]]]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [.,[[.,.],[.,[.,.]]]]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [.,[[.,.],[.,[.,.]]]]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,2,4] => [.,[[.,.],[[.,.],.]]]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,2,3,5] => [.,[[.,[.,.]],[.,.]]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,2,5,3] => [.,[[.,[.,.]],[.,.]]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 0
[1,0,1,1,1,0,1,0,0,0]
=> [1,4,5,2,3] => [.,[[.,[.,.]],[.,.]]]
=> [1,1,1,0,0,1,1,0,0,0]
=> 0
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,2,3,4] => [.,[[.,[.,[.,.]]],.]]
=> [1,1,1,1,0,0,0,1,0,0]
=> 0
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [[.,.],[.,[[.,.],.]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,3,4] => [[.,.],[[.,[.,.]],.]]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [[.,.],[.,[[.,.],.]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [[.,.],[.,[.,[.,.]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [[.,.],[.,[.,[.,.]]]]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,1,4] => [[.,.],[.,[[.,.],.]]]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,1,3,5] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,5,3] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,4,5,1,3] => [[.,.],[[.,.],[.,.]]]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,1,3,4] => [[.,.],[[.,[.,.]],.]]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> [3,1,2,4,5] => [[.,[.,.]],[.,[.,.]]]
=> [1,1,0,0,1,1,1,0,0,0]
=> 0
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].
The following 19 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St000884The number of isolated descents of a permutation. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St001061The number of indices that are both descents and recoils of a permutation. St000214The number of adjacencies of a permutation. St000237The number of small exceedances. St000441The number of successions of a permutation. St000665The number of rafts of a permutation. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. 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. 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. St001948The number of augmented double ascents of a permutation. St000845The maximal number of elements covered by an element in a poset. St000846The maximal number of elements covering an element of a poset. St000640The rank of the largest boolean interval in a poset. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset.
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!