Processing math: 50%

Your data matches 1135 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St001876
Mp00057: Parking functions to touch compositionInteger compositions
Mp00180: Integer compositions to ribbonSkew partitions
Mp00192: Skew partitions dominating sublatticeLattices
St001876: Lattices ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,1,3,3,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,1,3,5,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,1,5,3,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,3,1,3,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,3,1,5,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,3,3,1,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,3,3,5,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,3,5,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,3,5,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,5,1,3,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,5,3,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,5,3,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[3,1,1,3,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[3,1,1,5,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[3,1,3,1,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[3,1,3,5,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[3,1,5,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[3,1,5,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[3,3,1,1,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[3,3,1,5,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[3,3,5,1,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[3,5,1,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[3,5,1,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[3,5,3,1,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[5,1,1,3,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[5,1,3,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[5,1,3,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[5,3,1,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[5,3,1,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[5,3,3,1,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,2,2,4,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,2,4,2,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,2,4,4,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,4,2,2,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,4,2,4,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,4,4,2,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[2,1,2,4,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[2,1,4,2,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[2,1,4,4,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[2,2,1,4,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[2,2,4,1,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[2,2,4,4,1] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[2,4,1,2,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[2,4,1,4,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[2,4,2,1,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[2,4,2,4,1] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[2,4,4,1,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[2,4,4,2,1] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[4,1,2,2,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[4,1,2,4,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
Description
The number of 2-regular simple modules in the incidence algebra of the lattice.
Matching statistic: St001877
Mp00057: Parking functions to touch compositionInteger compositions
Mp00180: Integer compositions to ribbonSkew partitions
Mp00192: Skew partitions dominating sublatticeLattices
St001877: Lattices ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,1,3,3,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,1,3,5,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,1,5,3,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,3,1,3,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,3,1,5,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,3,3,1,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,3,3,5,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,3,5,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,3,5,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,5,1,3,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,5,3,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,5,3,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[3,1,1,3,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[3,1,1,5,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[3,1,3,1,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[3,1,3,5,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[3,1,5,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[3,1,5,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[3,3,1,1,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[3,3,1,5,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[3,3,5,1,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[3,5,1,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[3,5,1,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[3,5,3,1,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[5,1,1,3,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[5,1,3,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[5,1,3,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[5,3,1,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[5,3,1,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[5,3,3,1,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,2,2,4,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,2,4,2,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,2,4,4,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,4,2,2,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,4,2,4,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[1,4,4,2,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[2,1,2,4,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[2,1,4,2,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[2,1,4,4,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[2,2,1,4,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[2,2,4,1,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[2,2,4,4,1] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[2,4,1,2,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[2,4,1,4,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[2,4,2,1,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[2,4,2,4,1] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[2,4,4,1,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[2,4,4,2,1] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[4,1,2,2,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
[4,1,2,4,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 0
Description
Number of indecomposable injective modules with projective dimension 2.
Matching statistic: St001623
Mp00057: Parking functions to touch compositionInteger compositions
Mp00180: Integer compositions to ribbonSkew partitions
Mp00192: Skew partitions dominating sublatticeLattices
St001623: Lattices ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,1,3,3,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,1,3,5,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,1,5,3,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,3,1,3,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,3,1,5,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,3,3,1,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,3,3,5,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,3,5,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,3,5,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,5,1,3,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,5,3,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,5,3,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,1,1,3,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,1,1,5,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,1,3,1,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,1,3,5,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,1,5,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,1,5,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,3,1,1,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,3,1,5,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,3,5,1,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,5,1,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,5,1,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,5,3,1,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[5,1,1,3,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[5,1,3,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[5,1,3,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[5,3,1,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[5,3,1,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[5,3,3,1,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,2,2,4,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,2,4,2,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,2,4,4,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,4,2,2,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,4,2,4,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,4,4,2,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,1,2,4,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,1,4,2,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,1,4,4,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,2,1,4,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,2,4,1,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,2,4,4,1] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,4,1,2,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,4,1,4,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,4,2,1,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,4,2,4,1] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,4,4,1,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,4,4,2,1] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[4,1,2,2,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[4,1,2,4,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
Description
The number of doubly irreducible elements of a lattice. An element d of a lattice L is '''doubly irreducible''' if it is both join and meet irreducible. That means, d is neither the least nor the greatest element of L and if d=xy or d=xy, then d{x,y} for all x,yL. In a finite lattice, the doubly irreducible elements are those which cover and are covered by a unique element.
Matching statistic: St001624
Mp00057: Parking functions to touch compositionInteger compositions
Mp00180: Integer compositions to ribbonSkew partitions
Mp00192: Skew partitions dominating sublatticeLattices
St001624: Lattices ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,1,3,3,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,1,3,5,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,1,5,3,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,3,1,3,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,3,1,5,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,3,3,1,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,3,3,5,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,3,5,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,3,5,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,5,1,3,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,5,3,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,5,3,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,1,1,3,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,1,1,5,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,1,3,1,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,1,3,5,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,1,5,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,1,5,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,3,1,1,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,3,1,5,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,3,5,1,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,5,1,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,5,1,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,5,3,1,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[5,1,1,3,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[5,1,3,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[5,1,3,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[5,3,1,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[5,3,1,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[5,3,3,1,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,2,2,4,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,2,4,2,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,2,4,4,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,4,2,2,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,4,2,4,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,4,4,2,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,1,2,4,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,1,4,2,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,1,4,4,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,2,1,4,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,2,4,1,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,2,4,4,1] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,4,1,2,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,4,1,4,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,4,2,1,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,4,2,4,1] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,4,4,1,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,4,4,2,1] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[4,1,2,2,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[4,1,2,4,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
Description
The breadth of a lattice. The '''breadth''' of a lattice is the least integer b such that any join x1x2xn, with n>b, can be expressed as a join over a proper subset of {x1,x2,,xn}.
Matching statistic: St001630
Mp00057: Parking functions to touch compositionInteger compositions
Mp00180: Integer compositions to ribbonSkew partitions
Mp00192: Skew partitions dominating sublatticeLattices
St001630: Lattices ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,1,3,3,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,1,3,5,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,1,5,3,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,3,1,3,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,3,1,5,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,3,3,1,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,3,3,5,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,3,5,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,3,5,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,5,1,3,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,5,3,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,5,3,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,1,1,3,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,1,1,5,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,1,3,1,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,1,3,5,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,1,5,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,1,5,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,3,1,1,5] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,3,1,5,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,3,5,1,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,5,1,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,5,1,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[3,5,3,1,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[5,1,1,3,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[5,1,3,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[5,1,3,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[5,3,1,1,3] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[5,3,1,3,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[5,3,3,1,1] => [2,2,1] => [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,2,2,4,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,2,4,2,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,2,4,4,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,4,2,2,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,4,2,4,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[1,4,4,2,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,1,2,4,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,1,4,2,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,1,4,4,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,2,1,4,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,2,4,1,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,2,4,4,1] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,4,1,2,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,4,1,4,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,4,2,1,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,4,2,4,1] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,4,4,1,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[2,4,4,2,1] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[4,1,2,2,4] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
[4,1,2,4,2] => [1,2,2] => [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> 1 = 0 + 1
Description
The global dimension of the incidence algebra of the lattice over the rational numbers.
Mp00056: Parking functions to Dyck pathDyck paths
Mp00201: Dyck paths RingelPermutations
Mp00223: Permutations runsortPermutations
St000650: Permutations ⟶ ℤResult quality: 54% values known / values provided: 54%distinct values known / distinct values provided: 100%
Values
[1,1,3,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[1,1,3,5,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[1,1,5,3,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[1,3,1,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[1,3,1,5,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[1,3,3,1,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[1,3,3,5,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[1,3,5,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[1,3,5,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[1,5,1,3,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[1,5,3,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[1,5,3,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[3,1,1,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[3,1,1,5,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[3,1,3,1,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[3,1,3,5,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[3,1,5,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[3,1,5,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[3,3,1,1,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[3,3,1,5,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[3,3,5,1,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[3,5,1,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[3,5,1,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[3,5,3,1,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[5,1,1,3,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[5,1,3,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[5,1,3,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[5,3,1,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[5,3,1,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[5,3,3,1,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [1,6,2,4,3,5] => 0
[1,2,2,4,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [1,5,2,6,3,4] => 0
[1,2,4,2,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [1,5,2,6,3,4] => 0
[1,2,4,4,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [1,5,2,6,3,4] => 0
[1,4,2,2,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [1,5,2,6,3,4] => 0
[1,4,2,4,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [1,5,2,6,3,4] => 0
[1,4,4,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [1,5,2,6,3,4] => 0
[2,1,2,4,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [1,5,2,6,3,4] => 0
[2,1,4,2,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [1,5,2,6,3,4] => 0
[2,1,4,4,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [1,5,2,6,3,4] => 0
[2,2,1,4,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [1,5,2,6,3,4] => 0
[2,2,4,1,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [1,5,2,6,3,4] => 0
[2,2,4,4,1] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [1,5,2,6,3,4] => 0
[2,4,1,2,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [1,5,2,6,3,4] => 0
[2,4,1,4,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [1,5,2,6,3,4] => 0
[2,4,2,1,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [1,5,2,6,3,4] => 0
[2,4,2,4,1] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [1,5,2,6,3,4] => 0
[2,4,4,1,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [1,5,2,6,3,4] => 0
[2,4,4,2,1] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [1,5,2,6,3,4] => 0
[4,1,2,2,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [1,5,2,6,3,4] => 0
[4,1,2,4,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [1,5,2,6,3,4] => 0
[1,1,1,4,4,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [1,6,7,2,3,5,4] => ? = 0
[1,1,4,1,4,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [1,6,7,2,3,5,4] => ? = 0
[1,1,4,4,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [1,6,7,2,3,5,4] => ? = 0
[1,1,4,4,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [1,6,7,2,3,5,4] => ? = 0
[1,4,1,1,4,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [1,6,7,2,3,5,4] => ? = 0
[1,4,1,4,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [1,6,7,2,3,5,4] => ? = 0
[1,4,1,4,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [1,6,7,2,3,5,4] => ? = 0
[1,4,4,1,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [1,6,7,2,3,5,4] => ? = 0
[1,4,4,1,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [1,6,7,2,3,5,4] => ? = 0
[1,4,4,4,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [1,6,7,2,3,5,4] => ? = 0
[4,1,1,1,4,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [1,6,7,2,3,5,4] => ? = 0
[4,1,1,4,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [1,6,7,2,3,5,4] => ? = 0
[4,1,1,4,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [1,6,7,2,3,5,4] => ? = 0
[4,1,4,1,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [1,6,7,2,3,5,4] => ? = 0
[4,1,4,1,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [1,6,7,2,3,5,4] => ? = 0
[4,1,4,4,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [1,6,7,2,3,5,4] => ? = 0
[4,4,1,1,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [1,6,7,2,3,5,4] => ? = 0
[4,4,1,1,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [1,6,7,2,3,5,4] => ? = 0
[4,4,1,4,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [1,6,7,2,3,5,4] => ? = 0
[4,4,4,1,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [1,6,7,2,3,5,4] => ? = 0
[1,1,1,4,4,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,1,1,4,5,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,1,1,5,4,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,1,4,1,4,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,1,4,1,5,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,1,4,4,1,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,1,4,4,5,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,1,4,5,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,1,4,5,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,1,5,1,4,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,1,5,4,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,1,5,4,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,4,1,1,4,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,4,1,1,5,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,4,1,4,1,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,4,1,4,5,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,4,1,5,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,4,1,5,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,4,4,1,1,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,4,4,1,5,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,4,4,5,1,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,4,5,1,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,4,5,1,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,4,5,4,1,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,5,1,1,4,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,5,1,4,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,5,1,4,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,5,4,1,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,5,4,1,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
[1,5,4,4,1,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [1,6,2,3,7,4,5] => ? = 0
Description
The number of 3-rises of a permutation. A 3-rise of a permutation π is an index i such that π(i)+3=π(i+1). For 1-rises, or successions, see [[St000441]], for 2-rises see [[St000534]].
Mp00056: Parking functions to Dyck pathDyck paths
Mp00201: Dyck paths RingelPermutations
Mp00175: Permutations inverse Foata bijectionPermutations
St000664: Permutations ⟶ ℤResult quality: 31% values known / values provided: 31%distinct values known / distinct values provided: 100%
Values
[1,1,3,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[1,1,3,5,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[1,1,5,3,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[1,3,1,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[1,3,1,5,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[1,3,3,1,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[1,3,3,5,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[1,3,5,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[1,3,5,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[1,5,1,3,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[1,5,3,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[1,5,3,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[3,1,1,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[3,1,1,5,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[3,1,3,1,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[3,1,3,5,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[3,1,5,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[3,1,5,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[3,3,1,1,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[3,3,1,5,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[3,3,5,1,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[3,5,1,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[3,5,1,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[3,5,3,1,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[5,1,1,3,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[5,1,3,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[5,1,3,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[5,3,1,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[5,3,1,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[5,3,3,1,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[1,2,2,4,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[1,2,4,2,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[1,2,4,4,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[1,4,2,2,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[1,4,2,4,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[1,4,4,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[2,1,2,4,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[2,1,4,2,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[2,1,4,4,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[2,2,1,4,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[2,2,4,1,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[2,2,4,4,1] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[2,4,1,2,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[2,4,1,4,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[2,4,2,1,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[2,4,2,4,1] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[2,4,4,1,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[2,4,4,2,1] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[4,1,2,2,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[4,1,2,4,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[1,1,1,4,4,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[1,1,4,1,4,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[1,1,4,4,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[1,1,4,4,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[1,4,1,1,4,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[1,4,1,4,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[1,4,1,4,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[1,4,4,1,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[1,4,4,1,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[1,4,4,4,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[4,1,1,1,4,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[4,1,1,4,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[4,1,1,4,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[4,1,4,1,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[4,1,4,1,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[4,1,4,4,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[4,4,1,1,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[4,4,1,1,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[4,4,1,4,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[4,4,4,1,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[1,1,1,4,4,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,1,1,4,5,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,1,1,5,4,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,1,4,1,4,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,1,4,1,5,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,1,4,4,1,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,1,4,4,5,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,1,4,5,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,1,4,5,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,1,5,1,4,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,1,5,4,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,1,5,4,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,4,1,1,4,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,4,1,1,5,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,4,1,4,1,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,4,1,4,5,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,4,1,5,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,4,1,5,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,4,4,1,1,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,4,4,1,5,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,4,4,5,1,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,4,5,1,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,4,5,1,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,4,5,4,1,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,5,1,1,4,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,5,1,4,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,5,1,4,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,5,4,1,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,5,4,1,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,5,4,4,1,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
Description
The number of right ropes of a permutation. Let π be a permutation of length n. A raft of π is a non-empty maximal sequence of consecutive small ascents, [[St000441]], and a right rope is a large ascent after a raft of π. See Definition 3.10 and Example 3.11 in [1].
Mp00056: Parking functions to Dyck pathDyck paths
Mp00201: Dyck paths RingelPermutations
Mp00175: Permutations inverse Foata bijectionPermutations
St000666: Permutations ⟶ ℤResult quality: 31% values known / values provided: 31%distinct values known / distinct values provided: 100%
Values
[1,1,3,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[1,1,3,5,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[1,1,5,3,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[1,3,1,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[1,3,1,5,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[1,3,3,1,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[1,3,3,5,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[1,3,5,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[1,3,5,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[1,5,1,3,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[1,5,3,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[1,5,3,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[3,1,1,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[3,1,1,5,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[3,1,3,1,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[3,1,3,5,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[3,1,5,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[3,1,5,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[3,3,1,1,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[3,3,1,5,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[3,3,5,1,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[3,5,1,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[3,5,1,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[3,5,3,1,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[5,1,1,3,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[5,1,3,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[5,1,3,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[5,3,1,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[5,3,1,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[5,3,3,1,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 0
[1,2,2,4,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[1,2,4,2,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[1,2,4,4,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[1,4,2,2,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[1,4,2,4,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[1,4,4,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[2,1,2,4,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[2,1,4,2,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[2,1,4,4,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[2,2,1,4,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[2,2,4,1,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[2,2,4,4,1] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[2,4,1,2,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[2,4,1,4,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[2,4,2,1,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[2,4,2,4,1] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[2,4,4,1,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[2,4,4,2,1] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[4,1,2,2,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[4,1,2,4,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 0
[1,1,1,4,4,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[1,1,4,1,4,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[1,1,4,4,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[1,1,4,4,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[1,4,1,1,4,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[1,4,1,4,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[1,4,1,4,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[1,4,4,1,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[1,4,4,1,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[1,4,4,4,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[4,1,1,1,4,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[4,1,1,4,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[4,1,1,4,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[4,1,4,1,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[4,1,4,1,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[4,1,4,4,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[4,4,1,1,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[4,4,1,1,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[4,4,1,4,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[4,4,4,1,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0
[1,1,1,4,4,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,1,1,4,5,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,1,1,5,4,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,1,4,1,4,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,1,4,1,5,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,1,4,4,1,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,1,4,4,5,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,1,4,5,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,1,4,5,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,1,5,1,4,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,1,5,4,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,1,5,4,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,4,1,1,4,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,4,1,1,5,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,4,1,4,1,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,4,1,4,5,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,4,1,5,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,4,1,5,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,4,4,1,1,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,4,4,1,5,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,4,4,5,1,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,4,5,1,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,4,5,1,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,4,5,4,1,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,5,1,1,4,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,5,1,4,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,5,1,4,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,5,4,1,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,5,4,1,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
[1,5,4,4,1,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0
Description
The number of right tethers of a permutation. Let π be a permutation of length n. A raft of π is a non-empty maximal sequence of consecutive small ascents, [[St000441]], and a right tether is a large ascent between two consecutive rafts of π. See Definition 3.10 and Example 3.11 in [1].
Mp00056: Parking functions to Dyck pathDyck paths
Mp00201: Dyck paths RingelPermutations
Mp00175: Permutations inverse Foata bijectionPermutations
St000486: Permutations ⟶ ℤResult quality: 31% values known / values provided: 31%distinct values known / distinct values provided: 100%
Values
[1,1,3,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[1,1,3,5,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[1,1,5,3,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[1,3,1,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[1,3,1,5,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[1,3,3,1,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[1,3,3,5,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[1,3,5,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[1,3,5,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[1,5,1,3,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[1,5,3,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[1,5,3,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[3,1,1,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[3,1,1,5,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[3,1,3,1,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[3,1,3,5,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[3,1,5,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[3,1,5,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[3,3,1,1,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[3,3,1,5,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[3,3,5,1,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[3,5,1,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[3,5,1,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[3,5,3,1,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[5,1,1,3,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[5,1,3,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[5,1,3,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[5,3,1,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[5,3,1,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[5,3,3,1,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => [4,6,2,1,3,5] => 1 = 0 + 1
[1,2,2,4,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 1 = 0 + 1
[1,2,4,2,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 1 = 0 + 1
[1,2,4,4,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 1 = 0 + 1
[1,4,2,2,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 1 = 0 + 1
[1,4,2,4,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 1 = 0 + 1
[1,4,4,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 1 = 0 + 1
[2,1,2,4,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 1 = 0 + 1
[2,1,4,2,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 1 = 0 + 1
[2,1,4,4,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 1 = 0 + 1
[2,2,1,4,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 1 = 0 + 1
[2,2,4,1,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 1 = 0 + 1
[2,2,4,4,1] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 1 = 0 + 1
[2,4,1,2,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 1 = 0 + 1
[2,4,1,4,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 1 = 0 + 1
[2,4,2,1,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 1 = 0 + 1
[2,4,2,4,1] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 1 = 0 + 1
[2,4,4,1,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 1 = 0 + 1
[2,4,4,2,1] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 1 = 0 + 1
[4,1,2,2,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 1 = 0 + 1
[4,1,2,4,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => [3,1,5,6,2,4] => 1 = 0 + 1
[1,1,1,4,4,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0 + 1
[1,1,4,1,4,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0 + 1
[1,1,4,4,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0 + 1
[1,1,4,4,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0 + 1
[1,4,1,1,4,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0 + 1
[1,4,1,4,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0 + 1
[1,4,1,4,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0 + 1
[1,4,4,1,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0 + 1
[1,4,4,1,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0 + 1
[1,4,4,4,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0 + 1
[4,1,1,1,4,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0 + 1
[4,1,1,4,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0 + 1
[4,1,1,4,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0 + 1
[4,1,4,1,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0 + 1
[4,1,4,1,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0 + 1
[4,1,4,4,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0 + 1
[4,4,1,1,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0 + 1
[4,4,1,1,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0 + 1
[4,4,1,4,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0 + 1
[4,4,4,1,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => [5,2,3,6,7,1,4] => ? = 0 + 1
[1,1,1,4,4,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,1,1,4,5,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,1,1,5,4,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,1,4,1,4,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,1,4,1,5,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,1,4,4,1,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,1,4,4,5,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,1,4,5,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,1,4,5,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,1,5,1,4,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,1,5,4,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,1,5,4,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,4,1,1,4,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,4,1,1,5,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,4,1,4,1,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,4,1,4,5,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,4,1,5,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,4,1,5,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,4,4,1,1,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,4,4,1,5,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,4,4,5,1,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,4,5,1,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,4,5,1,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,4,5,4,1,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,5,1,1,4,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,5,1,4,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,5,1,4,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,5,4,1,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,5,4,1,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
[1,5,4,4,1,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => [7,2,6,3,1,4,5] => ? = 0 + 1
Description
The number of cycles of length at least 3 of a permutation.
Matching statistic: St001845
Mp00056: Parking functions to Dyck pathDyck paths
Mp00201: Dyck paths RingelPermutations
Mp00208: Permutations lattice of intervalsLattices
St001845: Lattices ⟶ ℤResult quality: 30% values known / values provided: 30%distinct values known / distinct values provided: 100%
Values
[1,1,3,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[1,1,3,5,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[1,1,5,3,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[1,3,1,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[1,3,1,5,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[1,3,3,1,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[1,3,3,5,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[1,3,5,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[1,3,5,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[1,5,1,3,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[1,5,3,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[1,5,3,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[3,1,1,3,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[3,1,1,5,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[3,1,3,1,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[3,1,3,5,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[3,1,5,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[3,1,5,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[3,3,1,1,5] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[3,3,1,5,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[3,3,5,1,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[3,5,1,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[3,5,1,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[3,5,3,1,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[5,1,1,3,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[5,1,3,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[5,1,3,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[5,3,1,1,3] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[5,3,1,3,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[5,3,3,1,1] => [1,1,0,0,1,1,0,0,1,0]
=> [2,4,1,6,3,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[1,2,2,4,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[1,2,4,2,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[1,2,4,4,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[1,4,2,2,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[1,4,2,4,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[1,4,4,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[2,1,2,4,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[2,1,4,2,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[2,1,4,4,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[2,2,1,4,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[2,2,4,1,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[2,2,4,4,1] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[2,4,1,2,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[2,4,1,4,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[2,4,2,1,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[2,4,2,4,1] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[2,4,4,1,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[2,4,4,2,1] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[4,1,2,2,4] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[4,1,2,4,2] => [1,0,1,1,0,0,1,1,0,0]
=> [3,1,5,2,6,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(1,7),(2,7),(3,7),(4,7),(5,7),(6,7)],8)
=> 4 = 0 + 4
[1,1,1,4,4,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,10),(3,10),(4,9),(5,9),(6,8),(7,8),(8,10),(9,10)],11)
=> ? = 0 + 4
[1,1,4,1,4,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,10),(3,10),(4,9),(5,9),(6,8),(7,8),(8,10),(9,10)],11)
=> ? = 0 + 4
[1,1,4,4,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,10),(3,10),(4,9),(5,9),(6,8),(7,8),(8,10),(9,10)],11)
=> ? = 0 + 4
[1,1,4,4,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,10),(3,10),(4,9),(5,9),(6,8),(7,8),(8,10),(9,10)],11)
=> ? = 0 + 4
[1,4,1,1,4,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,10),(3,10),(4,9),(5,9),(6,8),(7,8),(8,10),(9,10)],11)
=> ? = 0 + 4
[1,4,1,4,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,10),(3,10),(4,9),(5,9),(6,8),(7,8),(8,10),(9,10)],11)
=> ? = 0 + 4
[1,4,1,4,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,10),(3,10),(4,9),(5,9),(6,8),(7,8),(8,10),(9,10)],11)
=> ? = 0 + 4
[1,4,4,1,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,10),(3,10),(4,9),(5,9),(6,8),(7,8),(8,10),(9,10)],11)
=> ? = 0 + 4
[1,4,4,1,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,10),(3,10),(4,9),(5,9),(6,8),(7,8),(8,10),(9,10)],11)
=> ? = 0 + 4
[1,4,4,4,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,10),(3,10),(4,9),(5,9),(6,8),(7,8),(8,10),(9,10)],11)
=> ? = 0 + 4
[4,1,1,1,4,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,10),(3,10),(4,9),(5,9),(6,8),(7,8),(8,10),(9,10)],11)
=> ? = 0 + 4
[4,1,1,4,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,10),(3,10),(4,9),(5,9),(6,8),(7,8),(8,10),(9,10)],11)
=> ? = 0 + 4
[4,1,1,4,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,10),(3,10),(4,9),(5,9),(6,8),(7,8),(8,10),(9,10)],11)
=> ? = 0 + 4
[4,1,4,1,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,10),(3,10),(4,9),(5,9),(6,8),(7,8),(8,10),(9,10)],11)
=> ? = 0 + 4
[4,1,4,1,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,10),(3,10),(4,9),(5,9),(6,8),(7,8),(8,10),(9,10)],11)
=> ? = 0 + 4
[4,1,4,4,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,10),(3,10),(4,9),(5,9),(6,8),(7,8),(8,10),(9,10)],11)
=> ? = 0 + 4
[4,4,1,1,1,4] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,10),(3,10),(4,9),(5,9),(6,8),(7,8),(8,10),(9,10)],11)
=> ? = 0 + 4
[4,4,1,1,4,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,10),(3,10),(4,9),(5,9),(6,8),(7,8),(8,10),(9,10)],11)
=> ? = 0 + 4
[4,4,1,4,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,10),(3,10),(4,9),(5,9),(6,8),(7,8),(8,10),(9,10)],11)
=> ? = 0 + 4
[4,4,4,1,1,1] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,3,5,1,6,7,4] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,10),(3,10),(4,9),(5,9),(6,8),(7,8),(8,10),(9,10)],11)
=> ? = 0 + 4
[1,1,1,4,4,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,1,1,4,5,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,1,1,5,4,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,1,4,1,4,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,1,4,1,5,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,1,4,4,1,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,1,4,4,5,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,1,4,5,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,1,4,5,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,1,5,1,4,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,1,5,4,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,1,5,4,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,4,1,1,4,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,4,1,1,5,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,4,1,4,1,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,4,1,4,5,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,4,1,5,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,4,1,5,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,4,4,1,1,5] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,4,4,1,5,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,4,4,5,1,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,4,5,1,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,4,5,1,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,4,5,4,1,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,5,1,1,4,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,5,1,4,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,5,1,4,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,5,4,1,1,4] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,5,4,1,4,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
[1,5,4,4,1,1] => [1,1,1,0,0,0,1,1,0,1,0,0]
=> [2,3,7,1,6,4,5] => ([(0,1),(0,2),(0,3),(0,4),(0,5),(0,6),(0,7),(1,10),(2,11),(3,11),(4,8),(5,8),(6,9),(7,9),(8,10),(9,11),(10,11)],12)
=> ? = 0 + 4
Description
The number of join irreducibles minus the rank of a lattice. A lattice is join-extremal, if this statistic is 0.
The following 1125 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001619The number of non-isomorphic sublattices of a lattice. St001666The number of non-isomorphic subposets of a lattice which are lattices. St001375The pancake length of a permutation. St000787The number of flips required to make a perfect matching noncrossing. St000788The number of nesting-similar perfect matchings of a perfect matching. St001132The number of leaves in the subtree whose sister has label 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001043The depth of the leaf closest to the root in the binary unordered tree associated with the perfect matching. St000124The cardinality of the preimage of the Simion-Schmidt map. St000218The number of occurrences of the pattern 213 in a permutation. St000220The number of occurrences of the pattern 132 in a permutation. St000237The number of small exceedances. St000356The number of occurrences of the pattern 13-2. St000359The number of occurrences of the pattern 23-1. St000404The number of occurrences of the pattern 3241 or of the pattern 4231 in a permutation. St000405The number of occurrences of the pattern 1324 in a permutation. St000408The number of occurrences of the pattern 4231 in a permutation. St000440The number of occurrences of the pattern 4132 or of the pattern 4231 in a permutation. St000463The number of admissible inversions of a permutation. St000731The number of double exceedences of a permutation. St000871The number of very big ascents of a permutation. St000884The number of isolated descents of a permutation. St001083The number of boxed occurrences of 132 in a permutation. St001084The number of occurrences of the vincular pattern |1-23 in a permutation. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St001087The number of occurrences of the vincular pattern |12-3 in a permutation. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St000028The number of stack-sorts needed to sort a permutation. St000035The number of left outer peaks of a permutation. St000036The evaluation at 1 of the Kazhdan-Lusztig polynomial with parameters given by the identity and the permutation. St000054The first entry of the permutation. St000483The number of times a permutation switches from increasing to decreasing or decreasing to increasing. St000834The number of right outer peaks of a permutation. St000996The number of exclusive left-to-right maxima of a permutation. St001052The length of the exterior of a permutation. St001096The size of the overlap set of a permutation. St001115The number of even descents of a permutation. St000352The Elizalde-Pak rank of a permutation. St000647The number of big descents of a permutation. St000651The maximal size of a rise in a permutation. St000842The breadth of a permutation. St000862The number of parts of the shifted shape of a permutation. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St000402Half the size of the symmetry class of a permutation. St001615The number of join prime elements of a lattice. St001618The cardinality of the Frattini sublattice of a lattice. St001645The pebbling number of a connected graph. St001681The number of inclusion-wise minimal subsets of a lattice, whose meet is the bottom element. St000876The number of factors in the Catalan decomposition of a binary word. St001964The interval resolution global dimension of a poset. St001044The number of pairs whose larger element is at most one more than half the size of the perfect matching. St001133The smallest label in the subtree rooted at the sister of 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000022The number of fixed points of a permutation. St000153The number of adjacent cycles of a permutation. St000214The number of adjacencies of a permutation. St000215The number of adjacencies of a permutation, zero appended. St000662The staircase size of the code of a permutation. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000692Babson and Steingrímsson's statistic of a permutation. St000454The largest eigenvalue of a graph if it is integral. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. 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. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St000455The second largest eigenvalue of a graph if it is integral. St000741The Colin de Verdière graph invariant. St001330The hat guessing number of a graph. St001529The number of monomials in the expansion of the nabla operator applied to the power-sum symmetric function indexed by the partition. St000019The cardinality of the support of a permutation. St000696The number of cycles in the breakpoint graph of a permutation. St001090The number of pop-stack-sorts needed to sort a permutation. St000031The number of cycles in the cycle decomposition of a permutation. St000306The bounce count of a Dyck path. St000007The number of saliances of the permutation. St000422The energy of a graph, if it is integral. St001060The distinguishing index of a graph. St000670The reversal length of a permutation. St001095The number of non-isomorphic posets with precisely one further covering relation. St001301The first Betti number of the order complex associated with the poset. St001396Number of triples of incomparable elements in a finite poset. St000908The length of the shortest maximal antichain in a poset. St000914The sum of the values of the Möbius function of a poset. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001533The largest coefficient of the Poincare polynomial of the poset cone. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St001300The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset. St000189The number of elements in the poset. St000656The number of cuts of a poset. St001717The largest size of an interval in a poset. St000297The number of leading ones in a binary word. St000326The position of the first one in a binary word after appending a 1 at the end. St000441The number of successions of a permutation. St000546The number of global descents of a permutation. St000627The exponent of a binary word. St000648The number of 2-excedences of a permutation. St000665The number of rafts of a permutation. St000877The depth of the binary word interpreted as a path. St000296The length of the symmetric border of a binary word. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length 3. St000629The defect of a binary word. St000878The number of ones minus the number of zeros of a binary word. St000885The number of critical steps in the Catalan decomposition of a binary word. St001394The genus of a permutation. St000291The number of descents of a binary word. St000292The number of ascents of a binary word. St000371The number of mid points of decreasing subsequences of length 3 in a permutation. St000392The length of the longest run of ones in a binary word. St000628The balance of a binary word. St001372The length of a longest cyclic run of ones of a binary word. St000389The number of runs of ones of odd length in a binary word. St000390The number of runs of ones in a binary word. St000141The maximum drop size of a permutation. St000672The number of minimal elements in Bruhat order not less than the permutation. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St000246The number of non-inversions of a permutation. St000288The number of ones in a binary word. St000883The number of longest increasing subsequences of a permutation. St000879The number of long braid edges in the graph of braid moves of a permutation. St000891The number of distinct diagonal sums of a permutation matrix. St000769The major index of a composition regarded as a word. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length 3. St000407The number of occurrences of the pattern 2143 in a permutation. St000516The number of stretching pairs of a permutation. St000623The number of occurrences of the pattern 52341 in a permutation. St000709The number of occurrences of 14-2-3 or 14-3-2. St001059Number of occurrences of the patterns 41352,42351,51342,52341 in a permutation. St001663The number of occurrences of the Hertzsprung pattern 132 in a permutation. St001715The number of non-records in a permutation. St001847The number of occurrences of the pattern 1432 in a permutation. St000570The Edelman-Greene number of a permutation. St000002The number of occurrences of the pattern 123 in a permutation. St000023The number of inner peaks of a permutation. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St000039The number of crossings of a permutation. St000065The number of entries equal to -1 in an alternating sign matrix. St000119The number of occurrences of the pattern 321 in a permutation. St000122The number of occurrences of the contiguous pattern [.,[.,[[.,.],.]]] in a binary tree. St000123The difference in Coxeter length of a permutation and its image under the Simion-Schmidt map. St000125The number of occurrences of the contiguous pattern [.,[[[.,.],.],. St000127The number of occurrences of the contiguous pattern [.,[.,[.,[[.,.],.]]]] in a binary tree. St000128The number of occurrences of the contiguous pattern [.,[.,[[.,[.,.]],.]]] in a binary tree. St000129The number of occurrences of the contiguous pattern [.,[.,[[[.,.],.],.]]] in a binary tree. St000130The number of occurrences of the contiguous pattern [.,[[.,.],[[.,.],.]]] in a binary tree. St000131The number of occurrences of the contiguous pattern [.,[[[[.,.],.],.],. St000132The number of occurrences of the contiguous pattern [[.,.],[.,[[.,.],.]]] in a binary tree. St000143The largest repeated part of a partition. St000150The floored half-sum of the multiplicities of a partition. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000210Minimum over maximum difference of elements in cycles. St000212The number of standard Young tableaux for an integer partition such that no two consecutive entries appear in the same row. St000219The number of occurrences of the pattern 231 in a permutation. St000221The number of strong fixed points of a permutation. St000223The number of nestings in the permutation. St000234The number of global ascents of a permutation. St000241The number of cyclical small excedances. St000257The number of distinct parts of a partition that occur at least twice. St000279The size of the preimage of the map 'cycle-as-one-line notation' from Permutations to Permutations. St000283The size of the preimage of the map 'to graph' from Binary trees to Graphs. St000290The major index of a binary word. St000293The number of inversions of a binary word. St000317The cycle descent number of a permutation. St000347The inversion sum of a binary word. St000351The determinant of the adjacency matrix of a graph. St000355The number of occurrences of the pattern 21-3. St000357The number of occurrences of the pattern 12-3. St000360The number of occurrences of the pattern 32-1. St000365The number of double ascents of a permutation. St000366The number of double descents of a permutation. St000367The number of simsun double descents of a permutation. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St000406The number of occurrences of the pattern 3241 in a permutation. St000424The number of occurrences of the pattern 132 or of the pattern 231 in a permutation. St000433The number of occurrences of the pattern 132 or of the pattern 321 in a permutation. St000436The number of occurrences of the pattern 231 or of the pattern 321 in a permutation. St000449The number of pairs of vertices of a graph with distance 4. St000462The major index minus the number of excedences of a permutation. St000478Another weight of a partition according to Alladi. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000513The number of invariant subsets of size 2 when acting with a permutation of given cycle type. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000622The number of occurrences of the patterns 2143 or 4231 in a permutation. St000624The normalized sum of the minimal distances to a greater element. St000649The number of 3-excedences of a permutation. St000663The number of right floats of a permutation. St000687The dimension of Hom(I,P) for the LNakayama algebra of a Dyck path. St000710The number of big deficiencies of a permutation. St000713The dimension of the irreducible representation of Sp(4) labelled by an integer partition. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000732The number of double deficiencies of a permutation. St000750The number of occurrences of the pattern 4213 in a permutation. St000751The number of occurrences of either of the pattern 2143 or 2143 in a permutation. St000766The number of inversions of an integer composition. St000768The number of peaks in an integer composition. St000779The tier of a permutation. St000799The number of occurrences of the vincular pattern |213 in a permutation. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000801The number of occurrences of the vincular pattern |312 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000803The number of occurrences of the vincular pattern |132 in a permutation. St000804The number of occurrences of the vincular pattern |123 in a permutation. St000807The sum of the heights of the valleys of the associated bargraph. St000921The number of internal inversions of a binary word. St000929The constant term of the character polynomial of an integer partition. St000962The 3-shifted major index of a permutation. St000989The number of final rises of a permutation. St001061The number of indices that are both descents and recoils of a permutation. St001082The number of boxed occurrences of 123 in a permutation. St001091The number of parts in an integer partition whose next smaller part has the same size. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001130The number of two successive successions in a permutation. St001175The size of a partition minus the hook length of the base cell. St001193The dimension of Ext1A(A/AeA,A) in the corresponding Nakayama algebra A such that eA is a minimal faithful projective-injective module. St001283The number of finite solvable groups that are realised by the given partition over the complex numbers. St001284The number of finite groups that are realised by the given partition over the complex numbers. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001309The number of four-cliques in a graph. St001325The minimal number of occurrences of the comparability-pattern in a linear ordering of the vertices of the graph. St001332The number of steps on the non-negative side of the walk associated with the permutation. St001334The minimal number of occurrences of the 3-colorable pattern in a linear ordering of the vertices of the graph. St001381The fertility of a permutation. St001403The number of vertical separators in a permutation. St001411The number of patterns 321 or 3412 in a permutation. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001434The number of negative sum pairs of a signed permutation. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St001485The modular major index of a binary word. St001513The number of nested exceedences of a permutation. St001519The pinnacle sum of a permutation. St001525The number of symmetric hooks on the diagonal of a partition. St001535The number of cyclic alignments of a permutation. St001536The number of cyclic misalignments of a permutation. St001537The number of cyclic crossings of a permutation. St001549The number of restricted non-inversions between exceedances. St001550The number of inversions between exceedances where the greater exceedance is linked. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001552The number of inversions between excedances and fixed points of a permutation. St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. St001561The value of the elementary symmetric function evaluated at 1. St001593This is the number of standard Young tableaux of the given shifted shape. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001657The number of twos in an integer partition. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001705The number of occurrences of the pattern 2413 in a permutation. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001728The number of invisible descents of a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001766The number of cells which are not occupied by the same tile in all reduced pipe dreams corresponding to a permutation. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001793The difference between the clique number and the chromatic number of a graph. St001810The number of fixed points of a permutation smaller than its largest moved point. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St001939The number of parts that are equal to their multiplicity in the integer partition. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St000001The number of reduced words for a permutation. St000056The decomposition (or block) number of a permutation. St000078The number of alternating sign matrices whose left key is the permutation. St000099The number of valleys of a permutation, including the boundary. St000160The multiplicity of the smallest part of a partition. St000183The side length of the Durfee square of an integer partition. St000243The number of cyclic valleys and cyclic peaks of a permutation. St000255The number of reduced Kogan faces with the permutation as type. St000256The number of parts from which one can substract 2 and still get an integer partition. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000480The number of lower covers of a partition in dominance order. St000481The number of upper covers of a partition in dominance order. St000487The length of the shortest cycle of a permutation. St000501The size of the first part in the decomposition of a permutation. St000542The number of left-to-right-minima of a permutation. St000654The first descent of a permutation. St000667The greatest common divisor of the parts of the partition. St000706The product of the factorials of the multiplicities of an integer partition. St000737The last entry on the main diagonal of a semistandard tableau. St000739The first entry in the last row of a semistandard tableau. St000760The length of the longest strictly decreasing subsequence of parts of an integer composition. St000781The number of proper colouring schemes of a Ferrers diagram. St000805The number of peaks of the associated bargraph. St000847The number of standard Young tableaux whose descent set is the binary word. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St000897The number of different multiplicities of parts of an integer partition. St000913The number of ways to refine the partition into singletons. St000968We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) [c0,c1,...,cn1] by adding c0 to cn1. St000990The first ascent of a permutation. St000993The multiplicity of the largest part of an integer partition. St001081The number of minimal length factorizations of a permutation into star transpositions. St001121The multiplicity of the irreducible representation indexed by the partition in the Kronecker square corresponding to the partition. St001162The minimum jump of a permutation. St001174The Gorenstein dimension of the algebra A/I when I is the tilting module corresponding to the permutation in the Auslander algebra of K[x]/(xn). St001220The width of a permutation. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001256Number of simple reflexive modules that are 2-stable reflexive. St001280The number of parts of an integer partition that are at least two. St001344The neighbouring number of a permutation. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001468The smallest fixpoint of a permutation. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001496The number of graphs with the same Laplacian spectrum as the given graph. St001568The smallest positive integer that does not appear twice in the partition. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St001665The number of pure excedances of a permutation. St001722The number of minimal chains with small intervals between a binary word and the top element. St001859The number of factors of the Stanley symmetric function associated with a permutation. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001933The largest multiplicity of a part in an integer partition. St001941The evaluation at 1 of the modified Kazhdan--Lusztig R polynomial (as in [1, Section 5. St000062The length of the longest increasing subsequence of the permutation. St000308The height of the tree associated to a permutation. St000991The number of right-to-left minima of a permutation. St001741The largest integer such that all patterns of this size are contained in the permutation. St000549The number of odd partial sums of an integer partition. St001040The depth of the decreasing labelled binary unordered tree associated with the perfect matching. St001260The permanent of an alternating sign matrix. St000534The number of 2-rises of a permutation. St000764The number of strong records in an integer composition. St000456The monochromatic index of a connected graph. St000669The number of permutations obtained by switching ascents or descents of size 2. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000260The radius of a connected graph. St000381The largest part of an integer composition. St000383The last part of an integer composition. St000742The number of big ascents of a permutation after prepending zero. St000245The number of ascents of a permutation. St000259The diameter of a connected graph. St000374The number of exclusive right-to-left minima of a permutation. St000703The number of deficiencies of a permutation. St000451The length of the longest pattern of the form k 1 2. St000725The smallest label of a leaf of the increasing binary tree associated to a permutation. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001004The number of indices that are either left-to-right maxima or right-to-left minima. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000018The number of inversions of a permutation. St000431The number of occurrences of the pattern 213 or of the pattern 321 in a permutation. St000008The major index of the composition. St000457The number of occurrences of one of the patterns 132, 213 or 321 in a permutation. St000825The sum of the major and the inverse major index of a permutation. St000466The Gutman (or modified Schultz) index of a connected graph. St000302The determinant of the distance matrix of a connected graph. St000828The spearman's rho of a permutation and the identity permutation. St000464The Schultz index of a connected graph. St000467The hyper-Wiener index of a connected graph. St001564The value of the forgotten symmetric functions when all variables set to 1. St001563The value of the power-sum symmetric function evaluated at 1. St001562The value of the complete homogeneous symmetric function evaluated at 1. St001607The number of coloured graphs such that the multiplicities of colours are given by a partition. St000277The number of ribbon shaped standard tableaux. St000116The major index of a semistandard tableau obtained by standardizing. St000174The flush statistic of a semistandard tableau. St000069The number of maximal elements of a poset. St000881The number of short braid edges in the graph of braid moves of a permutation. St000880The number of connected components of long braid edges in the graph of braid moves of a permutation. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St000943The number of spots the most unlucky car had to go further in a parking function. St000188The area of the Dyck path corresponding to a parking function and the total displacement of a parking function. St000540The sum of the entries of a parking function minus its length. St000165The sum of the entries of a parking function. St000195The number of secondary dinversion pairs of the dyck path corresponding to a parking function. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St000942The number of critical left to right maxima of the parking functions. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001905The number of preferred parking spots in a parking function less than the index of the car. St001935The number of ascents in a parking function. St001947The number of ties in a parking function. St001200The number of simple modules in eAe with projective dimension at most 2 in the corresponding Nakayama algebra A with minimal faithful projective-injective module eA. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001903The number of fixed points of a parking function. St000194The number of primary dinversion pairs of a labelled dyck path corresponding to a parking function. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001937The size of the center of a parking function. St001002Number of indecomposable modules with projective and injective dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St000103The sum of the entries of a semistandard tableau. St000949Gives the number of generalised tilting modules of the corresponding LNakayama algebra. St001243The sum of coefficients in the Schur basis of certain LLT polynomials associated with a Dyck path. St001242The toal dimension of certain Sn modules determined by LLT polynomials associated with a Dyck path. St000064The number of one-box pattern of a permutation. St000095The number of triangles of a graph. St000101The cocharge of a semistandard tableau. St000303The determinant of the product of the incidence matrix and its transpose of a graph divided by 4. St000315The number of isolated vertices of a graph. St000488The number of cycles of a permutation of length at most 2. St000489The number of cycles of a permutation of length at most 3. St000954Number of times the corresponding LNakayama algebra has Exti(D(A),A)=0 for i>0. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001160The number of proper blocks (or intervals) of a permutations. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. St001191Number of simple modules S with ExtiA(S,A)=0 for all i=0,1,...,g1 in the corresponding Nakayama algebra A with global dimension g. St001195The global dimension of the algebra A/AfA of the corresponding Nakayama algebra A with minimal left faithful projective-injective module Af. St001204Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series L=[c0,c1,...,cn1] such that n=c0<ci for all i>0 a special CNakayama algebra. St001209The pmaj statistic of a parking function. St001218Smallest index k greater than or equal to one such that the Coxeter matrix C of the corresponding Nakayama algebra has C^k=1. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001405The number of bonds in a permutation. St001429The number of negative entries in a signed permutation. St001444The rank of the skew-symmetric form which is non-zero on crossing arcs of a perfect matching. St001520The number of strict 3-descents. St001572The minimal number of edges to remove to make a graph bipartite. St001573The minimal number of edges to remove to make a graph triangle-free. St001690The length of a longest path in a graph such that after removing the paths edges, every vertex of the path has distance two from some other vertex of the path. St001811The Castelnuovo-Mumford regularity of a permutation. St001831The multiplicity of the non-nesting perfect matching in the chord expansion of a perfect matching. St001835The number of occurrences of a 231 pattern in the restricted growth word of a perfect matching. St001837The number of occurrences of a 312 pattern in the restricted growth word of a perfect matching. St001850The number of Hecke atoms of a permutation. St001871The number of triconnected components of a graph. St001898The number of occurrences of an 132 pattern in an ordered set partition. St000037The sign of a permutation. St000096The number of spanning trees of a graph. St000117The number of centered tunnels of a Dyck path. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000181The number of connected components of the Hasse diagram for the poset. St000236The number of cyclical small weak excedances. St000239The number of small weak excedances. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000287The number of connected components of a graph. St000310The minimal degree of a vertex of a graph. St000450The number of edges minus the number of vertices plus 2 of a graph. St000458The number of permutations obtained by switching adjacencies or successions. St000635The number of strictly order preserving maps of a poset into itself. St000694The number of affine bounded permutations that project to a given permutation. St000832The number of permutations obtained by reversing blocks of three consecutive numbers. St000864The number of circled entries of the shifted recording tableau of a permutation. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001008Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001010Number of indecomposable injective modules with projective dimension g-1 when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001013Number of indecomposable injective modules with codominant dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001188The number of simple modules S with grade inf at least two in the Nakayama algebra A corresponding to the Dyck path. St001202Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series L=[c_0,c_1,...,c_{n−1}] such that n=c_0 < c_i for all i > 0 a special CNakayama algebra. St001208The number of connected components of the quiver of A/T when T is the 1-tilting module corresponding to the permutation in the Auslander algebra A of K[x]/(x^n). St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001257The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001274The number of indecomposable injective modules with projective dimension equal to two. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001461The number of topologically connected components of the chord diagram of a permutation. St001490The number of connected components of a skew partition. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001569The maximal modular displacement of a permutation. St001590The crossing number of a perfect matching. St001652The length of a longest interval of consecutive numbers. St001661Half the permanent of the Identity matrix plus the permutation matrix associated to the permutation. St001662The length of the longest factor of consecutive numbers in a permutation. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St001801Half the number of preimage-image pairs of different parity in a permutation. St001828The Euler characteristic of a graph. St001830The chord expansion number of a perfect matching. St001832The number of non-crossing perfect matchings in the chord expansion of a perfect matching. St001856The number of edges in the reduced word graph of a permutation. St001890The maximum magnitude of the Möbius function of a poset. St001904The length of the initial strictly increasing segment of a parking function. St001960The number of descents of a permutation minus one if its first entry is not one. St000134The size of the orbit of an alternating sign matrix under gyration. St000217The number of occurrences of the pattern 312 in a permutation. St000335The difference of lower and upper interactions. St000353The number of inner valleys of a permutation. St000358The number of occurrences of the pattern 31-2. St000437The number of occurrences of the pattern 312 or of the pattern 321 in a permutation. St000711The number of big exceedences of a permutation. St000822The Hadwiger number of the graph. St000886The number of permutations with the same antidiagonal sums. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St000950Number of tilting modules of the corresponding LNakayama algebra, where a tilting module is a generalised tilting module of projective dimension 1. St000952Gives the number of irreducible factors of the Coxeter polynomial of the Dyck path over the rational numbers. St000956The maximal displacement of a permutation. St000958The number of Bruhat factorizations of a permutation. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001017Number of indecomposable injective modules with projective dimension equal to the codominant dimension in the Nakayama algebra corresponding to the Dyck path. St001079The minimal length of a factorization of a permutation using the permutations (12)(34). St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001152The number of pairs with even minimum in a perfect matching. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001192The maximal dimension of Ext_A^2(S,A) for a simple module S over the corresponding Nakayama algebra A. St001198The number of simple modules in the algebra eAe with projective dimension at most 1 in the corresponding Nakayama algebra A with minimal faithful projective-injective module eA. St001205The number of non-simple indecomposable projective-injective modules of the algebra eAe in the corresponding Nakayama algebra A with minimal faithful projective-injective module eA. St001206The maximal dimension of an indecomposable projective eAe-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module eA. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001285The number of primes in the column sums of the two line notation of a permutation. St001288The number of primes obtained by multiplying preimage and image of a permutation and adding one. St001289The vector space dimension of the n-fold tensor product of D(A), where n is maximal such that this n-fold tensor product is nonzero. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001469The holeyness of a permutation. St001481The minimal height of a peak of a Dyck path. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001530The depth of a Dyck path. St001589The nesting number of a perfect matching. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St001727The number of invisible inversions of a permutation. St001778The largest greatest common divisor of an element and its image in a permutation. St000015The number of peaks of a Dyck path. St000092The number of outer peaks of a permutation. St000155The number of exceedances (also excedences) of a permutation. St000213The number of weak exceedances (also weak excedences) of a permutation. St000314The number of left-to-right-maxima of a permutation. St000316The number of non-left-to-right-maxima of a permutation. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000331The number of upper interactions of a Dyck path. St000702The number of weak deficiencies of a permutation. St000829The Ulam distance of a permutation to the identity permutation. St000955Number of times one has Ext^i(D(A),A)>0 for i>0 for the corresponding LNakayama algebra. St001014Number of indecomposable injective modules with codominant dimension equal to the dominant dimension of the Nakayama algebra corresponding to the Dyck path. St001015Number of indecomposable injective modules with codominant dimension equal to one in the Nakayama algebra corresponding to the Dyck path. St001016Number of indecomposable injective modules with codominant dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001021Sum of the differences between projective and codominant dimension of the non-projective indecomposable injective modules in the Nakayama algebra corresponding to the Dyck path. St001164Number of indecomposable injective modules whose socle has projective dimension at most g-1 (g the global dimension) minus the number of indecomposable projective-injective modules. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001269The sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation. St001273The projective dimension of the first term in an injective coresolution of the regular module. St001275The projective dimension of the second term in a minimal injective coresolution of the regular module. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001298The number of repeated entries in the Lehmer code of a permutation. St001489The maximum of the number of descents and the number of inverse descents. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001517The length of a longest pair of twins in a permutation. St001667The maximal size of a pair of weak twins for a permutation. St001668The number of points of the poset minus the width of the poset. St001684The reduced word complexity of a permutation. St001726The number of visible inversions of a permutation. St001873For a Nakayama algebra corresponding to a Dyck path, we define the matrix C with entries the Hom-spaces between e_i J and e_j J (the radical of the indecomposable projective modules). St001874Lusztig's a-function for the symmetric group. St000033The number of permutations greater than or equal to the given permutation in (strong) Bruhat order. St000102The charge of a semistandard tableau. St000222The number of alignments in the permutation. St000327The number of cover relations in a poset. St000401The size of the symmetry class of a permutation. St000429The number of occurrences of the pattern 123 or of the pattern 321 in a permutation. St000432The number of occurrences of the pattern 231 or of the pattern 312 in a permutation. St000443The number of long tunnels of a Dyck path. St000545The number of parabolic double cosets with minimal element being the given permutation. St000863The length of the first row of the shifted shape of a permutation. St000951The dimension of Ext^{1}(D(A),A) of the corresponding LNakayama algebra. St000964Gives the dimension of Ext^g(D(A),A) of the corresponding LNakayama algebra, when g denotes the global dimension of that algebra. St000967The value p(1) for the Coxeterpolynomial p of the corresponding LNakayama algebra. St001078The minimal number of occurrences of (12) in a factorization of a permutation into transpositions (12) and cycles (1,. St001180Number of indecomposable injective modules with projective dimension at most 1. St001182Number of indecomposable injective modules with codominant dimension at least two in the corresponding Nakayama algebra. St001183The maximum of projdim(S)+injdim(S) over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001278The number of indecomposable modules that are fixed by \tau \Omega^1 composed with its inverse in the corresponding Nakayama algebra. St001287The number of primes obtained by multiplying preimage and image of a permutation and subtracting one. St001297The number of indecomposable non-injective projective modules minus the number of indecomposable non-injective projective modules that have reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001402The number of separators in a permutation. St001473The absolute value of the sum of all entries of the Coxeter matrix of the corresponding LNakayama algebra. St001637The number of (upper) dissectors of a poset. St001703The villainy of a graph. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St001872The number of indecomposable injective modules with even projective dimension in the corresponding Nakayama algebra. St000029The depth of a permutation. St000144The pyramid weight of the Dyck path. St000197The number of entries equal to positive one in the alternating sign matrix. St000209Maximum difference of elements in cycles. St000216The absolute length of a permutation. St000235The number of indices that are not cyclical small weak excedances. St000238The number of indices that are not small weak excedances. St000240The number of indices that are not small excedances. St000242The number of indices that are not cyclical small weak excedances. St000494The number of inversions of distance at most 3 of a permutation. St000809The reduced reflection length of the permutation. St000824The sum of the number of descents and the number of recoils of a permutation. St000831The number of indices that are either descents or recoils. St000957The number of Bruhat lower covers of a permutation. St001076The minimal length of a factorization of a permutation into transpositions that are cyclic shifts of (12). St001077The prefix exchange distance of a permutation. St001179Number of indecomposable injective modules with projective dimension at most 2 in the corresponding Nakayama algebra. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St001388The number of non-attacking neighbors of a permutation. St001480The number of simple summands of the module J^2/J^3. St001488The number of corners of a skew partition. St001511The minimal number of transpositions needed to sort a permutation in either direction. St001558The number of transpositions that are smaller or equal to a permutation in Bruhat order. St001579The number of cyclically simple transpositions decreasing the number of cyclic descents needed to sort a permutation. St001760The number of prefix or suffix reversals needed to sort a permutation. St001827The number of two-component spanning forests of a graph. St001869The maximum cut size of a graph. St001958The degree of the polynomial interpolating the values of a permutation. St000427The number of occurrences of the pattern 123 or of the pattern 231 in a permutation. St000430The number of occurrences of the pattern 123 or of the pattern 312 in a permutation. St000485The length of the longest cycle of a permutation. St000673The number of non-fixed points of a permutation. St000844The size of the largest block in the direct sum decomposition of a permutation. St000953The largest degree of an irreducible factor of the Coxeter polynomial of the Dyck path over the rational numbers. St000965The sum of the dimension of Ext^i(D(A),A) for i=1,. St001005The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both. St001065Number of indecomposable reflexive modules in the corresponding Nakayama algebra. St001170Number of indecomposable injective modules whose socle has projective dimension at most g-1 when g denotes the global dimension in the corresponding Nakayama algebra. St001255The vector space dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001299The product of all non-zero projective dimensions of simple modules of the corresponding Nakayama algebra. St000224The sorting index of a permutation. St000868The aid statistic in the sense of Shareshian-Wachs. St001003The number of indecomposable modules with projective dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001023Number of simple modules with projective dimension at most 3 in the Nakayama algebra corresponding to the Dyck path. St001190Number of simple modules with projective dimension at most 4 in the corresponding Nakayama algebra. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001650The order of Ringel's homological bijection associated to the linear Nakayama algebra corresponding to the Dyck path. St000426The number of occurrences of the pattern 132 or of the pattern 312 in a permutation. St000434The number of occurrences of the pattern 213 or of the pattern 312 in a permutation. St000435The number of occurrences of the pattern 213 or of the pattern 231 in a permutation. St000055The inversion sum of a permutation. St001018Sum of projective dimension of the indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001019Sum of the projective dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001412Number of minimal entries in the Bruhat order matrix of a permutation. St000423The number of occurrences of the pattern 123 or of the pattern 132 in a permutation. St000428The number of occurrences of the pattern 123 or of the pattern 213 in a permutation. St000830The total displacement of a permutation. St000945The number of matchings in the dihedral orbit of a perfect matching. St000301The number of facets of the stable set polytope of a graph. St001080The minimal length of a factorization of a permutation using the transposition (12) and the cycle (1,. St001213The number of indecomposable modules in the corresponding Nakayama algebra that have vanishing first Ext-group with the regular module. St000425The number of occurrences of the pattern 132 or of the pattern 213 in a permutation. St000110The number of permutations less than or equal to a permutation in left weak order. 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. St001464The number of bases of the positroid corresponding to the permutation, with all fixed points counterclockwise. St001639The number of alternating subsets such that applying the permutation does not yield an alternating subset. St001959The product of the heights of the peaks of a Dyck path. St001138The number of indecomposable modules with projective dimension or injective dimension at most one in the corresponding Nakayama algebra. St000616The inversion index of a permutation. St000341The non-inversion sum of a permutation. St000520The number of patterns in a permutation. St000109The number of elements less than or equal to the given element in Bruhat order. St000343The number of spanning subgraphs of a graph. St000079The number of alternating sign matrices for a given Dyck path. St001731The factorization defect of a permutation. St000530The number of permutations with the same descent word as the given permutation. St000342The cosine of a permutation. St001531Number of partial orders contained in the poset determined by the Dyck path. St000690The size of the conjugacy class of a permutation. St000959The number of strong Bruhat factorizations of a permutation. St001560The product of the cardinalities of the lower order ideal and upper order ideal generated by a permutation in weak order. St001757The number of orbits of toric promotion on a graph. St001528The number of permutations such that the product with the permutation has the same number of fixed points. St001293The sum of all 1/(i+\pi(i)) for a permutation \pi times the lcm of all possible values among permutations of the same length. St000042The number of crossings of a perfect matching. St000051The size of the left subtree of a binary tree. St000133The "bounce" of a permutation. St000187The determinant of an alternating sign matrix. St000274The number of perfect matchings of a graph. St000276The size of the preimage of the map 'to graph' from Ordered trees to Graphs. St000281The size of the preimage of the map 'to poset' from Binary trees to Posets. St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. St000295The length of the border of a binary word. St000322The skewness of a graph. St000338The number of pixed points of a permutation. St000447The number of pairs of vertices of a graph with distance 3. St000461The rix statistic of a permutation. St000500Eigenvalues of the random-to-random operator acting on the regular representation. St000646The number of big ascents of a permutation. St000674The number of hills of a Dyck path. St000680The Grundy value for Hackendot on posets. St000754The Grundy value for the game of removing nestings in a perfect matching. St000837The number of ascents of distance 2 of a permutation. St000850The number of 1/2-balanced pairs in a poset. St000872The number of very big descents of a permutation. St000873The aix statistic of a permutation. St000894The trace of an alternating sign matrix. St000895The number of ones on the main diagonal of an alternating sign matrix. St000963The 2-shifted major index of a permutation. St000966Number of peaks minus the global dimension of the corresponding LNakayama algebra. St001025Number of simple modules with projective dimension 4 in the Nakayama algebra corresponding to the Dyck path. St001047The maximal number of arcs crossing a given arc of a perfect matching. St001114The number of odd descents of a permutation. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001131The number of trivial trees on the path to label one in the decreasing labelled binary unordered tree associated with the perfect matching. St001139The number of occurrences of hills of size 2 in a Dyck path. St001141The number of occurrences of hills of size 3 in a Dyck path. St001159Number of simple modules with dominant dimension equal to the global dimension in the corresponding Nakayama algebra. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001172The number of 1-rises at odd height of a Dyck path. St001181Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001217The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001234The number of indecomposable three dimensional modules with projective dimension one. St001263The index of the maximal parabolic seaweed algebra associated with the composition. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. St001307The number of induced stars on four vertices in a graph. St001323The independence gap of a graph. St001347The number of pairs of vertices of a graph having the same neighbourhood. St001367The smallest number which does not occur as degree of a vertex in a graph. St001386The number of prime labellings of a graph. St001430The number of positive entries in a signed permutation. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St001470The cyclic holeyness of a permutation. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001498The normalised height of a Nakayama algebra with magnitude 1. St001516The number of cyclic bonds of a permutation. St001545The second Elser number of a connected graph. St001556The number of inversions of the third entry of a permutation. St001557The number of inversions of the second entry of a permutation. St001565The number of arithmetic progressions of length 2 in a permutation. St001577The minimal number of edges to add or remove to make a graph a cograph. St001578The minimal number of edges to add or remove to make a graph a line graph. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St001631The number of simple modules S with dim Ext^1(S,A)=1 in the incidence algebra A of the poset. St001632The number of indecomposable injective modules I with dim Ext^1(I,A)=1 for the incidence algebra A of a poset. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001675The number of parts equal to the part in the reversed composition. St001695The natural comajor index of a standard Young tableau. St001698The comajor index of a standard tableau minus the weighted size of its shape. St001699The major index of a standard tableau minus the weighted size of its shape. St001712The number of natural descents of a standard Young tableau. St001745The number of occurrences of the arrow pattern 13 with an arrow from 1 to 2 in a permutation. St001771The number of occurrences of the signed pattern 1-2 in a signed permutation. St001783The number of odd automorphisms of a graph. St001836The number of occurrences of a 213 pattern in the restricted growth word of a perfect matching. St001870The number of positive entries followed by a negative entry in a signed permutation. St001895The oddness of a signed permutation. St001911A descent variant minus the number of inversions. St001932The number of pairs of singleton blocks in the noncrossing set partition corresponding to a Dyck path, that can be merged to create another noncrossing set partition. St001948The number of augmented double ascents of a permutation. St000021The number of descents of a permutation. St000061The number of nodes on the left branch of a binary tree. St000084The number of subtrees. St000154The sum of the descent bottoms of a permutation. St000163The size of the orbit of the set partition under rotation. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000230Sum of the minimal elements of the blocks of a set partition. St000252The number of nodes of degree 3 of a binary tree. St000286The number of connected components of the complement of a graph. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000354The number of recoils of a permutation. St000524The number of posets with the same order polynomial. St000526The number of posets with combinatorially isomorphic order polytopes. St000619The number of cyclic descents of a permutation. St000633The size of the automorphism group of a poset. St000652The maximal difference between successive positions of a permutation. St000685The dominant dimension of the LNakayama algebra associated to a Dyck path. St000717The number of ordinal summands of a poset. St000740The last entry of a permutation. St000745The index of the last row whose first entry is the row number in a standard Young tableau. St000753The Grundy value for the game of Kayles on a binary word. St000756The sum of the positions of the left to right maxima of a permutation. St000790The number of pairs of centered tunnels, one strictly containing the other, of a Dyck path. St000791The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. St000836The number of descents of distance 2 of a permutation. St000843The decomposition number of a perfect matching. St000889The number of alternating sign matrices with the same antidiagonal sums. St000910The number of maximal chains of minimal length in a poset. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001022Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to the Dyck path. St001032The number of horizontal steps in the bicoloured Motzkin path associated with the Dyck path. St001041The depth of the label 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001048The number of leaves in the subtree containing 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001063Numbers of 3-torsionfree simple modules in the corresponding Nakayama algebra. St001064Number of simple modules in the corresponding Nakayama algebra that are 3-syzygy modules. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001167The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive in the corresponding Nakayama algebra. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001194The injective dimension of A/AfA in the corresponding Nakayama algebra A when Af is the minimal faithful projective-injective left A-module St001197The global dimension of eAe for the corresponding Nakayama algebra A with minimal faithful projective-injective module eA. St001199The dominant dimension of eAe for the corresponding Nakayama algebra A with minimal faithful projective-injective module eA. St001201The grade of the simple module S_0 in the special CNakayama algebra corresponding to the Dyck path. St001207The Lowey length of the algebra A/T when T is the 1-tilting module corresponding to the permutation in the Auslander algebra of K[x]/(x^n). St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St001276The number of 2-regular indecomposable modules in the corresponding Nakayama algebra. St001333The cardinality of a minimal edge-isolating set of a graph. St001340The cardinality of a minimal non-edge isolating set of a graph. St001377The major index minus the number of inversions of a permutation. St001393The induced matching number of a graph. St001399The distinguishing number of a poset. St001420Half the length of a longest factor which is its own reverse-complement of a binary word. St001423The number of distinct cubes in a binary word. St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St001487The number of inner corners of a skew partition. St001501The dominant dimension of magnitude 1 Nakayama algebras. St001510The number of self-evacuating linear extensions of a finite poset. St001518The number of graphs with the same ordinary spectrum as the given graph. St001524The degree of symmetry of a binary word. St001534The alternating sum of the coefficients of the Poincare polynomial of the poset cone. St001570The minimal number of edges to add to make a graph Hamiltonian. St001575The minimal number of edges to add or remove to make a graph edge transitive. St001669The number of single rises in a Dyck path. St001729The number of visible descents of a permutation. St001735The number of permutations with the same set of runs. St001737The number of descents of type 2 in a permutation. St001742The difference of the maximal and the minimal degree in a graph. St001777The number of weak descents in an integer composition. St001806The upper middle entry of a permutation. St001807The lower middle entry of a permutation. St001928The number of non-overlapping descents in a permutation. St000005The bounce statistic of a Dyck path. St000006The dinv of a Dyck path. St000053The number of valleys of the Dyck path. St000060The greater neighbor of the maximum. St000075The orbit size of a standard tableau under promotion. St000080The rank of the poset. St000083The number of left oriented leafs of a binary tree except the first one. St000120The number of left tunnels of a Dyck path. St000298The order dimension or Dushnik-Miller dimension of a poset. St000307The number of rowmotion orbits of a poset. St000309The number of vertices with even degree. St000311The number of vertices of odd degree in a graph. St000325The width of the tree associated to a permutation. St000470The number of runs in a permutation. St000538The number of even inversions of a permutation. St000632The jump number of the poset. St000638The number of up-down runs of a permutation. St000640The rank of the largest boolean interval in a poset. St000686The finitistic dominant dimension of a Dyck path. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000733The row containing the largest entry of a standard tableau. St000819The propagating number of a perfect matching. St000840The number of closers smaller than the largest opener in a perfect matching. St000845The maximal number of elements covered by an element in a poset. St000846The maximal number of elements covering an element of a poset. St000849The number of 1/3-balanced pairs in a poset. St000888The maximal sum of entries on a diagonal of an alternating sign matrix. St000892The maximal number of nonzero entries on a diagonal of an alternating sign matrix. St000906The length of the shortest maximal chain in a poset. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama algebra. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001026The maximum of the projective dimensions of the indecomposable non-projective injective modules minus the minimum in the Nakayama algebra corresponding to the Dyck path. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001046The maximal number of arcs nesting a given arc of a perfect matching. St001049The smallest label in the subtree not containing 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001107The number of times one can erase the first up and the last down step in a Dyck path and still remain a Dyck path. St001136The largest label with larger sister in the leaf labelled binary unordered tree associated with the perfect matching. St001196The global dimension of A minus the global dimension of eAe for the corresponding Nakayama algebra with minimal faithful projective-injective module eA. St001203We associate to a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series L=[c_0,c_1,...,c_{n-1}] such that n=c_0 < c_i for all i > 0 a Dyck path as follows: St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001245The cyclic maximal difference between two consecutive entries of a permutation. St001246The maximal difference between two consecutive entries of a permutation. St001261The Castelnuovo-Mumford regularity of a graph. St001339The irredundance number of a graph. St001439The number of even weak deficiencies and of odd weak exceedences. St001471The magnitude of a Dyck path. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001555The order of a signed permutation. St001566The length of the longest arithmetic progression in a permutation. St001673The degree of asymmetry of an integer composition. St001734The lettericity of a graph. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St001812The biclique partition number of a graph. St001884The number of borders of a binary word. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St000156The Denert index of a permutation. St000157The number of descents of a standard tableau. St000164The number of short pairs. St000166The depth minus 1 of an ordered tree. St000168The number of internal nodes of an ordered tree. St000199The column of the unique '1' in the last row of the alternating sign matrix. St000200The row of the unique '1' in the last column of the alternating sign matrix. St000328The maximum number of child nodes in a tree. St000332The positive inversions of an alternating sign matrix. St000442The maximal area to the right of an up step of a Dyck path. St000472The sum of the ascent bottoms of a permutation. St000528The height of a poset. St000539The number of odd inversions of a permutation. St000630The length of the shortest palindromic decomposition of a binary word. St000653The last descent of a permutation. St000675The number of centered multitunnels of a Dyck path. St000677The standardized bi-alternating inversion number of a permutation. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000691The number of changes of a binary word. St000720The size of the largest partition in the oscillating tableau corresponding to the perfect matching. St000744The length of the path to the largest entry in a standard Young tableau. St000746The number of pairs with odd minimum in a perfect matching. St000789The number of crossing-similar perfect matchings of a perfect matching. St000893The number of distinct diagonal sums of an alternating sign matrix. St000898The number of maximal entries in the last diagonal of the monotone triangle. St000923The minimal number with no two order isomorphic substrings of this length in a permutation. St000981The length of the longest zigzag subpath. St000982The length of the longest constant subword. St000983The length of the longest alternating subword. St001027Number of simple modules with projective dimension equal to injective dimension in the Nakayama algebra corresponding to the Dyck path. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001117The game chromatic index of a graph. St001126Number of simple module that are 1-regular in the corresponding Nakayama algebra. St001166Number of indecomposable projective non-injective modules with dominant dimension equal to the global dimension plus the number of indecomposable projective injective modules in the corresponding Nakayama algebra. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001270The bandwidth of a graph. St001286The annihilation number of a graph. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001315The dissociation number of a graph. St001401The number of distinct entries in a semistandard tableau. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001424The number of distinct squares in a binary word. St001497The position of the largest weak excedence of a permutation. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001523The degree of symmetry of a Dyck path. St001642The Prague dimension of a graph. St001671Haglund's hag of a permutation. St001711The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. St001718The number of non-empty open intervals in a poset. St001800The number of 3-Catalan paths having this Dyck path as first and last coordinate projections. St001907The number of Bastidas - Hohlweg - Saliola excedances of a signed permutation. St000024The number of double up and double down steps of a Dyck path. St000050The depth or height of a binary tree. St000094The depth of an ordered tree. St000226The convexity of a permutation. St000299The number of nonisomorphic vertex-induced subtrees. St000305The inverse major index of a permutation. St000339The maf index of a permutation. St000340The number of non-final maximal constant sub-paths of length greater than one. St000495The number of inversions of distance at most 2 of a permutation. St000519The largest length of a factor maximising the subword complexity. St000642The size of the smallest orbit of antichains under Panyushev complementation. St000676The number of odd rises of a Dyck path. St000724The label of the leaf of the path following the smaller label in the increasing binary tree associated to a permutation. St000922The minimal number such that all substrings of this length are unique. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001134The largest label in the subtree rooted at the sister of 1 in the leaf labelled binary unordered tree associated with the perfect matching. St001343The dimension of the reduced incidence algebra of a poset. St001345The Hamming dimension of a graph. St001391The disjunction number of a graph. St001502The global dimension minus the dominant dimension of magnitude 1 Nakayama algebras. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St001584The area statistic between a Dyck path and its bounce path. St001635The trace of the square of the Coxeter matrix of the incidence algebra of a poset. St001649The length of a longest trail in a graph. St001910The height of the middle non-run of a Dyck path. St001925The minimal number of zeros in a row of an alternating sign matrix. St001927Sparre Andersen's number of positives of a signed permutation. St000004The major index of a permutation. St000030The sum of the descent differences of a permutations. St000067The inversion number of the alternating sign matrix. St000280The size of the preimage of the map 'to labelling permutation' from Parking functions to Permutations. St000334The maz index, the major index of a permutation after replacing fixed points by zeros. St000794The mak of a permutation. St000795The mad of a permutation. St000797The stat`` of a permutation. St000848The balance constant multiplied with the number of linear extensions of a poset. St000890The number of nonzero entries in an alternating sign matrix. St000896The number of zeros on the main diagonal of an alternating sign matrix. St000907The number of maximal antichains of minimal length in a poset. St000911The number of maximal antichains of maximal size in a poset. St000912The number of maximal antichains in a poset. St000924The number of topologically connected components of a perfect matching. St000988The orbit size of a permutation under Foata's bijection. 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. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001045The number of leaves in the subtree not containing one in the decreasing labelled binary unordered tree associated with the perfect matching. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St001237The number of simple modules with injective dimension at most one or dominant dimension at least one. St001304The number of maximally independent sets of vertices of a graph. St001397Number of pairs of incomparable elements in a finite poset. St001419The length of the longest palindromic factor beginning with a one of a binary word. St001428The number of B-inversions of a signed permutation. St001500The global dimension of magnitude 1 Nakayama algebras. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St001902The number of potential covers of a poset. St001963The tree-depth of a graph. St000111The sum of the descent tops (or Genocchi descents) of a permutation. St000229Sum of the difference between the maximal and the minimal elements of the blocks plus the number of blocks of a set partition. St000231Sum of the maximal elements of the blocks of a set partition. St000336The leg major index of a standard tableau. St000625The sum of the minimal distances to a greater element. St000683The number of points below the Dyck path such that the diagonal to the north-east hits the path between two down steps, and the diagonal to the north-west hits the path between two up steps. St000719The number of alignments in a perfect matching. St000727The largest label of a leaf in the binary search tree associated with the permutation. St000743The number of entries in a standard Young tableau such that the next integer is a neighbour. St000796The stat' of a permutation. St000798The makl of a permutation. St000833The comajor index of a permutation. St000866The number of admissible inversions of a permutation in the sense of Shareshian-Wachs. St001030Half the number of non-boundary horizontal edges in the fully packed loop corresponding to the alternating sign matrix. St001074The number of inversions of the cyclic embedding of a permutation. St001211The number of simple modules in the corresponding Nakayama algebra that have vanishing second Ext-group with the regular module. St001268The size of the largest ordinal summand in the poset. St001398Number of subsets of size 3 of elements in a poset that form a "v". St001492The number of simple modules that do not appear in the socle of the regular module or have no nontrivial selfextensions with the regular module in the corresponding Nakayama algebra. St000026The position of the first return of a Dyck path. St000057The Shynar inversion number of a standard tableau. St000058The order of a permutation. St000076The rank of the alternating sign matrix in the alternating sign matrix poset. St000304The load of a permutation. St000525The number of posets with the same zeta polynomial. St000626The minimal period of a binary word. St000682The Grundy value of Welter's game on a binary word. St000841The largest opener of a perfect matching. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. St001020Sum of the codominant dimensions of the non-projective indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. 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. St001416The length of a longest palindromic factor of a binary word. St001417The length of a longest palindromic subword of a binary word. St001486The number of corners of the ribbon associated with an integer composition. St000393The number of strictly increasing runs in a binary word. St000446The disorder of a permutation. St000643The size of the largest orbit of antichains under Panyushev complementation. St001042The size of the automorphism group of the leaf labelled binary unordered tree associated with the perfect matching. St001710The number of permutations such that conjugation with a permutation of given cycle type yields the inverse permutation. St001782The order of rowmotion on the set of order ideals of a poset. St000104The number of facets in the order polytope of this poset. St000151The number of facets in the chain polytope of the poset. St000507The number of ascents of a standard tableau. St000543The size of the conjugacy class of a binary word. St000726The normalized sum of the leaf labels of the increasing binary tree associated to a permutation. St000780The size of the orbit under rotation of a perfect matching. St000946The sum of the skew hook positions in a Dyck path. St001319The minimal number of occurrences of the star-pattern in a linear ordering of the vertices of the graph. St000086The number of subgraphs. St000395The sum of the heights of the peaks of a Dyck path. St000471The sum of the ascent tops of a permutation. St000984The number of boxes below precisely one peak. St001379The number of inversions plus the major index of a permutation. St001346The number of parking functions that give the same permutation. St001437The flex of a binary word. St001834The number of non-isomorphic minors of a graph. St000012The area of a Dyck path. St000100The number of linear extensions of a poset. St000087The number of induced subgraphs. St000641The number of non-empty boolean intervals in a poset. St001259The vector space dimension of the double dual of D(A) in the corresponding Nakayama algebra. St000639The number of relations in a poset. St000082The number of elements smaller than a binary tree in Tamari order. St000180The number of chains of a poset. St000419The number of Dyck paths that are weakly above the Dyck path, except for the path itself. St001472The permanent of the Coxeter matrix of the poset. St001664The number of non-isomorphic subposets of a poset. St000420The number of Dyck paths that are weakly above a Dyck path. St001779The order of promotion on the set of linear extensions of a poset. St001838The number of nonempty primitive factors of a binary word. St000631The number of distinct palindromic decompositions of a binary word. St000059The inversion number of a standard tableau as defined by Haglund and Stevens. St000014The number of parking functions supported by a Dyck path. St000085The number of linear extensions of the tree. St000294The number of distinct factors of a binary word. St001885The number of binary words with the same proper border set. St001706The number of closed sets in a graph. St000391The sum of the positions of the ones in a binary word. St001929The number of meanders with top half given by the noncrossing matching corresponding to the Dyck path. St001688The sum of the squares of the heights of the peaks of a Dyck path. St001909The number of interval-closed sets of a poset. St001709The number of homomorphisms to the three element chain of a poset. St000518The number of distinct subsequences in a binary word. St000032The number of elements smaller than the given Dyck path in the Tamari Order. St001758The number of orbits of promotion on a graph. St000484The sum of St000483 over all subsequences of length at least three. St001802The number of endomorphisms of a graph. St000348The non-inversion sum of a binary word. St001627The number of coloured connected graphs such that the multiplicities of colours are given by a partition. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001813The product of the sizes of the principal order filters in a poset. St000324The shape of the tree associated to a permutation. St001815The number of order preserving surjections from a poset to a total order. St001765The number of connected components of the friends and strangers graph. St000421The number of Dyck paths that are weakly below a Dyck path, except for the path itself. St000418The number of Dyck paths that are weakly below a Dyck path. St000040The number of regions of the inversion arrangement of a permutation. St000634The number of endomorphisms of a poset. St000038The product of the heights of the descending steps of a Dyck path. St000068The number of minimal elements in a poset. St001410The minimal entry of a semistandard tableau. St001805The maximal overlap of a cylindrical tableau associated with a semistandard tableau. St001763The Hurwitz number of an integer partition. St001862The number of crossings of a signed permutation. St001866The nesting alignments of a signed permutation. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St000177The number of free tiles in the pattern. St001851The number of Hecke atoms of a signed permutation. St001868The number of alignments of type NE of a signed permutation. St000178Number of free entries. St001638The book thickness of a graph. St001769The reflection length of a signed permutation. St001848The atomic length of a signed permutation. St001861The number of Bruhat lower covers of a permutation. St001864The number of excedances of a signed permutation. St001894The depth of a signed permutation. St001896The number of right descents of a signed permutations. St001863The number of weak excedances of a signed permutation. St001867The number of alignments of type EN of a signed permutation. St001889The size of the connectivity set of a signed permutation. St000176The total number of tiles in the Gelfand-Tsetlin pattern. St001404The number of distinct entries in a Gelfand Tsetlin pattern. St001406The number of nonzero entries in a Gelfand Tsetlin pattern. St001686The order of promotion on a Gelfand-Tsetlin pattern. St001855The number of signed permutations less than or equal to a signed permutation in left weak order. St001892The flag excedance statistic of a signed permutation. St001893The flag descent of a signed permutation. St001817The number of flag weak exceedances of a signed permutation. St001772The number of occurrences of the signed pattern 12 in a signed permutation. St000826The stopping time of the decimal representation of the binary word for the 3x+1 problem. St001865The number of alignments of a signed permutation. St001770The number of facets of a certain subword complex associated with the signed permutation. St001852The size of the conjugacy class of the signed permutation. St000047The number of standard immaculate tableaux of a given shape. St000827The decimal representation of a binary word with a leading 1. St000115The single entry in the last row. St000186The sum of the first row in a Gelfand-Tsetlin pattern. St000114The sum of the entries of the Gelfand-Tsetlin pattern. St000527The width of the poset.