Your data matches 67 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Mp00199: Dyck paths prime Dyck pathDyck paths
St000340: 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
[1,0,1,0]
=> [1,1,0,1,0,0]
=> 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 2
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 2
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 3
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 2
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 2
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 3
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> 3
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> 4
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> 3
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> 3
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> 3
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> 4
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,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]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> 3
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,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]
=> 2
Description
The number of non-final maximal constant sub-paths of length greater than one. This is the total number of occurrences of the patterns $110$ and $001$.
Mp00199: Dyck paths prime Dyck pathDyck paths
Mp00296: Dyck paths Knuth-KrattenthalerDyck paths
St000053: 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,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,0,0,1,0]
=> 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 2
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 2
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,0]
=> 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[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,1,0,0]
=> 3
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 3
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 2
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> 2
[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,1,0,1,1,0,1,0,0,0]
=> 3
[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,1,0,1,1,1,0,0,0,0]
=> 2
[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,1,1,0,0,1,1,0,0,0]
=> 2
[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,1,0,0,1,0,0]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 4
[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,1,0,1,0,0,0]
=> 3
[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,1,1,0,0,0,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 3
[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,1,0,0,1,0,1,1,0,0]
=> 3
[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,1,0,0,1,1,0,1,0,0]
=> 3
[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,1,0,0,1,1,1,0,0,0]
=> 2
[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,1,1,0,0,0,1,1,0,0]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0]
=> 3
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> 4
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,1,1,0,0,0,1,0,1,0]
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,1,0,0]
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,0,0,1,1,1,0,1,0,0,0]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,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,1,0,0,1,0,1,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,1,0,1,0,0,1,0,1,1,0,0]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0]
=> 3
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,1,0,0,1,1,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,1,0,1,1,0,0,0,1,1,0,0]
=> 2
Description
The number of valleys of the Dyck path.
Mp00199: Dyck paths prime Dyck pathDyck paths
Mp00296: Dyck paths Knuth-KrattenthalerDyck paths
St001068: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 3 = 2 + 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,1,0,0]
=> 4 = 3 + 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,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> 3 = 2 + 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,1,0,1,1,0,1,0,0,0]
=> 4 = 3 + 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,1,0,1,1,1,0,0,0,0]
=> 3 = 2 + 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,1,1,0,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> 4 = 3 + 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,1,1,0,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> 4 = 3 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> 5 = 4 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,1,1,0,0,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,1,0,0]
=> 4 = 3 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,0,0,1,1,1,0,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,1,0,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> 3 = 2 + 1
Description
Number of torsionless simple modules in the corresponding Nakayama algebra.
Mp00199: Dyck paths prime Dyck pathDyck paths
Mp00296: Dyck paths Knuth-KrattenthalerDyck paths
Mp00120: Dyck paths Lalanne-Kreweras involutionDyck paths
St000024: 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,0,0]
=> 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,0,0,1,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,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
[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,0,1,0]
=> 2
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 2
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 2
[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,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 3
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 2
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 3
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> 2
[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,1,0,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> 3
[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,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> 2
[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,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0,1,0]
=> 2
[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,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,1,0,0]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 4
[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,1,0,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> 3
[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,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> 3
[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,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> 3
[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,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,1,0,0]
=> 3
[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,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0,1,0]
=> 2
[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,1,1,0,0,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 3
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> 4
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0]
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,1,0,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,0,0,1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,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,1,0,0,1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,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,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,1,0,0,0,0,1,0]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> 3
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,1,0,0,0,1,0,1,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,1,0,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> 2
Description
The number of double up and double down steps of a Dyck path. In other words, this is the number of double rises (and, equivalently, the number of double falls) of a Dyck path.
Mp00199: Dyck paths prime Dyck pathDyck paths
Mp00199: Dyck paths prime Dyck pathDyck paths
Mp00142: Dyck paths promotionDyck paths
St001036: 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,1,1,0,0,0]
=> [1,0,1,1,0,0]
=> 1
[1,0,1,0]
=> [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,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> 1
[1,0,1,0,1,0]
=> [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,0,1,1,0,0]
=> [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,0,0,1,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]
=> 2
[1,1,0,1,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]
=> 1
[1,1,1,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]
=> 1
[1,0,1,0,1,0,1,0]
=> [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,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,1,0,0,0]
=> 2
[1,0,1,1,0,0,1,0]
=> [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]
=> 3
[1,0,1,1,0,1,0,0]
=> [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,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,0,1,1,0,1,1,1,0,0,0,0]
=> 2
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> 2
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0]
=> 3
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> 2
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,0,0,0,0]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> 2
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,1,0,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> [1,0,1,1,1,1,0,1,0,0,0,0]
=> 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,1,0,0,0]
=> 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,0,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,1,0,0,1,0,0]
=> 3
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,1,0,1,0,0,0]
=> 2
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,1,1,1,0,0,0,0,0]
=> [1,0,1,1,0,1,0,1,1,1,0,0,0,0]
=> 2
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,1,0,0]
=> 3
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,1,0,0,0]
=> 4
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,0,1,0,0]
=> 3
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,1,0,0,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,1,0,1,1,0,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,1,0,0,0,0]
=> 3
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,1,1,0,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,1,0,0,0,1,0,0]
=> 3
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,1,1,1,0,0,1,0,0,0,0]
=> [1,0,1,1,0,1,1,1,0,0,1,0,0,0]
=> 3
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,1,0,0,0,0,0]
=> [1,0,1,1,0,1,1,1,0,1,0,0,0,0]
=> 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,1,1,0,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,1,0,1,1,1,1,0,0,0,0,0]
=> 2
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,0,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,1,0,1,1,0,0,0]
=> 3
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,0,1,1,0,0,1,0,0]
=> 4
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,1,0,0,0,0]
=> [1,0,1,1,1,0,0,1,1,0,1,0,0,0]
=> 3
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,0,0,1,1,1,0,0,0,0]
=> 3
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,1,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,1,0,1,0,0]
=> 2
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,1,0,0,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,1,1,0,0,0]
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,1,0,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,1,0,0,1,0,0]
=> 2
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,1,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,1,0,1,0,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,1,1,1,0,1,0,1,1,0,0,0,0,0]
=> [1,0,1,1,1,0,1,0,1,1,0,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,1,1,1,0,1,1,0,0,0,1,0,0,0]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> 3
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,1,1,0,1,1,0,0,1,0,0,0,0]
=> [1,0,1,1,1,0,1,1,0,0,1,0,0,0]
=> 3
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,1,1,0,1,1,0,1,0,0,0,0,0]
=> [1,0,1,1,1,0,1,1,0,1,0,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,1,1,1,0,1,1,1,0,0,0,0,0,0]
=> [1,0,1,1,1,0,1,1,1,0,0,0,0,0]
=> 2
Description
The number of inner corners of the parallelogram polyomino associated with the Dyck path.
Matching statistic: St000105
Mp00199: Dyck paths prime Dyck pathDyck paths
Mp00296: Dyck paths Knuth-KrattenthalerDyck paths
Mp00138: Dyck paths to noncrossing partitionSet partitions
St000105: Set partitions ⟶ ℤ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}}
=> 2 = 1 + 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> {{1},{2,3}}
=> 2 = 1 + 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,0,0,1,0]
=> {{1,2},{3}}
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> {{1},{2,3,4}}
=> 2 = 1 + 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> {{1},{2},{3,4}}
=> 3 = 2 + 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> {{1,2},{3},{4}}
=> 3 = 2 + 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,0]
=> {{1,2},{3,4}}
=> 2 = 1 + 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> {{1,2,3},{4}}
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> {{1},{2,3,4,5}}
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> {{1},{2,4,5},{3}}
=> 3 = 2 + 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,1,0,0]
=> {{1},{2},{3,5},{4}}
=> 4 = 3 + 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,1,0,0,0]
=> {{1},{2},{3,4,5}}
=> 3 = 2 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> {{1},{2,3},{4,5}}
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> {{1,2},{3,4},{5}}
=> 3 = 2 + 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> {{1,3},{2},{4},{5}}
=> 4 = 3 + 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> {{1,2},{3,5},{4}}
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> {{1,2},{3,4,5}}
=> 2 = 1 + 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> {{1,3},{2},{4,5}}
=> 3 = 2 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> {{1,4},{2,3},{5}}
=> 3 = 2 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> {{1,2,3},{4},{5}}
=> 3 = 2 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> {{1,2,3},{4,5}}
=> 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> {{1,2,3,4},{5}}
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> {{1},{2,3,4,5,6}}
=> 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> {{1},{2,3,5,6},{4}}
=> 3 = 2 + 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,1,0,1,1,0,1,0,0,0]
=> {{1},{2,4,6},{3},{5}}
=> 4 = 3 + 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,1,0,1,1,1,0,0,0,0]
=> {{1},{2,4,5,6},{3}}
=> 3 = 2 + 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,1,1,0,0,1,1,0,0,0]
=> {{1},{2,5,6},{3,4}}
=> 3 = 2 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> {{1},{2},{3,6},{4,5}}
=> 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> {{1},{2},{3},{4,6},{5}}
=> 5 = 4 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> {{1},{2},{3,4,6},{5}}
=> 4 = 3 + 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,1,1,0,0,0,0]
=> {{1},{2},{3,4,5,6}}
=> 3 = 2 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> {{1},{2},{3},{4,5,6}}
=> 4 = 3 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> {{1},{2,3},{4},{5,6}}
=> 4 = 3 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,1,0,0]
=> {{1},{2,3},{4,6},{5}}
=> 4 = 3 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> {{1},{2,3},{4,5,6}}
=> 3 = 2 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> {{1},{2,3,4},{5,6}}
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> {{1,2},{3,4,5},{6}}
=> 3 = 2 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0]
=> {{1,2},{3},{4,5},{6}}
=> 4 = 3 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> {{1,3},{2},{4},{5},{6}}
=> 5 = 4 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> {{1,3},{2},{4,5},{6}}
=> 4 = 3 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,1,1,0,0,0,1,0,1,0]
=> {{1,3,4},{2},{5},{6}}
=> 4 = 3 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,1,0,0]
=> {{1,2},{3,6},{4,5}}
=> 3 = 2 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,1,0,0]
=> {{1,2},{3},{4,6},{5}}
=> 4 = 3 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,0,0,1,1,1,0,1,0,0,0]
=> {{1,2},{3,4,6},{5}}
=> 3 = 2 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> {{1,2},{3,4,5,6}}
=> 2 = 1 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,1,1,0,0,0]
=> {{1,2},{3},{4,5,6}}
=> 3 = 2 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,1,0,0]
=> {{1,3},{2},{4},{5,6}}
=> 4 = 3 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0]
=> {{1,3},{2},{4,6},{5}}
=> 4 = 3 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0]
=> {{1,3},{2},{4,5,6}}
=> 3 = 2 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> {{1,3,4},{2},{5,6}}
=> 3 = 2 + 1
Description
The number of blocks in the set partition. The generating function of this statistic yields the famous [[wiki:Stirling numbers of the second kind|Stirling numbers of the second kind]] $S_2(n,k)$ given by the number of [[SetPartitions|set partitions]] of $\{ 1,\ldots,n\}$ into $k$ blocks, see [1].
Matching statistic: St000636
Mp00296: Dyck paths Knuth-KrattenthalerDyck paths
Mp00026: Dyck paths to ordered treeOrdered trees
Mp00046: Ordered trees to graphGraphs
St000636: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [[]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[1,0,1,0]
=> [1,1,0,0]
=> [[[]]]
=> ([(0,2),(1,2)],3)
=> 2 = 1 + 1
[1,1,0,0]
=> [1,0,1,0]
=> [[],[]]
=> ([(0,2),(1,2)],3)
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [[[[]]]]
=> ([(0,3),(1,2),(2,3)],4)
=> 2 = 1 + 1
[1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [[[],[]]]
=> ([(0,3),(1,3),(2,3)],4)
=> 3 = 2 + 1
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [[],[],[]]
=> ([(0,3),(1,3),(2,3)],4)
=> 3 = 2 + 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [[],[[]]]
=> ([(0,3),(1,2),(2,3)],4)
=> 2 = 1 + 1
[1,1,1,0,0,0]
=> [1,1,0,0,1,0]
=> [[[]],[]]
=> ([(0,3),(1,2),(2,3)],4)
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [[[[[]]]]]
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [[[[],[]]]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3 = 2 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [[[],[],[]]]
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 4 = 3 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [[[],[[]]]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3 = 2 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [[[[]],[]]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [[],[[]],[]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3 = 2 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [[],[],[],[]]
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 4 = 3 + 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> [[],[[],[]]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [[],[[[]]]]
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2 = 1 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [[],[],[[]]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3 = 2 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> [[[],[]],[]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3 = 2 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [[[]],[],[]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3 = 2 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,0]
=> [[[]],[[]]]
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> [[[[]]],[]]
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [[[[[[]]]]]]
=> ([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [[[[[],[]]]]]
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 3 = 2 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [[[[],[],[]]]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [[[[],[[]]]]]
=> ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> 3 = 2 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [[[[[]],[]]]]
=> ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> 3 = 2 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [[[],[[]],[]]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [[[],[],[],[]]]
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 5 = 4 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [[[],[[],[]]]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [[[],[[[]]]]]
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 3 = 2 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [[[],[],[[]]]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [[[[],[]],[]]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [[[[]],[],[]]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [[[[]],[[]]]]
=> ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> 3 = 2 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [[[[[]]],[]]]
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [[],[[[]]],[]]
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 3 = 2 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [[],[[],[]],[]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [[],[],[],[],[]]
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 5 = 4 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [[],[],[[]],[]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [[],[[]],[],[]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [[],[[[]],[]]]
=> ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> 3 = 2 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [[],[[],[],[]]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [[],[[[],[]]]]
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 3 = 2 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [[],[[[[]]]]]
=> ([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> 2 = 1 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [[],[[],[[]]]]
=> ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> 3 = 2 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [[],[],[],[[]]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [[],[],[[],[]]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [[],[],[[[]]]]
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 3 = 2 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [[],[[]],[[]]]
=> ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> 3 = 2 + 1
Description
The hull number of a graph. The convex hull of a set of vertices $S$ of a graph is the smallest set $h(S)$ such that for any pair $u,v\in h(S)$ all vertices on a shortest path from $u$ to $v$ are also in $h(S)$. The hull number is the size of the smallest set $S$ such that $h(S)$ is the set of all vertices.
Mp00199: Dyck paths prime Dyck pathDyck paths
Mp00296: Dyck paths Knuth-KrattenthalerDyck paths
Mp00120: Dyck paths Lalanne-Kreweras involutionDyck paths
St001007: 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,0,0]
=> 2 = 1 + 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 2 = 1 + 1
[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,0,1,0]
=> 3 = 2 + 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 3 = 2 + 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,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 4 = 3 + 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,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [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,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 2 = 1 + 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 3 = 2 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> 3 = 2 + 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,1,0,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> 4 = 3 + 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,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> 3 = 2 + 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,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 5 = 4 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> 4 = 3 + 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,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> 4 = 3 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,1,0,0]
=> 4 = 3 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> 4 = 3 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> 5 = 4 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> 4 = 3 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0]
=> 4 = 3 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> 4 = 3 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,1,0,0,1,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,1,0,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,1,0,0,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> 4 = 3 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,1,0,1,0,0,0,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,1,0,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,0,1,1,1,0,0,0,0,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> 3 = 2 + 1
Description
Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St001654
Mp00296: Dyck paths Knuth-KrattenthalerDyck paths
Mp00026: Dyck paths to ordered treeOrdered trees
Mp00046: Ordered trees to graphGraphs
St001654: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [[]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[1,0,1,0]
=> [1,1,0,0]
=> [[[]]]
=> ([(0,2),(1,2)],3)
=> 2 = 1 + 1
[1,1,0,0]
=> [1,0,1,0]
=> [[],[]]
=> ([(0,2),(1,2)],3)
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [[[[]]]]
=> ([(0,3),(1,2),(2,3)],4)
=> 2 = 1 + 1
[1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [[[],[]]]
=> ([(0,3),(1,3),(2,3)],4)
=> 3 = 2 + 1
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [[],[],[]]
=> ([(0,3),(1,3),(2,3)],4)
=> 3 = 2 + 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [[],[[]]]
=> ([(0,3),(1,2),(2,3)],4)
=> 2 = 1 + 1
[1,1,1,0,0,0]
=> [1,1,0,0,1,0]
=> [[[]],[]]
=> ([(0,3),(1,2),(2,3)],4)
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [[[[[]]]]]
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [[[[],[]]]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3 = 2 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [[[],[],[]]]
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 4 = 3 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [[[],[[]]]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3 = 2 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [[[[]],[]]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [[],[[]],[]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3 = 2 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [[],[],[],[]]
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 4 = 3 + 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> [[],[[],[]]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [[],[[[]]]]
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2 = 1 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [[],[],[[]]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3 = 2 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> [[[],[]],[]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3 = 2 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [[[]],[],[]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3 = 2 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,0]
=> [[[]],[[]]]
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> [[[[]]],[]]
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [[[[[[]]]]]]
=> ([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [[[[[],[]]]]]
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 3 = 2 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [[[[],[],[]]]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [[[[],[[]]]]]
=> ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> 3 = 2 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [[[[[]],[]]]]
=> ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> 3 = 2 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [[[],[[]],[]]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [[[],[],[],[]]]
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 5 = 4 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [[[],[[],[]]]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [[[],[[[]]]]]
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 3 = 2 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [[[],[],[[]]]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [[[[],[]],[]]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [[[[]],[],[]]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [[[[]],[[]]]]
=> ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> 3 = 2 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [[[[[]]],[]]]
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [[],[[[]]],[]]
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 3 = 2 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [[],[[],[]],[]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [[],[],[],[],[]]
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 5 = 4 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [[],[],[[]],[]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [[],[[]],[],[]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [[],[[[]],[]]]
=> ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> 3 = 2 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [[],[[],[],[]]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [[],[[[],[]]]]
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 3 = 2 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [[],[[[[]]]]]
=> ([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> 2 = 1 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [[],[[],[[]]]]
=> ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> 3 = 2 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [[],[],[],[[]]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [[],[],[[],[]]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [[],[],[[[]]]]
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 3 = 2 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [[],[[]],[[]]]
=> ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> 3 = 2 + 1
Description
The monophonic hull number of a graph. The monophonic hull of a set of vertices $M$ of a graph $G$ is the set of vertices that lie on at least one induced path between vertices in $M$. The monophonic hull number is the size of the smallest set $M$ such that the monophonic hull of $M$ is all of $G$. For example, the monophonic hull number of a graph $G$ with $n$ vertices is $n$ if and only if $G$ is a disjoint union of complete graphs.
Matching statistic: St001655
Mp00296: Dyck paths Knuth-KrattenthalerDyck paths
Mp00026: Dyck paths to ordered treeOrdered trees
Mp00046: Ordered trees to graphGraphs
St001655: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [[]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[1,0,1,0]
=> [1,1,0,0]
=> [[[]]]
=> ([(0,2),(1,2)],3)
=> 2 = 1 + 1
[1,1,0,0]
=> [1,0,1,0]
=> [[],[]]
=> ([(0,2),(1,2)],3)
=> 2 = 1 + 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [[[[]]]]
=> ([(0,3),(1,2),(2,3)],4)
=> 2 = 1 + 1
[1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [[[],[]]]
=> ([(0,3),(1,3),(2,3)],4)
=> 3 = 2 + 1
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [[],[],[]]
=> ([(0,3),(1,3),(2,3)],4)
=> 3 = 2 + 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [[],[[]]]
=> ([(0,3),(1,2),(2,3)],4)
=> 2 = 1 + 1
[1,1,1,0,0,0]
=> [1,1,0,0,1,0]
=> [[[]],[]]
=> ([(0,3),(1,2),(2,3)],4)
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [[[[[]]]]]
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [[[[],[]]]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3 = 2 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [[[],[],[]]]
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 4 = 3 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [[[],[[]]]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3 = 2 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [[[[]],[]]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [[],[[]],[]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3 = 2 + 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [[],[],[],[]]
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 4 = 3 + 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> [[],[[],[]]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3 = 2 + 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [[],[[[]]]]
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2 = 1 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [[],[],[[]]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3 = 2 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> [[[],[]],[]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3 = 2 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [[[]],[],[]]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 3 = 2 + 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,0]
=> [[[]],[[]]]
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2 = 1 + 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> [[[[]]],[]]
=> ([(0,4),(1,3),(2,3),(2,4)],5)
=> 2 = 1 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [[[[[[]]]]]]
=> ([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [[[[[],[]]]]]
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 3 = 2 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [[[[],[],[]]]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [[[[],[[]]]]]
=> ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> 3 = 2 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [[[[[]],[]]]]
=> ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> 3 = 2 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [[[],[[]],[]]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [[[],[],[],[]]]
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 5 = 4 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [[[],[[],[]]]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [[[],[[[]]]]]
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 3 = 2 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [[[],[],[[]]]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [[[[],[]],[]]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [[[[]],[],[]]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [[[[]],[[]]]]
=> ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> 3 = 2 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [[[[[]]],[]]]
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 3 = 2 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [[],[[[]]],[]]
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 3 = 2 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [[],[[],[]],[]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [[],[],[],[],[]]
=> ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 5 = 4 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [[],[],[[]],[]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [[],[[]],[],[]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [[],[[[]],[]]]
=> ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> 3 = 2 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [[],[[],[],[]]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [[],[[[],[]]]]
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 3 = 2 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [[],[[[[]]]]]
=> ([(0,5),(1,4),(2,3),(2,4),(3,5)],6)
=> 2 = 1 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [[],[[],[[]]]]
=> ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> 3 = 2 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [[],[],[],[[]]]
=> ([(0,5),(1,5),(2,5),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [[],[],[[],[]]]
=> ([(0,5),(1,5),(2,4),(3,4),(4,5)],6)
=> 4 = 3 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [[],[],[[[]]]]
=> ([(0,5),(1,5),(2,3),(3,4),(4,5)],6)
=> 3 = 2 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [[],[[]],[[]]]
=> ([(0,5),(1,4),(2,3),(3,5),(4,5)],6)
=> 3 = 2 + 1
Description
The general position number of a graph. A set $S$ of vertices in a graph $G$ is a general position set if no three vertices of $S$ lie on a shortest path between any two of them.
The following 57 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001656The monophonic position number of a graph. St001883The mutual visibility number of a graph. St000291The number of descents of a binary word. St000390The number of runs of ones in a binary word. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St000871The number of very big ascents of a permutation. St000925The number of topologically connected components of a set partition. St000619The number of cyclic descents of a permutation. St000249The number of singletons (St000247) plus the number of antisingletons (St000248) of a set partition. St000292The number of ascents of a binary word. St000996The number of exclusive left-to-right maxima of a permutation. St000245The number of ascents of a permutation. St000167The number of leaves of an ordered tree. St000824The sum of the number of descents and the number of recoils of a permutation. St000159The number of distinct parts of the integer partition. St001083The number of boxed occurrences of 132 in a permutation. St000672The number of minimal elements in Bruhat order not less than the permutation. St000157The number of descents of a standard tableau. St000164The number of short pairs. St000318The number of addable cells of the Ferrers diagram of an integer partition. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001488The number of corners of a skew partition. St000052The number of valleys of a Dyck path not on the x-axis. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St000015The number of peaks of a Dyck path. St000021The number of descents of a permutation. St000155The number of exceedances (also excedences) of a permutation. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama algebra. St001489The maximum of the number of descents and the number of inverse descents. St000062The length of the longest increasing subsequence of the permutation. St000213The number of weak exceedances (also weak excedences) of a permutation. St000236The number of cyclical small weak excedances. St000239The number of small weak excedances. St000314The number of left-to-right-maxima of a permutation. St000325The width of the tree associated to a permutation. St000443The number of long tunnels of a Dyck path. St000470The number of runs in a permutation. St000542The number of left-to-right-minima of a permutation. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001180Number of indecomposable injective modules with projective dimension at most 1. St000083The number of left oriented leafs of a binary tree except the first one. St000354The number of recoils of a permutation. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St001960The number of descents of a permutation minus one if its first entry is not one. St000374The number of exclusive right-to-left minima of a permutation. St000703The number of deficiencies of a permutation. St000035The number of left outer peaks of a permutation. St000317The cycle descent number of a permutation. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St000702The number of weak deficiencies of a permutation. St000991The number of right-to-left minima of a permutation. St001637The number of (upper) dissectors of a poset.