searching the database
Your data matches 1 statistic following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St001733
Mp00233: Dyck paths —skew partition⟶ Skew partitions
Mp00183: Skew partitions —inner shape⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001733: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00183: Skew partitions —inner shape⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St001733: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,1,0,0,1,0]
=> [[2,2],[1]]
=> [1]
=> [1,0]
=> 1
[1,0,1,1,0,0,1,0]
=> [[2,2,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,0,0,1,0,1,0]
=> [[2,2,2],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [[3,2],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,0,1,0,0,1,0]
=> [[3,3],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,1,0,1,1,0,0,0]
=> [[3,3],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,1,0,0,0,1,0]
=> [[2,2,2],[1]]
=> [1]
=> [1,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [[2,2,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [[2,2,2,1],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [[3,2,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [[3,3,1],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,0,1,1,0,1,1,0,0,0]
=> [[3,3,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [[2,2,2,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [[2,2,2,2],[1,1,1]]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 2
[1,1,0,0,1,0,1,1,0,0]
=> [[3,2,2],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [[3,3,2],[2,1]]
=> [2,1]
=> [1,0,1,1,0,0]
=> 2
[1,1,0,0,1,1,0,1,0,0]
=> [[4,2],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [[3,3,2],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 1
[1,1,0,1,0,0,1,0,1,0]
=> [[3,3,3],[2,2]]
=> [2,2]
=> [1,1,1,0,0,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [[4,3],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [[4,4],[3]]
=> [3]
=> [1,0,1,0,1,0]
=> 3
[1,1,0,1,0,1,1,0,0,0]
=> [[4,4],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [[3,3,3],[2,1]]
=> [2,1]
=> [1,0,1,1,0,0]
=> 2
[1,1,0,1,1,0,0,1,0,0]
=> [[4,3],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,0,1,1,0,1,0,0,0]
=> [[3,3,3],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 1
[1,1,0,1,1,1,0,0,0,0]
=> [[4,4],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,1,0,0,0,1,0,1,0]
=> [[2,2,2,2],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 1
[1,1,1,0,0,0,1,1,0,0]
=> [[3,2,2],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,1,0,0,1,0,0,1,0]
=> [[3,3,2],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,1,1,0,0,1,1,0,0,0]
=> [[3,3,2],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,1,0,1,0,0,0,1,0]
=> [[2,2,2,2],[1]]
=> [1]
=> [1,0]
=> 1
[1,1,1,1,0,0,0,0,1,0]
=> [[3,3,3],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,1,1,1,0,0,1,0,0,0]
=> [[3,3,3],[1]]
=> [1]
=> [1,0]
=> 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [[2,2,1,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [[2,2,2,1,1],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [[3,2,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [[3,3,1,1],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,0,1,0,1,1,0,1,1,0,0,0]
=> [[3,3,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [[2,2,2,1,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [[2,2,2,2,1],[1,1,1]]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> 2
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [[3,2,2,1],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [[3,3,2,1],[2,1]]
=> [2,1]
=> [1,0,1,1,0,0]
=> 2
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [[4,2,1],[1]]
=> [1]
=> [1,0]
=> 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [[3,3,2,1],[1,1]]
=> [1,1]
=> [1,1,0,0]
=> 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [[3,3,3,1],[2,2]]
=> [2,2]
=> [1,1,1,0,0,0]
=> 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [[4,3,1],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [[4,4,1],[3]]
=> [3]
=> [1,0,1,0,1,0]
=> 3
[1,0,1,1,0,1,0,1,1,0,0,0]
=> [[4,4,1],[2]]
=> [2]
=> [1,0,1,0]
=> 2
[1,0,1,1,0,1,1,0,0,0,1,0]
=> [[3,3,3,1],[2,1]]
=> [2,1]
=> [1,0,1,1,0,0]
=> 2
[1,0,1,1,0,1,1,0,0,1,0,0]
=> [[4,3,1],[1]]
=> [1]
=> [1,0]
=> 1
Description
The number of weak left to right maxima of a Dyck path.
A weak left to right maximum is a peak whose height is larger than or equal to the height of all peaks to its
left.
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!