searching the database
Your data matches 175 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St001034
(load all 97 compositions to match this statistic)
(load all 97 compositions to match this statistic)
St001034: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> 1 = 2 - 1
[1,0,1,0]
=> 2 = 3 - 1
[1,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,0]
=> 3 = 4 - 1
[1,0,1,1,0,0]
=> 3 = 4 - 1
[1,1,0,0,1,0]
=> 3 = 4 - 1
[1,1,0,1,0,0]
=> 3 = 4 - 1
[1,1,1,0,0,0]
=> 4 = 5 - 1
[1,0,1,0,1,0,1,0]
=> 4 = 5 - 1
[1,0,1,0,1,1,0,0]
=> 4 = 5 - 1
[1,0,1,1,0,0,1,0]
=> 4 = 5 - 1
[1,0,1,1,0,1,0,0]
=> 4 = 5 - 1
[1,1,0,0,1,0,1,0]
=> 4 = 5 - 1
[1,1,0,0,1,1,0,0]
=> 4 = 5 - 1
[1,1,0,1,0,0,1,0]
=> 4 = 5 - 1
[1,1,0,1,0,1,0,0]
=> 4 = 5 - 1
[1,0,1,0,1,0,1,0,1,0]
=> 5 = 6 - 1
[1,0,1,0,1,0,1,1,0,0]
=> 5 = 6 - 1
[1,0,1,0,1,1,0,0,1,0]
=> 5 = 6 - 1
[1,0,1,0,1,1,0,1,0,0]
=> 5 = 6 - 1
[1,0,1,1,0,0,1,0,1,0]
=> 5 = 6 - 1
[1,0,1,1,0,0,1,1,0,0]
=> 5 = 6 - 1
[1,0,1,1,0,1,0,0,1,0]
=> 5 = 6 - 1
[1,0,1,1,0,1,0,1,0,0]
=> 5 = 6 - 1
[1,1,0,0,1,0,1,0,1,0]
=> 5 = 6 - 1
[1,1,0,0,1,0,1,1,0,0]
=> 5 = 6 - 1
[1,1,0,1,0,0,1,0,1,0]
=> 5 = 6 - 1
[1,1,0,1,0,0,1,1,0,0]
=> 5 = 6 - 1
[1,1,0,1,0,1,0,0,1,0]
=> 5 = 6 - 1
[1,1,0,1,0,1,0,1,0,0]
=> 5 = 6 - 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 7 - 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> 6 = 7 - 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> 6 = 7 - 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> 6 = 7 - 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> 6 = 7 - 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> 6 = 7 - 1
[1,0,1,0,1,1,0,1,0,1,0,0]
=> 6 = 7 - 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> 6 = 7 - 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> 6 = 7 - 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> 6 = 7 - 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> 6 = 7 - 1
[1,0,1,1,0,1,0,1,0,1,0,0]
=> 6 = 7 - 1
[1,1,0,0,1,0,1,0,1,0,1,0]
=> 6 = 7 - 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> 6 = 7 - 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> 6 = 7 - 1
[1,1,0,0,1,0,1,1,0,1,0,0]
=> 6 = 7 - 1
[1,1,0,1,0,0,1,0,1,0,1,0]
=> 6 = 7 - 1
[1,1,0,1,0,0,1,0,1,1,0,0]
=> 6 = 7 - 1
[1,1,0,1,0,1,0,0,1,0,1,0]
=> 6 = 7 - 1
[1,1,0,1,0,1,0,1,0,0,1,0]
=> 6 = 7 - 1
Description
The area of the parallelogram polyomino associated with the Dyck path.
The (bivariate) generating function is given in [1].
Matching statistic: St000394
(load all 7 compositions to match this statistic)
(load all 7 compositions to match this statistic)
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St000394: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St000394: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,1,0,0]
=> 1 = 2 - 1
[1,0,1,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> 2 = 3 - 1
[1,1,0,0]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> 2 = 3 - 1
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 3 = 4 - 1
[1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 3 = 4 - 1
[1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 3 = 4 - 1
[1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 3 = 4 - 1
[1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 4 = 5 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 4 = 5 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 4 = 5 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 4 = 5 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 4 = 5 - 1
[1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 4 = 5 - 1
[1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 4 = 5 - 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 4 = 5 - 1
[1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 4 = 5 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 5 = 6 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 5 = 6 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> 5 = 6 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> 5 = 6 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> 5 = 6 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> 5 = 6 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> 5 = 6 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> 5 = 6 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,1,1,1,0,0,0,0,0]
=> 5 = 6 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> 5 = 6 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> 5 = 6 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> 5 = 6 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> 5 = 6 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 5 = 6 - 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 6 = 7 - 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> 6 = 7 - 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,1,0,0,0]
=> 6 = 7 - 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,1,0,1,0,0]
=> 6 = 7 - 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,1,1,0,0,0,0]
=> 6 = 7 - 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,0,1,1,0,0,0]
=> 6 = 7 - 1
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,1,0,1,0,1,0,0]
=> 6 = 7 - 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,1,1,1,0,0,0,0,0]
=> 6 = 7 - 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,1,0,0]
=> 6 = 7 - 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,1,1,1,0,0,0,0]
=> 6 = 7 - 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,1,1,0,0,0]
=> 6 = 7 - 1
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> 6 = 7 - 1
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,1,1,1,1,1,0,0,0,0,0,0]
=> 6 = 7 - 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,1,1,1,0,0,0,0,1,0,0]
=> 6 = 7 - 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,1,0,0,0,1,1,0,0,0]
=> 6 = 7 - 1
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,1,0,0]
=> 6 = 7 - 1
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,1,1,1,0,0,0,0,0]
=> 6 = 7 - 1
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,1,0,0,0,1,0,0]
=> 6 = 7 - 1
[1,1,0,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,0,1,1,1,0,0,0,0]
=> 6 = 7 - 1
[1,1,0,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,1,0,0,0]
=> 6 = 7 - 1
Description
The sum of the heights of the peaks of a Dyck path minus the number of peaks.
Matching statistic: St000645
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St000645: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00103: Dyck paths —peeling map⟶ Dyck paths
St000645: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1 = 2 - 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 2 = 3 - 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 2 = 3 - 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 3 = 4 - 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 4 = 5 - 1
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4 = 5 - 1
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4 = 5 - 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4 = 5 - 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4 = 5 - 1
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4 = 5 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4 = 5 - 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4 = 5 - 1
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 4 = 5 - 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,0,1,0,1,0,1,0,1,0]
=> 5 = 6 - 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,0,1,0,1,0,1,0,1,0]
=> 5 = 6 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 5 = 6 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 5 = 6 - 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,0,1,0,1,0,1,0]
=> 5 = 6 - 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,0,1,0,1,0]
=> 5 = 6 - 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,0,1,0,1,0,1,0]
=> 5 = 6 - 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,0,1,0,1,0,1,0]
=> 5 = 6 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 5 = 6 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 5 = 6 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 5 = 6 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 5 = 6 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 5 = 6 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 5 = 6 - 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 7 - 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 7 - 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 7 - 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 7 - 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 7 - 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 7 - 1
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 7 - 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 7 - 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 7 - 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 7 - 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 7 - 1
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 7 - 1
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 7 - 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 7 - 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 7 - 1
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 7 - 1
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 7 - 1
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 7 - 1
[1,1,0,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 7 - 1
[1,1,0,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 6 = 7 - 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)
$$
Matching statistic: St000108
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00060: Permutations —Robinson-Schensted tableau shape⟶ Integer partitions
St000108: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00060: Permutations —Robinson-Schensted tableau shape⟶ Integer partitions
St000108: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [1]
=> 2
[1,0,1,0]
=> [1,2] => [1,2] => [2]
=> 3
[1,1,0,0]
=> [2,1] => [1,2] => [2]
=> 3
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [3]
=> 4
[1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => [3]
=> 4
[1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => [3]
=> 4
[1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => [3]
=> 4
[1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => [2,1]
=> 5
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [4]
=> 5
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => [4]
=> 5
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => [4]
=> 5
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => [4]
=> 5
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => [4]
=> 5
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => [4]
=> 5
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => [4]
=> 5
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,2,3,4] => [4]
=> 5
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [5]
=> 6
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,4,5] => [5]
=> 6
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => [5]
=> 6
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,3,4,5] => [5]
=> 6
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => [5]
=> 6
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,2,3,4,5] => [5]
=> 6
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,2,3,4,5] => [5]
=> 6
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,2,3,4,5] => [5]
=> 6
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => [5]
=> 6
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => [5]
=> 6
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,2,3,4,5] => [5]
=> 6
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [1,2,3,4,5] => [5]
=> 6
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [1,2,3,4,5] => [5]
=> 6
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => [5]
=> 6
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6] => [1,2,3,4,5,6] => [6]
=> 7
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,4,6,5] => [1,2,3,4,5,6] => [6]
=> 7
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,2,3,5,4,6] => [1,2,3,4,5,6] => [6]
=> 7
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,2,3,5,6,4] => [1,2,3,4,5,6] => [6]
=> 7
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,2,4,3,5,6] => [1,2,3,4,5,6] => [6]
=> 7
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,2,4,5,3,6] => [1,2,3,4,5,6] => [6]
=> 7
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,2,4,5,6,3] => [1,2,3,4,5,6] => [6]
=> 7
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,3,2,4,5,6] => [1,2,3,4,5,6] => [6]
=> 7
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,3,2,4,6,5] => [1,2,3,4,5,6] => [6]
=> 7
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,3,4,2,5,6] => [1,2,3,4,5,6] => [6]
=> 7
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,3,4,5,2,6] => [1,2,3,4,5,6] => [6]
=> 7
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,3,4,5,6,2] => [1,2,3,4,5,6] => [6]
=> 7
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,3,4,5,6] => [1,2,3,4,5,6] => [6]
=> 7
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [2,1,3,4,6,5] => [1,2,3,4,5,6] => [6]
=> 7
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [2,1,3,5,4,6] => [1,2,3,4,5,6] => [6]
=> 7
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [2,1,3,5,6,4] => [1,2,3,4,5,6] => [6]
=> 7
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6] => [1,2,3,4,5,6] => [6]
=> 7
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [2,3,1,4,6,5] => [1,2,3,4,5,6] => [6]
=> 7
[1,1,0,1,0,1,0,0,1,0,1,0]
=> [2,3,4,1,5,6] => [1,2,3,4,5,6] => [6]
=> 7
[1,1,0,1,0,1,0,1,0,0,1,0]
=> [2,3,4,5,1,6] => [1,2,3,4,5,6] => [6]
=> 7
Description
The number of partitions contained in the given partition.
Matching statistic: St000395
(load all 45 compositions to match this statistic)
(load all 45 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00030: Dyck paths —zeta map⟶ Dyck paths
St000395: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00030: Dyck paths —zeta map⟶ Dyck paths
St000395: 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,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 3
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 3
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 5
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[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,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[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,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[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,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[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,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[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,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,1,0,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,1,0,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
Description
The sum of the heights of the peaks of a Dyck path.
Matching statistic: St000532
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00031: Dyck paths —to 312-avoiding permutation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00060: Permutations —Robinson-Schensted tableau shape⟶ Integer partitions
St000532: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00060: Permutations —Robinson-Schensted tableau shape⟶ Integer partitions
St000532: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [1]
=> 2
[1,0,1,0]
=> [1,2] => [1,2] => [2]
=> 3
[1,1,0,0]
=> [2,1] => [1,2] => [2]
=> 3
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [3]
=> 4
[1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => [3]
=> 4
[1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => [3]
=> 4
[1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => [3]
=> 4
[1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => [2,1]
=> 5
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [4]
=> 5
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => [4]
=> 5
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => [4]
=> 5
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => [4]
=> 5
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => [4]
=> 5
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => [4]
=> 5
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => [4]
=> 5
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,2,3,4] => [4]
=> 5
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [5]
=> 6
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,4,5] => [5]
=> 6
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => [5]
=> 6
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,3,4,5] => [5]
=> 6
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => [5]
=> 6
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,2,3,4,5] => [5]
=> 6
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,2,3,4,5] => [5]
=> 6
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,2,3,4,5] => [5]
=> 6
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => [5]
=> 6
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => [5]
=> 6
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,2,3,4,5] => [5]
=> 6
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [1,2,3,4,5] => [5]
=> 6
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [1,2,3,4,5] => [5]
=> 6
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => [5]
=> 6
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6] => [1,2,3,4,5,6] => [6]
=> 7
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,4,6,5] => [1,2,3,4,5,6] => [6]
=> 7
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,2,3,5,4,6] => [1,2,3,4,5,6] => [6]
=> 7
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,2,3,5,6,4] => [1,2,3,4,5,6] => [6]
=> 7
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,2,4,3,5,6] => [1,2,3,4,5,6] => [6]
=> 7
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,2,4,5,3,6] => [1,2,3,4,5,6] => [6]
=> 7
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,2,4,5,6,3] => [1,2,3,4,5,6] => [6]
=> 7
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,3,2,4,5,6] => [1,2,3,4,5,6] => [6]
=> 7
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,3,2,4,6,5] => [1,2,3,4,5,6] => [6]
=> 7
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,3,4,2,5,6] => [1,2,3,4,5,6] => [6]
=> 7
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,3,4,5,2,6] => [1,2,3,4,5,6] => [6]
=> 7
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,3,4,5,6,2] => [1,2,3,4,5,6] => [6]
=> 7
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,3,4,5,6] => [1,2,3,4,5,6] => [6]
=> 7
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [2,1,3,4,6,5] => [1,2,3,4,5,6] => [6]
=> 7
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [2,1,3,5,4,6] => [1,2,3,4,5,6] => [6]
=> 7
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [2,1,3,5,6,4] => [1,2,3,4,5,6] => [6]
=> 7
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6] => [1,2,3,4,5,6] => [6]
=> 7
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [2,3,1,4,6,5] => [1,2,3,4,5,6] => [6]
=> 7
[1,1,0,1,0,1,0,0,1,0,1,0]
=> [2,3,4,1,5,6] => [1,2,3,4,5,6] => [6]
=> 7
[1,1,0,1,0,1,0,1,0,0,1,0]
=> [2,3,4,5,1,6] => [1,2,3,4,5,6] => [6]
=> 7
Description
The total number of rook placements on a Ferrers board.
Matching statistic: St000912
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
Mp00232: Dyck paths —parallelogram poset⟶ Posets
St000912: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00222: Dyck paths —peaks-to-valleys⟶ Dyck paths
Mp00232: Dyck paths —parallelogram poset⟶ Posets
St000912: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> ([(0,1)],2)
=> 2
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> ([(0,2),(2,1)],3)
=> 3
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> ([(0,2),(2,1)],3)
=> 3
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> 4
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> 4
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> 4
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> ([(0,3),(2,1),(3,2)],4)
=> 4
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 5
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 5
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 5
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 5
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 5
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 5
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> ([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> 5
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 5
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 5
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 6
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 6
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 6
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 6
[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,1,0,1,0,0,1,0,1,0]
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 6
[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,1,0,1,1,0,0,1,0,0]
=> ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
=> 6
[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,1,0,1,0,1,0,0,1,0]
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 6
[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,1,0,1,0,1,0,1,0,0]
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 6
[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,1,0,0,1,0,1,0,1,0]
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 6
[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,1,0,0,1,1,0,1,0,0]
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 6
[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,1,0,1,0,0,1,0,1,0]
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 6
[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,1,0,1,1,0,0,1,0,0]
=> ([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
=> 6
[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,1,0,1,0,1,0,0,1,0]
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 6
[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,1,0,1,0,1,0,1,0,0]
=> ([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> 6
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> 7
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> 7
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0,1,0]
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> 7
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> 7
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0,1,0]
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> 7
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0,1,0]
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> 7
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> 7
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0,1,0]
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> 7
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,1,0,0]
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> 7
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0,1,0]
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> 7
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0,1,0]
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> 7
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> 7
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> 7
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,1,0,1,0,0]
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> 7
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0,1,0]
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> 7
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,1,0,0]
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> 7
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0,1,0]
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> 7
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,1,0,1,0,0]
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> 7
[1,1,0,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0,1,0]
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> 7
[1,1,0,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0,1,0]
=> ([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> 7
Description
The number of maximal antichains in a poset.
Matching statistic: St001348
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St001348: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St001348: 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,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 3
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 3
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 5
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[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,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[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,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[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,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[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,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[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,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,1,0,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,1,0,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
Description
The bounce of the parallelogram polyomino associated with the Dyck path.
A bijection due to Delest and Viennot [1] associates a Dyck path with a parallelogram polyomino. The bounce statistic is defined in [2].
Matching statistic: St001809
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00030: Dyck paths —zeta map⟶ Dyck paths
St001809: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00103: Dyck paths —peeling map⟶ Dyck paths
Mp00030: Dyck paths —zeta map⟶ Dyck paths
St001809: 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,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 3
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 3
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 4
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,0]
=> 5
[1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 5
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[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,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[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,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[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,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[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,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[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,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 6
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [1,1,1,0,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,1,0,1,0,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
[1,1,0,1,0,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 7
Description
The index of the step at the first peak of maximal height in a Dyck path.
Matching statistic: St000867
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00204: Permutations —LLPS⟶ Integer partitions
St000867: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00090: Permutations —cycle-as-one-line notation⟶ Permutations
Mp00204: Permutations —LLPS⟶ Integer partitions
St000867: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [1]
=> 1 = 2 - 1
[1,0,1,0]
=> [1,2] => [1,2] => [1,1]
=> 2 = 3 - 1
[1,1,0,0]
=> [2,1] => [1,2] => [1,1]
=> 2 = 3 - 1
[1,0,1,0,1,0]
=> [1,2,3] => [1,2,3] => [1,1,1]
=> 3 = 4 - 1
[1,0,1,1,0,0]
=> [1,3,2] => [1,2,3] => [1,1,1]
=> 3 = 4 - 1
[1,1,0,0,1,0]
=> [2,1,3] => [1,2,3] => [1,1,1]
=> 3 = 4 - 1
[1,1,0,1,0,0]
=> [2,3,1] => [1,2,3] => [1,1,1]
=> 3 = 4 - 1
[1,1,1,0,0,0]
=> [3,2,1] => [1,3,2] => [2,1]
=> 4 = 5 - 1
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [1,2,3,4] => [1,1,1,1]
=> 4 = 5 - 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [1,2,3,4,5] => [1,1,1,1,1]
=> 5 = 6 - 1
[1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6] => [1,2,3,4,5,6] => [1,1,1,1,1,1]
=> 6 = 7 - 1
[1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,4,6,5] => [1,2,3,4,5,6] => [1,1,1,1,1,1]
=> 6 = 7 - 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,2,3,5,4,6] => [1,2,3,4,5,6] => [1,1,1,1,1,1]
=> 6 = 7 - 1
[1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,2,3,5,6,4] => [1,2,3,4,5,6] => [1,1,1,1,1,1]
=> 6 = 7 - 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,2,4,3,5,6] => [1,2,3,4,5,6] => [1,1,1,1,1,1]
=> 6 = 7 - 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,2,4,5,3,6] => [1,2,3,4,5,6] => [1,1,1,1,1,1]
=> 6 = 7 - 1
[1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,2,4,5,6,3] => [1,2,3,4,5,6] => [1,1,1,1,1,1]
=> 6 = 7 - 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,3,2,4,5,6] => [1,2,3,4,5,6] => [1,1,1,1,1,1]
=> 6 = 7 - 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,3,2,4,6,5] => [1,2,3,4,5,6] => [1,1,1,1,1,1]
=> 6 = 7 - 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,3,4,2,5,6] => [1,2,3,4,5,6] => [1,1,1,1,1,1]
=> 6 = 7 - 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,3,4,5,2,6] => [1,2,3,4,5,6] => [1,1,1,1,1,1]
=> 6 = 7 - 1
[1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,3,4,5,6,2] => [1,2,3,4,5,6] => [1,1,1,1,1,1]
=> 6 = 7 - 1
[1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,3,4,5,6] => [1,2,3,4,5,6] => [1,1,1,1,1,1]
=> 6 = 7 - 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [2,1,3,4,6,5] => [1,2,3,4,5,6] => [1,1,1,1,1,1]
=> 6 = 7 - 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [2,1,3,5,4,6] => [1,2,3,4,5,6] => [1,1,1,1,1,1]
=> 6 = 7 - 1
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [2,1,3,5,6,4] => [1,2,3,4,5,6] => [1,1,1,1,1,1]
=> 6 = 7 - 1
[1,1,0,1,0,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6] => [1,2,3,4,5,6] => [1,1,1,1,1,1]
=> 6 = 7 - 1
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [2,3,1,4,6,5] => [1,2,3,4,5,6] => [1,1,1,1,1,1]
=> 6 = 7 - 1
[1,1,0,1,0,1,0,0,1,0,1,0]
=> [2,3,4,1,5,6] => [1,2,3,4,5,6] => [1,1,1,1,1,1]
=> 6 = 7 - 1
[1,1,0,1,0,1,0,1,0,0,1,0]
=> [2,3,4,5,1,6] => [1,2,3,4,5,6] => [1,1,1,1,1,1]
=> 6 = 7 - 1
Description
The sum of the hook lengths in the first row of an integer partition.
For a cell in the Ferrers diagram of a partition, the hook length is given by the number of boxes to its right plus the number of boxes below plus one. This statistic is the sum of the hook lengths of the first row of a partition.
Put differently, for a partition of size $n$ with first parth $\lambda_1$, this is $\binom{\lambda_1}{2} + n$.
The following 165 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000189The number of elements in the poset. St001018Sum of projective dimension of the indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001218Smallest index k greater than or equal to one such that the Coxeter matrix C of the corresponding Nakayama algebra has C^k=1. St001717The largest size of an interval in a poset. St001300The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset. St000070The number of antichains in a poset. St000104The number of facets in the order polytope of this poset. St000151The number of facets in the chain polytope of the poset. St001065Number of indecomposable reflexive modules in the corresponding Nakayama algebra. St001664The number of non-isomorphic subposets of a poset. St000228The size of a partition. St000229Sum of the difference between the maximal and the minimal elements of the blocks plus the number of blocks of a set partition. St000459The hook length of the base cell of a partition. St000460The hook length of the last cell along the main diagonal of an integer partition. St000479The Ramsey number of a graph. St000636The hull number of a graph. St000743The number of entries in a standard Young tableau such that the next integer is a neighbour. St000870The product of the hook lengths of the diagonal cells in an integer partition. St000917The open packing number of a graph. St000918The 2-limited packing number of a graph. St001315The dissociation number of a graph. St001318The number of vertices of the largest induced subforest with the same number of connected components of a graph. St001321The number of vertices of the largest induced subforest of a graph. St001342The number of vertices in the center of a graph. St001615The number of join prime elements of a lattice. St001617The dimension of the space of valuations of a lattice. St001622The number of join-irreducible elements of a lattice. St001654The monophonic hull number of a graph. St001655The general position number of a graph. St001656The monophonic position number of a graph. St001672The restrained domination number of a graph. St001707The length of a longest path in a graph such that the remaining vertices can be partitioned into two sets of the same size without edges between them. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001119The length of a shortest maximal path in a graph. St001120The length of a longest path in a graph. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. St000093The cardinality of a maximal independent set of vertices of a graph. St000438The position of the last up step in a Dyck path. St000550The number of modular elements of a lattice. St000551The number of left modular elements of a lattice. St000935The number of ordered refinements of an integer partition. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001616The number of neutral elements in a lattice. St000087The number of induced subgraphs. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000548The number of different non-empty partial sums of an integer partition. St000728The dimension of a set partition. St000874The position of the last double rise in a Dyck path. St000926The clique-coclique number of a graph. St001110The 3-dynamic chromatic number of a graph. St001228The vector space dimension of the space of module homomorphisms between J and itself when J denotes the Jacobson radical of the corresponding Nakayama algebra. St001254The vector space dimension of the first extension-group between A/soc(A) and J when A is the corresponding Nakayama algebra with Jacobson radical J. St001441The number of non-empty connected induced subgraphs of a graph. St001725The harmonious chromatic number of a graph. St001746The coalition number of a graph. St000171The degree of the graph. St000238The number of indices that are not small weak excedances. St000334The maz index, the major index of a permutation after replacing fixed points by zeros. St000339The maf index of a permutation. St000446The disorder of a permutation. St000868The aid statistic in the sense of Shareshian-Wachs. St001391The disjunction number of a graph. St001558The number of transpositions that are smaller or equal to a permutation in Bruhat order. St001651The Frankl number of a lattice. St001759The Rajchgot index of a permutation. St001846The number of elements which do not have a complement in the lattice. St000656The number of cuts of a poset. St000520The number of patterns in a permutation. St001875The number of simple modules with projective dimension at most 1. St000625The sum of the minimal distances to a greater element. St000681The Grundy value of Chomp on Ferrers diagrams. St000294The number of distinct factors of a binary word. St000518The number of distinct subsequences in a binary word. St000770The major index of an integer partition when read from bottom to top. St001330The hat guessing number of a graph. St001645The pebbling number of a connected graph. St000454The largest eigenvalue of a graph if it is integral. St000794The mak of a permutation. St000795The mad of a permutation. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St000998Number of indecomposable projective modules with injective dimension smaller than or equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St001650The order of Ringel's homological bijection associated to the linear Nakayama algebra corresponding to the Dyck path. St000144The pyramid weight of the Dyck path. St000967The value p(1) for the Coxeterpolynomial p of the corresponding LNakayama algebra. St001020Sum of the codominant dimensions of the non-projective indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St000018The number of inversions of a permutation. St001033The normalized area of the parallelogram polyomino associated with the Dyck path. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St000029The depth of a permutation. St000224The sorting index of a permutation. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001726The number of visible inversions of a permutation. St001019Sum of the projective dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St000030The sum of the descent differences of a permutations. St000058The order of a permutation. St001213The number of indecomposable modules in the corresponding Nakayama algebra that have vanishing first Ext-group with the regular module. St001579The number of cyclically simple transpositions decreasing the number of cyclic descents needed to sort a permutation. St001869The maximum cut size of a graph. St000197The number of entries equal to positive one in the alternating sign matrix. St000680The Grundy value for Hackendot on posets. St000809The reduced reflection length of the permutation. St000957The number of Bruhat lower covers of a permutation. St001003The number of indecomposable modules with projective dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001076The minimal length of a factorization of a permutation into transpositions that are cyclic shifts of (12). St001077The prefix exchange distance of a permutation. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St000744The length of the path to the largest entry in a standard Young tableau. St001894The depth of a signed permutation. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St000223The number of nestings in the permutation. St001727The number of invisible inversions of a permutation. St000393The number of strictly increasing runs in a binary word. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000670The reversal length of a permutation. St000245The number of ascents of a permutation. St000327The number of cover relations in a poset. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St001637The number of (upper) dissectors of a poset. St001668The number of points of the poset minus the width of the poset. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001554The number of distinct nonempty subtrees of a binary tree. St000672The number of minimal elements in Bruhat order not less than the permutation. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St000718The largest Laplacian eigenvalue of a graph if it is integral. St001621The number of atoms of a lattice. St000703The number of deficiencies of a permutation. St000259The diameter of a connected graph. St000519The largest length of a factor maximising the subword complexity. St000922The minimal number such that all substrings of this length are unique. St001821The sorting index of a signed permutation. St001861The number of Bruhat lower covers of a permutation. St000527The width of the poset. St000845The maximal number of elements covered by an element in a poset. St000863The length of the first row of the shifted shape of a permutation. St000062The length of the longest increasing subsequence of the permutation. St000155The number of exceedances (also excedences) of a permutation. St000308The height of the tree associated to a permutation. St000331The number of upper interactions of a Dyck path. St000354The number of recoils of a permutation. St000632The jump number of the poset. St000829The Ulam distance of a permutation to the identity permutation. St001405The number of bonds in a permutation. St001489The maximum of the number of descents and the number of inverse descents. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001798The difference of the number of edges in a graph and the number of edges in the complement of the Turán graph. St000133The "bounce" of a permutation. St000624The normalized sum of the minimal distances to a greater element. St001565The number of arithmetic progressions of length 2 in a permutation. St001623The number of doubly irreducible elements of a lattice. St001626The number of maximal proper sublattices of a lattice. St000702The number of weak deficiencies of a permutation. St000462The major index minus the number of excedences of a permutation. St000080The rank of the poset. St000307The number of rowmotion orbits of a poset. St001812The biclique partition number of a graph. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St000306The bounce count of a Dyck path.
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!