Your data matches 50 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
St000026: 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
[1,1,0,0]
=> 2
[1,0,1,0,1,0]
=> 1
[1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> 2
[1,1,0,1,0,0]
=> 3
[1,1,1,0,0,0]
=> 3
[1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,0]
=> 1
[1,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> 2
[1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> 3
[1,1,0,1,0,1,0,0]
=> 4
[1,1,0,1,1,0,0,0]
=> 4
[1,1,1,0,0,0,1,0]
=> 3
[1,1,1,0,0,1,0,0]
=> 4
[1,1,1,0,1,0,0,0]
=> 4
[1,1,1,1,0,0,0,0]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> 1
[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,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> 4
[1,1,0,1,0,1,0,1,0,0]
=> 5
[1,1,0,1,0,1,1,0,0,0]
=> 5
[1,1,0,1,1,0,0,0,1,0]
=> 4
[1,1,0,1,1,0,0,1,0,0]
=> 5
[1,1,0,1,1,0,1,0,0,0]
=> 5
[1,1,0,1,1,1,0,0,0,0]
=> 5
Description
The position of the first return of a Dyck path.
Mp00100: Dyck paths touch compositionInteger compositions
St000382: Integer compositions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => 1
[1,0,1,0]
=> [1,1] => 1
[1,1,0,0]
=> [2] => 2
[1,0,1,0,1,0]
=> [1,1,1] => 1
[1,0,1,1,0,0]
=> [1,2] => 1
[1,1,0,0,1,0]
=> [2,1] => 2
[1,1,0,1,0,0]
=> [3] => 3
[1,1,1,0,0,0]
=> [3] => 3
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => 1
[1,0,1,1,0,0,1,0]
=> [1,2,1] => 1
[1,0,1,1,0,1,0,0]
=> [1,3] => 1
[1,0,1,1,1,0,0,0]
=> [1,3] => 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => 2
[1,1,0,0,1,1,0,0]
=> [2,2] => 2
[1,1,0,1,0,0,1,0]
=> [3,1] => 3
[1,1,0,1,0,1,0,0]
=> [4] => 4
[1,1,0,1,1,0,0,0]
=> [4] => 4
[1,1,1,0,0,0,1,0]
=> [3,1] => 3
[1,1,1,0,0,1,0,0]
=> [4] => 4
[1,1,1,0,1,0,0,0]
=> [4] => 4
[1,1,1,1,0,0,0,0]
=> [4] => 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,3] => 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,1] => 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,4] => 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,4] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4] => 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,4] => 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => 2
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,3] => 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => 2
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,1] => 3
[1,1,0,1,0,0,1,1,0,0]
=> [3,2] => 3
[1,1,0,1,0,1,0,0,1,0]
=> [4,1] => 4
[1,1,0,1,0,1,0,1,0,0]
=> [5] => 5
[1,1,0,1,0,1,1,0,0,0]
=> [5] => 5
[1,1,0,1,1,0,0,0,1,0]
=> [4,1] => 4
[1,1,0,1,1,0,0,1,0,0]
=> [5] => 5
[1,1,0,1,1,0,1,0,0,0]
=> [5] => 5
[1,1,0,1,1,1,0,0,0,0]
=> [5] => 5
Description
The first part of an integer composition.
Mp00138: Dyck paths to noncrossing partitionSet partitions
St000505: Set partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> {{1}}
=> 1
[1,0,1,0]
=> {{1},{2}}
=> 1
[1,1,0,0]
=> {{1,2}}
=> 2
[1,0,1,0,1,0]
=> {{1},{2},{3}}
=> 1
[1,0,1,1,0,0]
=> {{1},{2,3}}
=> 1
[1,1,0,0,1,0]
=> {{1,2},{3}}
=> 2
[1,1,0,1,0,0]
=> {{1,3},{2}}
=> 3
[1,1,1,0,0,0]
=> {{1,2,3}}
=> 3
[1,0,1,0,1,0,1,0]
=> {{1},{2},{3},{4}}
=> 1
[1,0,1,0,1,1,0,0]
=> {{1},{2},{3,4}}
=> 1
[1,0,1,1,0,0,1,0]
=> {{1},{2,3},{4}}
=> 1
[1,0,1,1,0,1,0,0]
=> {{1},{2,4},{3}}
=> 1
[1,0,1,1,1,0,0,0]
=> {{1},{2,3,4}}
=> 1
[1,1,0,0,1,0,1,0]
=> {{1,2},{3},{4}}
=> 2
[1,1,0,0,1,1,0,0]
=> {{1,2},{3,4}}
=> 2
[1,1,0,1,0,0,1,0]
=> {{1,3},{2},{4}}
=> 3
[1,1,0,1,0,1,0,0]
=> {{1,4},{2},{3}}
=> 4
[1,1,0,1,1,0,0,0]
=> {{1,3,4},{2}}
=> 4
[1,1,1,0,0,0,1,0]
=> {{1,2,3},{4}}
=> 3
[1,1,1,0,0,1,0,0]
=> {{1,4},{2,3}}
=> 4
[1,1,1,0,1,0,0,0]
=> {{1,2,4},{3}}
=> 4
[1,1,1,1,0,0,0,0]
=> {{1,2,3,4}}
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> {{1},{2},{3},{4},{5}}
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> {{1},{2},{3},{4,5}}
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> {{1},{2},{3,4},{5}}
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> {{1},{2},{3,5},{4}}
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> {{1},{2},{3,4,5}}
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> {{1},{2,3},{4},{5}}
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> {{1},{2,3},{4,5}}
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> {{1},{2,4},{3},{5}}
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> {{1},{2,5},{3},{4}}
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> {{1},{2,4,5},{3}}
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> {{1},{2,3,4},{5}}
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> {{1},{2,5},{3,4}}
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> {{1},{2,3,5},{4}}
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> {{1},{2,3,4,5}}
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> {{1,2},{3},{4},{5}}
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> {{1,2},{3},{4,5}}
=> 2
[1,1,0,0,1,1,0,0,1,0]
=> {{1,2},{3,4},{5}}
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> {{1,2},{3,5},{4}}
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> {{1,2},{3,4,5}}
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> {{1,3},{2},{4},{5}}
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> {{1,3},{2},{4,5}}
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> {{1,4},{2},{3},{5}}
=> 4
[1,1,0,1,0,1,0,1,0,0]
=> {{1,5},{2},{3},{4}}
=> 5
[1,1,0,1,0,1,1,0,0,0]
=> {{1,4,5},{2},{3}}
=> 5
[1,1,0,1,1,0,0,0,1,0]
=> {{1,3,4},{2},{5}}
=> 4
[1,1,0,1,1,0,0,1,0,0]
=> {{1,5},{2},{3,4}}
=> 5
[1,1,0,1,1,0,1,0,0,0]
=> {{1,3,5},{2},{4}}
=> 5
[1,1,0,1,1,1,0,0,0,0]
=> {{1,3,4,5},{2}}
=> 5
Description
The biggest entry in the block containing the 1.
Mp00028: Dyck paths reverseDyck paths
Mp00100: Dyck paths touch compositionInteger compositions
St000383: Integer compositions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1] => 1
[1,0,1,0]
=> [1,0,1,0]
=> [1,1] => 1
[1,1,0,0]
=> [1,1,0,0]
=> [2] => 2
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,1] => 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [2,1] => 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,2] => 2
[1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> [3] => 3
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [3] => 3
[1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1] => 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,1] => 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,2,1] => 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [3,1] => 1
[1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3,1] => 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,2] => 2
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2] => 2
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> [1,3] => 3
[1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> [4] => 4
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [4] => 4
[1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => 3
[1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [4] => 4
[1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [4] => 4
[1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [4] => 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [3,1,1] => 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,1,1] => 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,3,1] => 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [4,1] => 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [4,1] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> [4,1] => 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [4,1] => 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,1] => 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => 2
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => 2
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => 2
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> [3,2] => 2
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [3,2] => 2
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,3] => 3
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> [2,3] => 3
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,4] => 4
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [5] => 5
[1,1,0,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [5] => 5
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,4] => 4
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [5] => 5
[1,1,0,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [5] => 5
[1,1,0,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [5] => 5
Description
The last part of an integer composition.
Mp00023: Dyck paths to non-crossing permutationPermutations
Mp00066: Permutations inversePermutations
Mp00127: Permutations left-to-right-maxima to Dyck pathDyck paths
St000025: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [1,0]
=> 1
[1,0,1,0]
=> [1,2] => [1,2] => [1,0,1,0]
=> 1
[1,1,0,0]
=> [2,1] => [2,1] => [1,1,0,0]
=> 2
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [1,0,1,0,1,0]
=> 1
[1,0,1,1,0,0]
=> [1,3,2] => [1,3,2] => [1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => [1,1,0,0,1,0]
=> 2
[1,1,0,1,0,0]
=> [2,3,1] => [3,1,2] => [1,1,1,0,0,0]
=> 3
[1,1,1,0,0,0]
=> [3,2,1] => [3,2,1] => [1,1,1,0,0,0]
=> 3
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [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,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,4,2,3] => [1,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,4,3,2] => [1,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> 2
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [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] => [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> 3
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> 4
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [4,1,3,2] => [1,1,1,1,0,0,0,0]
=> 4
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [3,2,1,4] => [1,1,1,0,0,0,1,0]
=> 3
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [4,2,1,3] => [1,1,1,1,0,0,0,0]
=> 4
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> 4
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [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,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,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,5,4,3] => [1,0,1,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [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,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,4,2,3,5] => [1,0,1,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,5,2,3,4] => [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,5,2,4,3] => [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,4,3,2,5] => [1,0,1,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,5,3,2,4] => [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,5,3,4,2] => [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,5,4,3,2] => [1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => [1,1,0,0,1,0,1,0,1,0]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [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] => [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] => [2,1,5,3,4] => [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [2,1,5,4,3] => [1,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [3,1,2,4,5] => [1,1,1,0,0,0,1,0,1,0]
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [3,1,2,5,4] => [1,1,1,0,0,0,1,1,0,0]
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [4,1,2,3,5] => [1,1,1,1,0,0,0,0,1,0]
=> 4
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [5,1,2,3,4] => [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [5,1,2,4,3] => [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [4,1,3,2,5] => [1,1,1,1,0,0,0,0,1,0]
=> 4
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [5,1,3,2,4] => [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [5,1,3,4,2] => [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [5,1,4,3,2] => [1,1,1,1,1,0,0,0,0,0]
=> 5
Description
The number of initial rises of a Dyck path. In other words, this is the height of the first peak of $D$.
Mp00100: Dyck paths touch compositionInteger compositions
Mp00039: Integer compositions complementInteger compositions
Mp00094: Integer compositions to binary wordBinary words
St000297: Binary words ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => 1 => 1
[1,0,1,0]
=> [1,1] => [2] => 10 => 1
[1,1,0,0]
=> [2] => [1,1] => 11 => 2
[1,0,1,0,1,0]
=> [1,1,1] => [3] => 100 => 1
[1,0,1,1,0,0]
=> [1,2] => [2,1] => 101 => 1
[1,1,0,0,1,0]
=> [2,1] => [1,2] => 110 => 2
[1,1,0,1,0,0]
=> [3] => [1,1,1] => 111 => 3
[1,1,1,0,0,0]
=> [3] => [1,1,1] => 111 => 3
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [4] => 1000 => 1
[1,0,1,0,1,1,0,0]
=> [1,1,2] => [3,1] => 1001 => 1
[1,0,1,1,0,0,1,0]
=> [1,2,1] => [2,2] => 1010 => 1
[1,0,1,1,0,1,0,0]
=> [1,3] => [2,1,1] => 1011 => 1
[1,0,1,1,1,0,0,0]
=> [1,3] => [2,1,1] => 1011 => 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [1,3] => 1100 => 2
[1,1,0,0,1,1,0,0]
=> [2,2] => [1,2,1] => 1101 => 2
[1,1,0,1,0,0,1,0]
=> [3,1] => [1,1,2] => 1110 => 3
[1,1,0,1,0,1,0,0]
=> [4] => [1,1,1,1] => 1111 => 4
[1,1,0,1,1,0,0,0]
=> [4] => [1,1,1,1] => 1111 => 4
[1,1,1,0,0,0,1,0]
=> [3,1] => [1,1,2] => 1110 => 3
[1,1,1,0,0,1,0,0]
=> [4] => [1,1,1,1] => 1111 => 4
[1,1,1,0,1,0,0,0]
=> [4] => [1,1,1,1] => 1111 => 4
[1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1] => 1111 => 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => [5] => 10000 => 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => [4,1] => 10001 => 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => [3,2] => 10010 => 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,3] => [3,1,1] => 10011 => 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => [3,1,1] => 10011 => 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => [2,3] => 10100 => 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => [2,2,1] => 10101 => 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,1] => [2,1,2] => 10110 => 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,4] => [2,1,1,1] => 10111 => 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,4] => [2,1,1,1] => 10111 => 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => [2,1,2] => 10110 => 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4] => [2,1,1,1] => 10111 => 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,4] => [2,1,1,1] => 10111 => 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => [2,1,1,1] => 10111 => 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => [1,4] => 11000 => 2
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => [1,3,1] => 11001 => 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => [1,2,2] => 11010 => 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,3] => [1,2,1,1] => 11011 => 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => [1,2,1,1] => 11011 => 2
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,1] => [1,1,3] => 11100 => 3
[1,1,0,1,0,0,1,1,0,0]
=> [3,2] => [1,1,2,1] => 11101 => 3
[1,1,0,1,0,1,0,0,1,0]
=> [4,1] => [1,1,1,2] => 11110 => 4
[1,1,0,1,0,1,0,1,0,0]
=> [5] => [1,1,1,1,1] => 11111 => 5
[1,1,0,1,0,1,1,0,0,0]
=> [5] => [1,1,1,1,1] => 11111 => 5
[1,1,0,1,1,0,0,0,1,0]
=> [4,1] => [1,1,1,2] => 11110 => 4
[1,1,0,1,1,0,0,1,0,0]
=> [5] => [1,1,1,1,1] => 11111 => 5
[1,1,0,1,1,0,1,0,0,0]
=> [5] => [1,1,1,1,1] => 11111 => 5
[1,1,0,1,1,1,0,0,0,0]
=> [5] => [1,1,1,1,1] => 11111 => 5
Description
The number of leading ones in a binary word.
Matching statistic: St001135
Mp00100: Dyck paths touch compositionInteger compositions
Mp00041: Integer compositions conjugateInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
St001135: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [1,0]
=> 1
[1,0,1,0]
=> [1,1] => [2] => [1,1,0,0]
=> 1
[1,1,0,0]
=> [2] => [1,1] => [1,0,1,0]
=> 2
[1,0,1,0,1,0]
=> [1,1,1] => [3] => [1,1,1,0,0,0]
=> 1
[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]
=> 2
[1,1,0,1,0,0]
=> [3] => [1,1,1] => [1,0,1,0,1,0]
=> 3
[1,1,1,0,0,0]
=> [3] => [1,1,1] => [1,0,1,0,1,0]
=> 3
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => [4] => [1,1,1,1,0,0,0,0]
=> 1
[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,3] => [1,1,2] => [1,0,1,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]
=> 1
[1,1,0,0,1,0,1,0]
=> [2,1,1] => [3,1] => [1,1,1,0,0,0,1,0]
=> 2
[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]
=> [3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[1,1,0,1,0,1,0,0]
=> [4] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[1,1,0,1,1,0,0,0]
=> [4] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[1,1,1,0,0,0,1,0]
=> [3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
=> 3
[1,1,1,0,0,1,0,0]
=> [4] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[1,1,1,0,1,0,0,0]
=> [4] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[1,1,1,1,0,0,0,0]
=> [4] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> 4
[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]
=> 1
[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,3] => [1,1,3] => [1,0,1,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]
=> 1
[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]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,1] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,4] => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,4] => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 1
[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]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4] => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,4] => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> 1
[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]
=> 1
[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]
=> 2
[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,3] => [1,1,2,1] => [1,0,1,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]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,1] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> 3
[1,1,0,1,0,0,1,1,0,0]
=> [3,2] => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> 3
[1,1,0,1,0,1,0,0,1,0]
=> [4,1] => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 4
[1,1,0,1,0,1,0,1,0,0]
=> [5] => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,1,0,1,0,1,1,0,0,0]
=> [5] => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,1,0,1,1,0,0,0,1,0]
=> [4,1] => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> 4
[1,1,0,1,1,0,0,1,0,0]
=> [5] => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,1,0,1,1,0,1,0,0,0]
=> [5] => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 5
[1,1,0,1,1,1,0,0,0,0]
=> [5] => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> 5
Description
The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path.
Mp00023: Dyck paths to non-crossing permutationPermutations
Mp00066: Permutations inversePermutations
Mp00127: Permutations left-to-right-maxima to Dyck pathDyck paths
St000439: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [1,0]
=> 2 = 1 + 1
[1,0,1,0]
=> [1,2] => [1,2] => [1,0,1,0]
=> 2 = 1 + 1
[1,1,0,0]
=> [2,1] => [2,1] => [1,1,0,0]
=> 3 = 2 + 1
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [1,0,1,0,1,0]
=> 2 = 1 + 1
[1,0,1,1,0,0]
=> [1,3,2] => [1,3,2] => [1,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0]
=> [2,1,3] => [2,1,3] => [1,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,1,0,0]
=> [2,3,1] => [3,1,2] => [1,1,1,0,0,0]
=> 4 = 3 + 1
[1,1,1,0,0,0]
=> [3,2,1] => [3,2,1] => [1,1,1,0,0,0]
=> 4 = 3 + 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,4,3] => [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,3,2,4] => [1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,4,2,3] => [1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [1,4,3,2] => [1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [2,1,4,3] => [1,1,0,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [4,1,3,2] => [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [3,2,1,4] => [1,1,1,0,0,0,1,0]
=> 4 = 3 + 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [4,2,1,3] => [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> 5 = 4 + 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [1,0,1,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,5,4] => [1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,4,3,5] => [1,0,1,0,1,1,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,5,3,4] => [1,0,1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [1,2,5,4,3] => [1,0,1,0,1,1,1,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => [1,0,1,1,0,0,1,0,1,0]
=> 2 = 1 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => [1,0,1,1,0,0,1,1,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,4,2,3,5] => [1,0,1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,5,2,3,4] => [1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [1,5,2,4,3] => [1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [1,4,3,2,5] => [1,0,1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [1,5,3,2,4] => [1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [1,5,3,4,2] => [1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [1,5,4,3,2] => [1,0,1,1,1,1,0,0,0,0]
=> 2 = 1 + 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [2,1,3,4,5] => [1,1,0,0,1,0,1,0,1,0]
=> 3 = 2 + 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => [1,1,0,0,1,0,1,1,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [2,1,5,3,4] => [1,1,0,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [2,1,5,4,3] => [1,1,0,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [3,1,2,4,5] => [1,1,1,0,0,0,1,0,1,0]
=> 4 = 3 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [3,1,2,5,4] => [1,1,1,0,0,0,1,1,0,0]
=> 4 = 3 + 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [4,1,2,3,5] => [1,1,1,1,0,0,0,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [5,1,2,3,4] => [1,1,1,1,1,0,0,0,0,0]
=> 6 = 5 + 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [5,1,2,4,3] => [1,1,1,1,1,0,0,0,0,0]
=> 6 = 5 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [4,1,3,2,5] => [1,1,1,1,0,0,0,0,1,0]
=> 5 = 4 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [5,1,3,2,4] => [1,1,1,1,1,0,0,0,0,0]
=> 6 = 5 + 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [5,1,3,4,2] => [1,1,1,1,1,0,0,0,0,0]
=> 6 = 5 + 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [5,1,4,3,2] => [1,1,1,1,1,0,0,0,0,0]
=> 6 = 5 + 1
Description
The position of the first down step of a Dyck path.
Matching statistic: St000645
Mp00025: Dyck paths to 132-avoiding permutationPermutations
Mp00066: Permutations inversePermutations
Mp00127: Permutations left-to-right-maxima to Dyck pathDyck paths
St000645: 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 - 1
[1,0,1,0]
=> [2,1] => [2,1] => [1,1,0,0]
=> 0 = 1 - 1
[1,1,0,0]
=> [1,2] => [1,2] => [1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0,1,0]
=> [3,2,1] => [3,2,1] => [1,1,1,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,0]
=> [2,3,1] => [3,1,2] => [1,1,1,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [3,1,2] => [2,3,1] => [1,1,0,1,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [2,1,3] => [2,1,3] => [1,1,0,0,1,0]
=> 2 = 3 - 1
[1,1,1,0,0,0]
=> [1,2,3] => [1,2,3] => [1,0,1,0,1,0]
=> 2 = 3 - 1
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => [4,3,2,1] => [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => [4,3,1,2] => [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => [4,2,3,1] => [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [3,2,4,1] => [4,2,1,3] => [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => [4,1,2,3] => [1,1,1,1,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => [3,4,2,1] => [1,1,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => [3,4,1,2] => [1,1,1,0,1,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0]
=> [4,2,1,3] => [3,2,4,1] => [1,1,1,0,0,1,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,0]
=> [3,2,1,4] => [3,2,1,4] => [1,1,1,0,0,0,1,0]
=> 3 = 4 - 1
[1,1,0,1,1,0,0,0]
=> [2,3,1,4] => [3,1,2,4] => [1,1,1,0,0,0,1,0]
=> 3 = 4 - 1
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => [2,3,4,1] => [1,1,0,1,0,1,0,0]
=> 2 = 3 - 1
[1,1,1,0,0,1,0,0]
=> [3,1,2,4] => [2,3,1,4] => [1,1,0,1,0,0,1,0]
=> 3 = 4 - 1
[1,1,1,0,1,0,0,0]
=> [2,1,3,4] => [2,1,3,4] => [1,1,0,0,1,0,1,0]
=> 3 = 4 - 1
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => [1,2,3,4] => [1,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => [5,4,3,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => [5,4,3,1,2] => [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => [5,4,2,3,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => [5,4,2,1,3] => [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => [5,4,1,2,3] => [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => [5,3,4,2,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => [5,3,4,1,2] => [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,4,1] => [5,3,2,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => [5,3,2,1,4] => [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [3,4,2,5,1] => [5,3,1,2,4] => [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => [5,2,3,4,1] => [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => [5,2,3,1,4] => [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [3,2,4,5,1] => [5,2,1,3,4] => [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => [5,1,2,3,4] => [1,1,1,1,1,0,0,0,0,0]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => [4,5,3,2,1] => [1,1,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => [4,5,3,1,2] => [1,1,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => [4,5,2,3,1] => [1,1,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => [4,5,2,1,3] => [1,1,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => [4,5,1,2,3] => [1,1,1,1,0,1,0,0,0,0]
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => [4,3,5,2,1] => [1,1,1,1,0,0,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [4,5,2,1,3] => [4,3,5,1,2] => [1,1,1,1,0,0,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => [4,3,2,5,1] => [1,1,1,1,0,0,0,1,0,0]
=> 3 = 4 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => [4,3,2,1,5] => [1,1,1,1,0,0,0,0,1,0]
=> 4 = 5 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,2,1,5] => [4,3,1,2,5] => [1,1,1,1,0,0,0,0,1,0]
=> 4 = 5 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [5,2,3,1,4] => [4,2,3,5,1] => [1,1,1,1,0,0,0,1,0,0]
=> 3 = 4 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [4,2,3,1,5] => [4,2,3,1,5] => [1,1,1,1,0,0,0,0,1,0]
=> 4 = 5 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [3,2,4,1,5] => [4,2,1,3,5] => [1,1,1,1,0,0,0,0,1,0]
=> 4 = 5 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,3,4,1,5] => [4,1,2,3,5] => [1,1,1,1,0,0,0,0,1,0]
=> 4 = 5 - 1
Description
The sum of the areas of the rectangles formed by two consecutive peaks and the valley in between. For a Dyck path $D = D_1 \cdots D_{2n}$ with peaks in positions $i_1 < \ldots < i_k$ and valleys in positions $j_1 < \ldots < j_{k-1}$, this statistic is given by $$ \sum_{a=1}^{k-1} (j_a-i_a)(i_{a+1}-j_a) $$
Mp00143: Dyck paths inverse promotionDyck paths
Mp00100: Dyck paths touch compositionInteger compositions
Mp00184: Integer compositions to threshold graphGraphs
St000987: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1] => ([],1)
=> 0 = 1 - 1
[1,0,1,0]
=> [1,1,0,0]
=> [2] => ([],2)
=> 0 = 1 - 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1] => ([(0,1)],2)
=> 1 = 2 - 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> [3] => ([],3)
=> 0 = 1 - 1
[1,0,1,1,0,0]
=> [1,1,1,0,0,0]
=> [3] => ([],3)
=> 0 = 1 - 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,2] => ([(1,2)],3)
=> 1 = 2 - 1
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1] => ([(0,1),(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,1,1,0,0,0]
=> [1,1,0,0,1,0]
=> [2,1] => ([(0,2),(1,2)],3)
=> 2 = 3 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [4] => ([],4)
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [4] => ([],4)
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [4] => ([],4)
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [4] => ([],4)
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [4] => ([],4)
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> [1,3] => ([(2,3)],4)
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,3] => ([(2,3)],4)
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,2] => ([(1,2),(1,3),(2,3)],4)
=> 2 = 3 - 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,2,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [2,2] => ([(1,3),(2,3)],4)
=> 2 = 3 - 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 3 = 4 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [5] => ([],5)
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [5] => ([],5)
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [5] => ([],5)
=> 0 = 1 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [5] => ([],5)
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [5] => ([],5)
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [5] => ([],5)
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [5] => ([],5)
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [5] => ([],5)
=> 0 = 1 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [5] => ([],5)
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [5] => ([],5)
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [5] => ([],5)
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [5] => ([],5)
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> [5] => ([],5)
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5] => ([],5)
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,4] => ([(3,4)],5)
=> 1 = 2 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> [1,4] => ([(3,4)],5)
=> 1 = 2 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,4] => ([(3,4)],5)
=> 1 = 2 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,4] => ([(3,4)],5)
=> 1 = 2 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,4] => ([(3,4)],5)
=> 1 = 2 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 2 = 3 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => ([(2,3),(2,4),(3,4)],5)
=> 2 = 3 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 4 - 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] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 5 - 1
[1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 5 - 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 3 = 4 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 5 - 1
[1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 5 - 1
[1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 4 = 5 - 1
Description
The number of positive eigenvalues of the Laplacian matrix of the graph. This is the number of vertices minus the number of connected components of the graph.
The following 40 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000326The position of the first one in a binary word after appending a 1 at the end. St000678The number of up steps after the last double rise of a Dyck path. St000273The domination number of a graph. St000544The cop number of a graph. St000916The packing number of a graph. St001829The common independence number of a graph. St000171The degree of the graph. St000363The number of minimal vertex covers of a graph. St001322The size of a minimal independent dominating set in a graph. St001339The irredundance number of a graph. St001363The Euler characteristic of a graph according to Knill. St001725The harmonious chromatic number of a graph. St000054The first entry of the permutation. St000740The last entry of a permutation. St001316The domatic number of a graph. St000066The column of the unique '1' in the first row of the alternating sign matrix. St000501The size of the first part in the decomposition of a permutation. St001497The position of the largest weak excedence of a permutation. St000051The size of the left subtree of a binary tree. St000286The number of connected components of the complement of a graph. St000287The number of connected components of a graph. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001481The minimal height of a peak of a Dyck path. St000133The "bounce" of a permutation. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000310The minimal degree of a vertex of a graph. St000727The largest label of a leaf in the binary search tree associated with the permutation. St001645The pebbling number of a connected graph. St000060The greater neighbor of the maximum. St000200The row of the unique '1' in the last column of the alternating sign matrix. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000199The column of the unique '1' in the last row of the alternating sign matrix. St000800The number of occurrences of the vincular pattern |231 in a permutation. St001413Half the length of the longest even length palindromic prefix of a binary word. St001434The number of negative sum pairs of a signed permutation. St001771The number of occurrences of the signed pattern 1-2 in a signed permutation. St001557The number of inversions of the second entry of a permutation.