searching the database
Your data matches 509 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St000100
Mp00233: Dyck paths —skew partition⟶ Skew partitions
Mp00192: Skew partitions —dominating sublattice⟶ Lattices
Mp00193: Lattices —to poset⟶ Posets
St000100: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00192: Skew partitions —dominating sublattice⟶ Lattices
Mp00193: Lattices —to poset⟶ Posets
St000100: Posets ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1,0,1,1,0,0,1,0]
=> [[2,2,1],[1]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,1,0,0,1,1,0,0]
=> [[3,2],[1]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [[2,2,1,1],[1]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [[2,2,2,1],[1,1]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [[3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [[3,3,1],[2]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [[3,3,1],[1]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [[2,2,2,1],[1]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [[3,2,2],[1,1]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [[3,3,2],[2,1]]
=> ([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [[4,2],[1]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [[3,3,2],[1,1]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [[4,3],[2]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [[4,3],[1]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,1,1,0,0,0,1,1,0,0]
=> [[3,2,2],[1]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,1,1,0,0,1,0,0,1,0]
=> [[3,3,2],[2]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,1,1,0,0,1,1,0,0,0]
=> [[3,3,2],[1]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [[2,2,1,1,1],[1]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [[2,2,2,1,1],[1,1]]
=> ([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [[3,2,1,1],[1]]
=> ([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [[3,3,1,1],[2]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,0,1,0,1,1,0,1,1,0,0,0]
=> [[3,3,1,1],[1]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [[2,2,2,1,1],[1]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [[2,2,2,2,1],[1,1,1]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [[3,2,2,1],[1,1]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [[3,3,2,1],[2,1]]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 2
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [[4,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [[3,3,2,1],[1,1]]
=> ([(0,3),(2,1),(3,2)],4)
=> ([(0,3),(2,1),(3,2)],4)
=> 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [[3,3,3,1],[2,2]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [[4,3,1],[2]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [[4,4,1],[3]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,0,1,1,0,1,0,1,1,0,0,0]
=> [[4,4,1],[2]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,0,1,1,0,1,1,0,0,0,1,0]
=> [[3,3,3,1],[2,1]]
=> ([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> 1
[1,0,1,1,0,1,1,0,0,1,0,0]
=> [[4,3,1],[1]]
=> ([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> 1
[1,0,1,1,0,1,1,0,1,0,0,0]
=> [[3,3,3,1],[1,1]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,0,1,1,0,1,1,1,0,0,0,0]
=> [[4,4,1],[1]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,0,1,1,1,0,0,0,1,0,1,0]
=> [[2,2,2,2,1],[1,1]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [[3,2,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> 1
[1,0,1,1,1,0,0,1,0,0,1,0]
=> [[3,3,2,1],[2]]
=> ([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> 1
[1,0,1,1,1,0,0,1,1,0,0,0]
=> [[3,3,2,1],[1]]
=> ([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> 1
[1,0,1,1,1,0,1,0,0,0,1,0]
=> [[2,2,2,2,1],[1]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [[3,3,3,1],[2]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,0,1,1,1,1,0,0,1,0,0,0]
=> [[3,3,3,1],[1]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [[3,2,2,2],[1,1,1]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [[3,3,2,2],[2,1,1]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [[4,2,2],[1,1]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,1,0,0,1,0,1,1,1,0,0,0]
=> [[3,3,2,2],[1,1,1]]
=> ([(0,1)],2)
=> ([(0,1)],2)
=> 1
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [[3,3,3,2],[2,2,1]]
=> ([(0,2),(2,1)],3)
=> ([(0,2),(2,1)],3)
=> 1
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [[4,3,2],[2,1]]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 2
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [[4,4,2],[3,1]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 2
Description
The number of linear extensions of a poset.
Matching statistic: St000655
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00027: Dyck paths —to partition⟶ Integer partitions
Mp00321: Integer partitions —2-conjugate⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St000655: Dyck paths ⟶ ℤResult quality: 25% ●values known / values provided: 47%●distinct values known / distinct values provided: 25%
Mp00321: Integer partitions —2-conjugate⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
St000655: Dyck paths ⟶ ℤResult quality: 25% ●values known / values provided: 47%●distinct values known / distinct values provided: 25%
Values
[1,0,1,1,0,0,1,0]
=> [3,1,1]
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1
[1,1,0,0,1,1,0,0]
=> [2,2]
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [4,2,2,1]
=> [7,2]
=> [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [4,3,1,1]
=> [5,2,1,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [3,3,1,1]
=> [3,2,1,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [4,2,1,1]
=> [6,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,2,1,1]
=> [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [4,1,1,1]
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [3,3,2]
=> [5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [4,2,2]
=> [6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [3,2,2]
=> [6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,3,1]
=> [3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,1]
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1
[1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> [3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> 1
[1,1,1,0,0,1,0,0,1,0]
=> [4,2]
=> [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> 1
[1,1,1,0,0,1,1,0,0,0]
=> [2,2]
=> [4]
=> [1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [5,3,3,2,1]
=> [3,3,3,3,2]
=> [1,1,1,1,1,1,0,0,0,1,0,0,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,2,1]
=> [8,3,3]
=> [1,0,1,0,1,0,1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> ? = 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [4,4,2,2,1]
=> [9,4]
=> [1,0,1,0,1,0,1,0,1,0,1,1,1,0,1,0,1,0,0,0]
=> ? = 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,2,1]
=> [5,3,3,2]
=> [1,0,1,0,1,1,1,1,1,0,0,1,0,0,0,0]
=> 1
[1,0,1,0,1,1,0,1,1,0,0,0]
=> [3,3,2,2,1]
=> [5,3,3]
=> [1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> 1
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [5,2,2,2,1]
=> [7,3,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,1,1,0,0,0,0]
=> ? = 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,1]
=> [5,4,3,1,1]
=> [1,0,1,1,1,0,1,1,1,0,0,0,0,1,0,1,0,0]
=> ? = 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [4,4,3,1,1]
=> [7,4,1,1]
=> [1,0,1,0,1,0,1,1,1,0,1,0,1,0,0,1,0,1,0,0]
=> ? = 2
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [5,3,3,1,1]
=> [3,3,2,2,1,1,1]
=> [1,1,1,0,1,1,0,1,0,0,0,1,0,1,0,1,0,0]
=> ? = 2
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [4,3,3,1,1]
=> [5,3,2,1,1]
=> [1,0,1,0,1,1,1,0,1,1,0,0,0,1,0,1,0,0]
=> ? = 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [3,3,3,1,1]
=> [3,3,2,1,1,1]
=> [1,1,1,0,1,1,0,0,0,1,0,1,0,1,0,0]
=> ? = 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,1]
=> [6,3,3,1]
=> [1,0,1,0,1,0,1,1,1,1,1,0,0,0,0,1,0,0]
=> ? = 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [4,4,2,1,1]
=> [8,3,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,1,0,1,0,0,1,0,0]
=> ? = 2
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,1]
=> [4,3,3,1,1]
=> [1,0,1,1,1,1,1,0,0,0,0,1,0,1,0,0]
=> 1
[1,0,1,1,0,1,0,1,1,0,0,0]
=> [3,3,2,1,1]
=> [3,3,3,1]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0,1,0]
=> [5,2,2,1,1]
=> [6,3,1,1]
=> [1,0,1,0,1,0,1,1,1,0,1,0,0,1,0,1,0,0]
=> ? = 1
[1,0,1,1,0,1,1,0,0,1,0,0]
=> [4,2,2,1,1]
=> [8,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> 1
[1,0,1,1,0,1,1,0,1,0,0,0]
=> [3,2,2,1,1]
=> [5,3,1]
=> [1,0,1,0,1,1,1,0,1,0,0,1,0,0]
=> 1
[1,0,1,1,0,1,1,1,0,0,0,0]
=> [2,2,2,1,1]
=> [7,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,1,1]
=> [5,4,1,1,1]
=> [1,0,1,1,1,0,1,0,1,0,0,1,0,1,0,1,0,0]
=> ? = 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [4,4,1,1,1]
=> [7,2,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> ? = 1
[1,0,1,1,1,0,0,1,0,0,1,0]
=> [5,3,1,1,1]
=> [3,2,2,1,1,1,1]
=> [1,0,1,1,1,1,0,0,0,1,0,1,0,1,0,1,0,0]
=> ? = 1
[1,0,1,1,1,0,0,1,1,0,0,0]
=> [3,3,1,1,1]
=> [3,2,1,1,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> 1
[1,0,1,1,1,0,1,0,0,0,1,0]
=> [5,2,1,1,1]
=> [4,3,1,1,1]
=> [1,0,1,1,1,0,1,0,0,1,0,1,0,1,0,0]
=> 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [5,1,1,1,1]
=> [2,2,1,1,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,1,0,0]
=> 1
[1,0,1,1,1,1,0,0,1,0,0,0]
=> [3,1,1,1,1]
=> [2,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [4,4,3,2]
=> [8,5]
=> [1,0,1,0,1,0,1,1,1,0,1,0,1,0,1,0,0,0]
=> ? = 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [5,3,3,2]
=> [5,3,2,2,1]
=> [1,0,1,0,1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> ? = 2
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [4,3,3,2]
=> [7,4,1]
=> [1,0,1,0,1,0,1,1,1,0,1,0,1,0,0,1,0,0]
=> ? = 1
[1,1,0,0,1,0,1,1,1,0,0,0]
=> [3,3,3,2]
=> [5,3,2,1]
=> [1,0,1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> 1
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [5,4,2,2]
=> [8,4,1]
=> [1,0,1,0,1,0,1,0,1,1,1,0,1,0,1,0,0,1,0,0]
=> ? = 1
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [4,4,2,2]
=> [8,4]
=> [1,0,1,0,1,0,1,0,1,1,1,0,1,0,1,0,0,0]
=> ? = 2
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [5,3,2,2]
=> [7,2,2,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,1,1,0,0,0,1,0,0]
=> ? = 2
[1,1,0,0,1,1,0,1,0,1,0,0]
=> [4,3,2,2]
=> [8,3]
=> [1,0,1,0,1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> ? = 1
[1,1,0,0,1,1,0,1,1,0,0,0]
=> [3,3,2,2]
=> [7,2,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> 1
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [5,2,2,2]
=> [8,2,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> ? = 1
[1,1,0,0,1,1,1,0,0,1,0,0]
=> [4,2,2,2]
=> [8,2]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> ? = 1
[1,1,0,0,1,1,1,0,1,0,0,0]
=> [3,2,2,2]
=> [8,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> 1
[1,1,0,0,1,1,1,1,0,0,0,0]
=> [2,2,2,2]
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [4,4,3,1]
=> [6,5,1]
=> [1,0,1,1,1,0,1,0,1,0,1,0,0,1,0,0]
=> 1
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [5,3,3,1]
=> [3,3,2,2,1,1]
=> [1,1,1,0,1,1,0,1,0,0,0,1,0,1,0,0]
=> ? = 1
[1,1,0,1,0,0,1,1,0,1,0,0]
=> [4,3,3,1]
=> [5,4,1,1]
=> [1,0,1,1,1,0,1,0,1,0,0,1,0,1,0,0]
=> 1
[1,1,0,1,0,0,1,1,1,0,0,0]
=> [3,3,3,1]
=> [3,3,2,1,1]
=> [1,1,1,0,1,1,0,0,0,1,0,1,0,0]
=> 1
[1,1,0,1,0,1,0,0,1,1,0,0]
=> [4,4,2,1]
=> [7,4]
=> [1,0,1,0,1,0,1,1,1,0,1,0,1,0,0,0]
=> 1
[1,1,0,1,0,1,1,0,0,1,0,0]
=> [4,2,2,1]
=> [7,2]
=> [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> 1
[1,1,0,1,1,0,0,0,1,1,0,0]
=> [4,4,1,1]
=> [6,3,1]
=> [1,0,1,0,1,0,1,1,1,0,1,0,0,1,0,0]
=> 1
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [5,3,1,1]
=> [3,2,2,1,1,1]
=> [1,0,1,1,1,1,0,0,0,1,0,1,0,1,0,0]
=> 1
[1,1,0,1,1,0,0,1,0,1,0,0]
=> [4,3,1,1]
=> [5,2,1,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> 1
[1,1,0,1,1,0,0,1,1,0,0,0]
=> [3,3,1,1]
=> [3,2,1,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> 1
[1,1,0,1,1,0,1,0,0,1,0,0]
=> [4,2,1,1]
=> [6,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> 1
[1,1,0,1,1,0,1,1,0,0,0,0]
=> [2,2,1,1]
=> [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 1
[1,1,0,1,1,1,0,0,0,1,0,0]
=> [4,1,1,1]
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> [4,4,3]
=> [6,5]
=> [1,0,1,1,1,0,1,0,1,0,1,0,0,0]
=> 1
[1,1,1,0,0,0,1,1,0,0,1,0]
=> [5,3,3]
=> [3,3,2,2,1]
=> [1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> 1
[1,1,1,0,0,0,1,1,0,1,0,0]
=> [4,3,3]
=> [5,4,1]
=> [1,0,1,1,1,0,1,0,1,0,0,1,0,0]
=> 1
[1,1,1,0,0,0,1,1,1,0,0,0]
=> [3,3,3]
=> [3,3,2,1]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> 1
[1,1,1,0,0,1,0,0,1,0,1,0]
=> [5,4,2]
=> [6,4,1]
=> [1,0,1,0,1,1,1,0,1,0,1,0,0,1,0,0]
=> 1
[1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [6,4,4,3,2,1]
=> ?
=> ?
=> ? = 1
[1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3,2,1]
=> ?
=> ?
=> ? = 1
[1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> [5,5,3,3,2,1]
=> ?
=> ?
=> ? = 1
[1,0,1,0,1,0,1,1,0,1,0,0,1,0]
=> [6,4,3,3,2,1]
=> ?
=> ?
=> ? = 1
[1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,2,1]
=> ?
=> ?
=> ? = 1
[1,0,1,0,1,1,0,0,1,0,1,1,0,0]
=> [5,5,4,2,2,1]
=> ?
=> ?
=> ? = 2
[1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [6,4,4,2,2,1]
=> ?
=> ?
=> ? = 2
[1,0,1,0,1,1,0,0,1,1,0,1,0,0]
=> [5,4,4,2,2,1]
=> ?
=> ?
=> ? = 1
[1,0,1,0,1,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,2,1]
=> ?
=> ?
=> ? = 1
[1,0,1,0,1,1,0,1,0,0,1,1,0,0]
=> [5,5,3,2,2,1]
=> ?
=> ?
=> ? = 2
[1,0,1,0,1,1,0,1,0,1,0,0,1,0]
=> [6,4,3,2,2,1]
=> ?
=> ?
=> ? = 1
[1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,1,1]
=> ?
=> ?
=> ? = 1
[1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> [5,5,4,3,1,1]
=> ?
=> ?
=> ? = 2
[1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> [6,4,4,3,1,1]
=> ?
=> ?
=> ? = 2
[1,0,1,1,0,0,1,0,1,1,0,1,0,0]
=> [5,4,4,3,1,1]
=> ?
=> ?
=> ? = 2
[1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3,1,1]
=> ?
=> ?
=> ? = 2
[1,0,1,1,0,0,1,1,0,1,0,0,1,0]
=> [6,4,3,3,1,1]
=> ?
=> ?
=> ? = 3
[1,0,1,1,0,0,1,1,0,1,0,1,0,0]
=> [5,4,3,3,1,1]
=> [5,5,4,1,1,1]
=> [1,1,1,0,1,1,1,0,1,0,0,0,0,1,0,1,0,1,0,0]
=> ? = 1
[1,0,1,1,0,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,1,1]
=> ?
=> ?
=> ? = 1
[1,0,1,1,0,1,0,0,1,0,1,1,0,0]
=> [5,5,4,2,1,1]
=> ?
=> ?
=> ? = 3
[1,0,1,1,0,1,0,0,1,1,0,0,1,0]
=> [6,4,4,2,1,1]
=> ?
=> ?
=> ? = 3
[1,0,1,1,0,1,0,0,1,1,0,1,0,0]
=> [5,4,4,2,1,1]
=> [9,4,3,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,1,0,1,1,1,0,0,0,0,1,0,0]
=> ? = 2
[1,0,1,1,0,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,1,1]
=> ?
=> ?
=> ? = 1
[1,0,1,1,0,1,0,1,0,0,1,1,0,0]
=> [5,5,3,2,1,1]
=> [4,3,3,3,3,1]
=> [1,0,1,1,1,1,1,1,0,1,0,0,0,0,0,1,0,0]
=> ? = 2
[1,0,1,1,0,1,0,1,0,1,0,0,1,0]
=> [6,4,3,2,1,1]
=> [8,7,1,1]
=> [1,0,1,1,1,0,1,0,1,0,1,0,1,0,1,0,0,1,0,1,0,0]
=> ? = 1
[1,0,1,1,1,1,0,0,1,1,0,0,0,0]
=> [3,3,1,1,1,1]
=> [3,2,1,1,1,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 1
Description
The length of the minimal rise of a Dyck path.
For the length of a maximal rise, see [[St000444]].
Matching statistic: St001371
Mp00027: Dyck paths —to partition⟶ Integer partitions
Mp00321: Integer partitions —2-conjugate⟶ Integer partitions
Mp00095: Integer partitions —to binary word⟶ Binary words
St001371: Binary words ⟶ ℤResult quality: 25% ●values known / values provided: 46%●distinct values known / distinct values provided: 25%
Mp00321: Integer partitions —2-conjugate⟶ Integer partitions
Mp00095: Integer partitions —to binary word⟶ Binary words
St001371: Binary words ⟶ ℤResult quality: 25% ●values known / values provided: 46%●distinct values known / distinct values provided: 25%
Values
[1,0,1,1,0,0,1,0]
=> [3,1,1]
=> [2,1,1,1]
=> 101110 => 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [2,2]
=> [4]
=> 10000 => 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [4,2,2,1]
=> [7,2]
=> 100000100 => 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [4,3,1,1]
=> [5,2,1,1]
=> 100010110 => 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [3,3,1,1]
=> [3,2,1,1,1]
=> 10101110 => 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [4,2,1,1]
=> [6,1,1]
=> 100000110 => 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,2,1,1]
=> [5,1]
=> 1000010 => 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [4,1,1,1]
=> [4,1,1,1]
=> 10001110 => 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [3,3,2]
=> [5,2,1]
=> 10001010 => 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [4,2,2]
=> [6,2]
=> 10000100 => 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [3,2,2]
=> [6,1]
=> 10000010 => 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> [6]
=> 1000000 => 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,3,1]
=> [3,2,1,1]
=> 1010110 => 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,1]
=> [2,1,1,1]
=> 101110 => 0 = 1 - 1
[1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> [3,2,1]
=> 101010 => 0 = 1 - 1
[1,1,1,0,0,1,0,0,1,0]
=> [4,2]
=> [4,2]
=> 100100 => 0 = 1 - 1
[1,1,1,0,0,1,1,0,0,0]
=> [2,2]
=> [4]
=> 10000 => 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [5,3,3,2,1]
=> [3,3,3,3,2]
=> 11110100 => 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,2,1]
=> [8,3,3]
=> 10000011000 => ? = 1 - 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [4,4,2,2,1]
=> [9,4]
=> 10000010000 => ? = 1 - 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,2,1]
=> [5,3,3,2]
=> 100110100 => 0 = 1 - 1
[1,0,1,0,1,1,0,1,1,0,0,0]
=> [3,3,2,2,1]
=> [5,3,3]
=> 10011000 => 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [5,2,2,2,1]
=> [7,3,2]
=> 1000010100 => ? = 1 - 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,1]
=> [5,4,3,1,1]
=> 1010100110 => ? = 1 - 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [4,4,3,1,1]
=> [7,4,1,1]
=> 10001000110 => ? = 2 - 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [5,3,3,1,1]
=> [3,3,2,2,1,1,1]
=> 1101101110 => ? = 2 - 1
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [4,3,3,1,1]
=> [5,3,2,1,1]
=> 1001010110 => ? = 1 - 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [3,3,3,1,1]
=> [3,3,2,1,1,1]
=> 110101110 => 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,1]
=> [6,3,3,1]
=> 1000110010 => ? = 1 - 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [4,4,2,1,1]
=> [8,3,1]
=> 10000010010 => ? = 2 - 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,1]
=> [4,3,3,1,1]
=> 101100110 => 0 = 1 - 1
[1,0,1,1,0,1,0,1,1,0,0,0]
=> [3,3,2,1,1]
=> [3,3,3,1]
=> 1110010 => 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0,1,0]
=> [5,2,2,1,1]
=> [6,3,1,1]
=> 1000100110 => ? = 1 - 1
[1,0,1,1,0,1,1,0,0,1,0,0]
=> [4,2,2,1,1]
=> [8,1,1]
=> 10000000110 => ? = 1 - 1
[1,0,1,1,0,1,1,0,1,0,0,0]
=> [3,2,2,1,1]
=> [5,3,1]
=> 10010010 => 0 = 1 - 1
[1,0,1,1,0,1,1,1,0,0,0,0]
=> [2,2,2,1,1]
=> [7,1]
=> 100000010 => 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,1,1]
=> [5,4,1,1,1]
=> 1010001110 => ? = 1 - 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [4,4,1,1,1]
=> [7,2,1,1]
=> 10000010110 => ? = 1 - 1
[1,0,1,1,1,0,0,1,0,0,1,0]
=> [5,3,1,1,1]
=> [3,2,2,1,1,1,1]
=> 1011011110 => ? = 1 - 1
[1,0,1,1,1,0,0,1,1,0,0,0]
=> [3,3,1,1,1]
=> [3,2,1,1,1,1]
=> 101011110 => 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0,1,0]
=> [5,2,1,1,1]
=> [4,3,1,1,1]
=> 101001110 => 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [5,1,1,1,1]
=> [2,2,1,1,1,1,1]
=> 110111110 => 0 = 1 - 1
[1,0,1,1,1,1,0,0,1,0,0,0]
=> [3,1,1,1,1]
=> [2,1,1,1,1,1]
=> 10111110 => 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [4,4,3,2]
=> [8,5]
=> 1000100000 => ? = 1 - 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [5,3,3,2]
=> [5,3,2,2,1]
=> 1001011010 => ? = 2 - 1
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [4,3,3,2]
=> [7,4,1]
=> 1000100010 => ? = 1 - 1
[1,1,0,0,1,0,1,1,1,0,0,0]
=> [3,3,3,2]
=> [5,3,2,1]
=> 100101010 => 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [5,4,2,2]
=> [8,4,1]
=> 10000100010 => ? = 1 - 1
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [4,4,2,2]
=> [8,4]
=> 1000010000 => ? = 2 - 1
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [5,3,2,2]
=> [7,2,2,1]
=> 10000011010 => ? = 2 - 1
[1,1,0,0,1,1,0,1,0,1,0,0]
=> [4,3,2,2]
=> [8,3]
=> 1000001000 => ? = 1 - 1
[1,1,0,0,1,1,0,1,1,0,0,0]
=> [3,3,2,2]
=> [7,2,1]
=> 1000001010 => ? = 1 - 1
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [5,2,2,2]
=> [8,2,1]
=> 10000001010 => ? = 1 - 1
[1,1,0,0,1,1,1,0,0,1,0,0]
=> [4,2,2,2]
=> [8,2]
=> 1000000100 => ? = 1 - 1
[1,1,0,0,1,1,1,0,1,0,0,0]
=> [3,2,2,2]
=> [8,1]
=> 1000000010 => ? = 1 - 1
[1,1,0,0,1,1,1,1,0,0,0,0]
=> [2,2,2,2]
=> [8]
=> 100000000 => 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [4,4,3,1]
=> [6,5,1]
=> 101000010 => 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [5,3,3,1]
=> [3,3,2,2,1,1]
=> 110110110 => 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,1,0,0]
=> [4,3,3,1]
=> [5,4,1,1]
=> 101000110 => 0 = 1 - 1
[1,1,0,1,0,0,1,1,1,0,0,0]
=> [3,3,3,1]
=> [3,3,2,1,1]
=> 11010110 => 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,1,0,0]
=> [4,4,2,1]
=> [7,4]
=> 100010000 => 0 = 1 - 1
[1,1,0,1,0,1,1,0,0,1,0,0]
=> [4,2,2,1]
=> [7,2]
=> 100000100 => 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,1,0,0]
=> [4,4,1,1]
=> [6,3,1]
=> 100010010 => 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [5,3,1,1]
=> [3,2,2,1,1,1]
=> 101101110 => 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,1,0,0]
=> [4,3,1,1]
=> [5,2,1,1]
=> 100010110 => 0 = 1 - 1
[1,1,0,1,1,0,0,1,1,0,0,0]
=> [3,3,1,1]
=> [3,2,1,1,1]
=> 10101110 => 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,1,0,0]
=> [4,2,1,1]
=> [6,1,1]
=> 100000110 => 0 = 1 - 1
[1,1,0,1,1,0,1,1,0,0,0,0]
=> [2,2,1,1]
=> [5,1]
=> 1000010 => 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,1,0,0]
=> [4,1,1,1]
=> [4,1,1,1]
=> 10001110 => 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> [4,4,3]
=> [6,5]
=> 10100000 => 0 = 1 - 1
[1,1,1,0,0,0,1,1,0,0,1,0]
=> [5,3,3]
=> [3,3,2,2,1]
=> 11011010 => 0 = 1 - 1
[1,1,1,0,0,0,1,1,0,1,0,0]
=> [4,3,3]
=> [5,4,1]
=> 10100010 => 0 = 1 - 1
[1,1,1,0,0,0,1,1,1,0,0,0]
=> [3,3,3]
=> [3,3,2,1]
=> 1101010 => 0 = 1 - 1
[1,1,1,0,0,1,0,0,1,0,1,0]
=> [5,4,2]
=> [6,4,1]
=> 100100010 => 0 = 1 - 1
[1,1,1,0,0,1,0,0,1,1,0,0]
=> [4,4,2]
=> [6,4]
=> 10010000 => 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [6,4,4,3,2,1]
=> ?
=> ? => ? = 1 - 1
[1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3,2,1]
=> ?
=> ? => ? = 1 - 1
[1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> [5,5,3,3,2,1]
=> ?
=> ? => ? = 1 - 1
[1,0,1,0,1,0,1,1,0,1,0,0,1,0]
=> [6,4,3,3,2,1]
=> ?
=> ? => ? = 1 - 1
[1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,2,1]
=> ?
=> ? => ? = 1 - 1
[1,0,1,0,1,1,0,0,1,0,1,1,0,0]
=> [5,5,4,2,2,1]
=> ?
=> ? => ? = 2 - 1
[1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [6,4,4,2,2,1]
=> ?
=> ? => ? = 2 - 1
[1,0,1,0,1,1,0,0,1,1,0,1,0,0]
=> [5,4,4,2,2,1]
=> ?
=> ? => ? = 1 - 1
[1,0,1,0,1,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,2,1]
=> ?
=> ? => ? = 1 - 1
[1,0,1,0,1,1,0,1,0,0,1,1,0,0]
=> [5,5,3,2,2,1]
=> ?
=> ? => ? = 2 - 1
[1,0,1,0,1,1,0,1,0,1,0,0,1,0]
=> [6,4,3,2,2,1]
=> ?
=> ? => ? = 1 - 1
[1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,1,1]
=> ?
=> ? => ? = 1 - 1
[1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> [5,5,4,3,1,1]
=> ?
=> ? => ? = 2 - 1
[1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> [6,4,4,3,1,1]
=> ?
=> ? => ? = 2 - 1
[1,0,1,1,0,0,1,0,1,1,0,1,0,0]
=> [5,4,4,3,1,1]
=> ?
=> ? => ? = 2 - 1
[1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3,1,1]
=> ?
=> ? => ? = 2 - 1
[1,0,1,1,0,0,1,1,0,1,0,0,1,0]
=> [6,4,3,3,1,1]
=> ?
=> ? => ? = 3 - 1
[1,0,1,1,0,0,1,1,0,1,0,1,0,0]
=> [5,4,3,3,1,1]
=> [5,5,4,1,1,1]
=> 11010001110 => ? = 1 - 1
[1,0,1,1,0,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,1,1]
=> ?
=> ? => ? = 1 - 1
[1,0,1,1,0,1,0,0,1,0,1,1,0,0]
=> [5,5,4,2,1,1]
=> ?
=> ? => ? = 3 - 1
[1,0,1,1,0,1,0,0,1,1,0,0,1,0]
=> [6,4,4,2,1,1]
=> ?
=> ? => ? = 3 - 1
[1,0,1,1,0,1,0,0,1,1,0,1,0,0]
=> [5,4,4,2,1,1]
=> [9,4,3,1]
=> 1000001010010 => ? = 2 - 1
[1,0,1,1,0,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,1,1]
=> ?
=> ? => ? = 1 - 1
[1,0,1,1,0,1,0,1,0,0,1,1,0,0]
=> [5,5,3,2,1,1]
=> [4,3,3,3,3,1]
=> 1011110010 => ? = 2 - 1
[1,0,1,1,0,1,0,1,0,1,0,0,1,0]
=> [6,4,3,2,1,1]
=> [8,7,1,1]
=> 101000000110 => ? = 1 - 1
Description
The length of the longest Yamanouchi prefix of a binary word.
This is the largest index $i$ such that in each of the prefixes $w_1$, $w_1w_2$, $w_1w_2\dots w_i$ the number of zeros is greater than or equal to the number of ones.
Matching statistic: St001593
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00142: Dyck paths —promotion⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St001593: Integer partitions ⟶ ℤResult quality: 25% ●values known / values provided: 45%●distinct values known / distinct values provided: 25%
Mp00142: Dyck paths —promotion⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St001593: Integer partitions ⟶ ℤResult quality: 25% ●values known / values provided: 45%●distinct values known / distinct values provided: 25%
Values
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [4,2,2,1]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [3,3,1,1]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> [5,3,3,2,1]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,2,1]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> [4,4,2,2,1]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,2,1]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,1,0,0,0]
=> [3,3,2,2,1]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0]
=> [5,2,2,2,1]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> [4,4,3,1,1]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> [5,3,3,1,1]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,1,0,0]
=> [4,3,3,1,1]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> [3,3,3,1,1]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0]
=> [4,4,2,1,1]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0]
=> [4,2,2,1,1]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> [4,4,1,1,1]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0,1,0]
=> [5,3,1,1,1]
=> 0 = 1 - 1
[1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0]
=> [3,3,1,1,1]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [6,4,4,3,2,1]
=> ? = 1 - 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3,2,1]
=> ? = 1 - 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> [5,5,3,3,2,1]
=> ? = 1 - 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0,1,0]
=> [6,4,3,3,2,1]
=> ? = 1 - 1
[1,0,1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,1,0,0,0]
=> [4,4,3,3,2,1]
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,0,1,1,1,0,0,0,1,0]
=> [6,3,3,3,2,1]
=> ? = 1 - 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,2,1]
=> ? = 1 - 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,1,0,0]
=> [5,5,4,2,2,1]
=> ? = 2 - 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [6,4,4,2,2,1]
=> ? = 2 - 1
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,1,0,0]
=> [5,4,4,2,2,1]
=> ? = 1 - 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,0,1,1,1,0,0,0]
=> [4,4,4,2,2,1]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,2,1]
=> ? = 1 - 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,1,0,0]
=> [5,5,3,2,2,1]
=> ? = 2 - 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0,1,0]
=> [6,4,3,2,2,1]
=> ? = 1 - 1
[1,0,1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,1,0,0,0]
=> [4,4,3,2,2,1]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,1,0,0,0,1,0]
=> [6,3,3,2,2,1]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,1,1,0,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,1,0,0,1,0,0]
=> [5,3,3,2,2,1]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,1,0,1,0,0,0]
=> [4,3,3,2,2,1]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,1,1,0,0,0,0,0]
=> [1,0,1,0,1,1,0,1,1,1,0,0,0,0]
=> [3,3,3,2,2,1]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,1,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> [6,5,2,2,2,1]
=> ? = 1 - 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,1,0,0,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,1,0,0]
=> [5,5,2,2,2,1]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,1,1,1,0,0,1,0,0,1,0,0]
=> [1,0,1,0,1,1,1,0,0,1,0,0,1,0]
=> [6,4,2,2,2,1]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,1,0,0,1,1,0,0,0]
=> [4,4,2,2,2,1]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,1,0,1,0,0,0,1,0]
=> [6,3,2,2,2,1]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,1,1,1,0,0,0,0,1,0,0]
=> [1,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> [6,2,2,2,2,1]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,1,1,0,0,1,0,0,0,0]
=> [1,0,1,0,1,1,1,1,0,0,1,0,0,0]
=> [4,2,2,2,2,1]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> [5,5,4,3,1,1]
=> ? = 1 - 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> [6,4,4,3,1,1]
=> ? = 2 - 1
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,1,0,0]
=> [5,4,4,3,1,1]
=> ? = 1 - 1
[1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,1,1,0,0,0]
=> [4,4,4,3,1,1]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3,1,1]
=> ? = 1 - 1
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> [5,5,3,3,1,1]
=> ? = 2 - 1
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,1,0,0,1,0]
=> [6,4,3,3,1,1]
=> ? = 2 - 1
[1,1,0,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,1,0,1,0,0]
=> [5,4,3,3,1,1]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,0,1,1,0,0,0]
=> [4,4,3,3,1,1]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0,1,0]
=> [6,3,3,3,1,1]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,1,0,0]
=> [5,3,3,3,1,1]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,1,0,0,0]
=> [4,3,3,3,1,1]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,1,1,1,0,0,0,0,0]
=> [1,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> [3,3,3,3,1,1]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,1,0,0]
=> [5,5,4,2,1,1]
=> ? = 1 - 1
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0,1,0]
=> [6,4,4,2,1,1]
=> ? = 1 - 1
[1,1,0,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,1,0,0]
=> [5,4,4,2,1,1]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,0,1,1,1,0,0,0]
=> [4,4,4,2,1,1]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,1,0,0]
=> [5,5,3,2,1,1]
=> 0 = 1 - 1
[1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,0,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,1,0,0,1,0,0]
=> [5,3,3,2,1,1]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,1,1,0,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0,1,1,0,0]
=> [5,5,2,2,1,1]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [1,1,1,0,1,1,0,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0,1,0]
=> [6,4,2,2,1,1]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,1,0,0]
=> [5,4,2,2,1,1]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,1,0,0,0]
=> [4,4,2,2,1,1]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,0,1,0,0]
=> [5,3,2,2,1,1]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,1,0,1,1,0,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,1,0,0,0,0]
=> [3,3,2,2,1,1]
=> 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,1,1,0,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,1,0,0,0,1,0,0]
=> [5,2,2,2,1,1]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,1,0,0]
=> [5,5,4,1,1,1]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0,1,0]
=> [6,4,4,1,1,1]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [7,5,5,4,3,2,1]
=> ? = 1 - 1
[1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [7,6,4,4,3,2,1]
=> ? = 1 - 1
[1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> [6,6,4,4,3,2,1]
=> ? = 1 - 1
[1,0,1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0,1,0]
=> [7,5,4,4,3,2,1]
=> ? = 1 - 1
[1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [7,6,5,3,3,2,1]
=> ? = 1 - 1
[1,0,1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0,1,1,0,0]
=> [6,6,5,3,3,2,1]
=> ? = 2 - 1
[1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [7,5,5,3,3,2,1]
=> ? = 2 - 1
[1,0,1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,1,0,1,0,0]
=> [6,5,5,3,3,2,1]
=> ? = 1 - 1
[1,0,1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,0,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0,1,0,1,0]
=> [7,6,4,3,3,2,1]
=> ? = 1 - 1
[1,0,1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0,1,1,0,0]
=> [6,6,4,3,3,2,1]
=> ? = 2 - 1
[1,0,1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0,1,0]
=> [7,5,4,3,3,2,1]
=> ? = 1 - 1
[1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [7,6,5,4,2,2,1]
=> ? = 1 - 1
[1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> [6,6,5,4,2,2,1]
=> ? = 2 - 1
[1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> [7,5,5,4,2,2,1]
=> ? = 2 - 1
[1,0,1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,1,0,1,0,0]
=> [6,5,5,4,2,2,1]
=> ? = 2 - 1
[1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [7,6,4,4,2,2,1]
=> ? = 2 - 1
[1,0,1,1,0,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,1,0,0,1,0]
=> [7,5,4,4,2,2,1]
=> ? = 3 - 1
[1,0,1,1,0,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,1,0,1,0,0]
=> [6,5,4,4,2,2,1]
=> ? = 1 - 1
[1,0,1,1,0,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0,1,0,1,0]
=> [7,6,5,3,2,2,1]
=> ? = 1 - 1
[1,0,1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0,1,1,0,0]
=> [6,6,5,3,2,2,1]
=> ? = 3 - 1
[1,0,1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,1,0,0,1,0]
=> [7,5,5,3,2,2,1]
=> ? = 3 - 1
[1,0,1,1,0,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,1,0,1,0,0]
=> [6,5,5,3,2,2,1]
=> ? = 2 - 1
[1,0,1,1,0,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0,1,0,1,0]
=> [7,6,4,3,2,2,1]
=> ? = 1 - 1
[1,0,1,1,0,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0,1,1,0,0]
=> [6,6,4,3,2,2,1]
=> ? = 2 - 1
[1,0,1,1,0,1,0,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0,1,0]
=> [7,5,4,3,2,2,1]
=> ? = 1 - 1
[1,1,0,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,1,0,0]
=> [6,6,5,4,3,1,1]
=> ? = 1 - 1
[1,1,0,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0]
=> [7,5,5,4,3,1,1]
=> ? = 2 - 1
[1,1,0,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,1,0,1,0,0]
=> [6,5,5,4,3,1,1]
=> ? = 1 - 1
[1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> [7,6,4,4,3,1,1]
=> ? = 2 - 1
Description
This is the number of standard Young tableaux of the given shifted shape.
For an integer partition $\lambda = (\lambda_1,\dots,\lambda_k)$, the shifted diagram is obtained by moving the $i$-th row in the diagram $i-1$ boxes to the right, i.e.,
$$\lambda^∗ = \{(i, j) | 1 \leq i \leq k, i \leq j \leq \lambda_i + i − 1 \}.$$
In particular, this statistic is zero if and only if $\lambda_{i+1} = \lambda_i$ for some $i$.
Matching statistic: St001600
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00143: Dyck paths —inverse promotion⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St001600: Integer partitions ⟶ ℤResult quality: 25% ●values known / values provided: 45%●distinct values known / distinct values provided: 25%
Mp00143: Dyck paths —inverse promotion⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St001600: Integer partitions ⟶ ℤResult quality: 25% ●values known / values provided: 45%●distinct values known / distinct values provided: 25%
Values
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [4,3,1,1]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [4,2,2]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,2,1]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,1]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> [5,3,3,1,1]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,1]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0,1,0]
=> [5,2,2,1,1]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,1,1]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0]
=> [5,3,3,2]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0,1,0]
=> [5,4,2,2]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0,1,0]
=> [5,3,2,2]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [5,2,2,2]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> [5,3,3,1]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,0,1,0]
=> [5,3,1,1]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,0,0,1,0]
=> [5,3,3]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> [5,4,2]
=> 0 = 1 - 1
[1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> [1,1,1,0,0,1,1,0,0,0,1,0]
=> [5,2,2]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3,2,1]
=> ? = 1 - 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,2,1]
=> ? = 1 - 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [6,4,4,2,2,1]
=> ? = 1 - 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,2,1]
=> ? = 1 - 1
[1,0,1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,1,0,0,0,1,0]
=> [6,3,3,2,2,1]
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> [6,5,2,2,2,1]
=> ? = 1 - 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,1,1]
=> ? = 1 - 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> [6,4,4,3,1,1]
=> ? = 2 - 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3,1,1]
=> ? = 2 - 1
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,1,0,0,1,0]
=> [6,4,3,3,1,1]
=> ? = 1 - 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0,1,0]
=> [6,3,3,3,1,1]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,1,1]
=> ? = 1 - 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0,1,0]
=> [6,4,4,2,1,1]
=> ? = 2 - 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,1,1]
=> ? = 1 - 1
[1,0,1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,1,0,0,0,1,0]
=> [6,3,3,2,1,1]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0,1,0,1,0]
=> [6,5,2,2,1,1]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0,1,0]
=> [6,4,2,2,1,1]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,0,0,1,0]
=> [6,3,2,2,1,1]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,1,1,0,0,0,0,0]
=> [1,0,1,1,0,1,1,1,0,0,0,0,1,0]
=> [6,2,2,2,1,1]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0,1,0]
=> [6,5,4,1,1,1]
=> ? = 1 - 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,1,0,0,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0,1,0]
=> [6,4,4,1,1,1]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,1,1,1,0,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0,1,0,1,0]
=> [6,5,3,1,1,1]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0,1,0]
=> [6,3,3,1,1,1]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0,1,0,1,0]
=> [6,5,2,1,1,1]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,1,1,1,0,0,0,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> [6,5,1,1,1,1]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,1,1,0,0,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,1,0,0,0,1,0]
=> [6,3,1,1,1,1]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0,1,0]
=> [6,4,4,3,2]
=> ? = 1 - 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,1,1,0,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3,2]
=> ? = 2 - 1
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,1,0,0,1,0]
=> [6,4,3,3,2]
=> ? = 1 - 1
[1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,1,1,0,0,0,1,0]
=> [6,3,3,3,2]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,2]
=> ? = 1 - 1
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0,1,0]
=> [6,4,4,2,2]
=> ? = 2 - 1
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,2]
=> ? = 2 - 1
[1,1,0,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,1,0,0,1,0]
=> [6,4,3,2,2]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,1,0,1,1,0,0,0,0]
=> [1,1,0,0,1,1,0,1,1,0,0,0,1,0]
=> [6,3,3,2,2]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0,1,0]
=> [6,5,2,2,2]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,1,1,0,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,1,0,0,1,0]
=> [6,4,2,2,2]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,1,0,0,0,0]
=> [1,1,0,0,1,1,1,0,1,0,0,0,1,0]
=> [6,3,2,2,2]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,1,1,1,0,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0,1,0]
=> [6,2,2,2,2]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,1,0,0,1,0]
=> [6,4,4,3,1]
=> ? = 1 - 1
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3,1]
=> ? = 1 - 1
[1,1,0,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0,1,0]
=> [6,4,3,3,1]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0,1,0]
=> [6,3,3,3,1]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,1,0,0,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0,1,0]
=> [6,4,4,2,1]
=> 0 = 1 - 1
[1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,0,1,1,0,0,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0,1,0]
=> [6,4,2,2,1]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,1,1,0,0,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0,1,0]
=> [6,4,4,1,1]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [1,1,1,0,1,1,0,0,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0,1,0,1,0]
=> [6,5,3,1,1]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0,1,0]
=> [6,4,3,1,1]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,1,1,0,0,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0,1,0]
=> [6,3,3,1,1]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,1,0,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0,1,0]
=> [6,4,2,1,1]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,1,0,1,1,0,0,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0,1,0]
=> [6,2,2,1,1]
=> 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,1,1,0,0,0,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0,1,0]
=> [6,4,1,1,1]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,1,0,0,1,0]
=> [6,4,4,3]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [7,6,4,4,3,2,1]
=> ? = 1 - 1
[1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [7,6,5,3,3,2,1]
=> ? = 1 - 1
[1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [7,5,5,3,3,2,1]
=> ? = 1 - 1
[1,0,1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0,1,0,1,0]
=> [7,6,4,3,3,2,1]
=> ? = 1 - 1
[1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [7,6,5,4,2,2,1]
=> ? = 1 - 1
[1,0,1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> [7,5,5,4,2,2,1]
=> ? = 2 - 1
[1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [7,6,4,4,2,2,1]
=> ? = 2 - 1
[1,0,1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,1,0,0,1,0]
=> [7,5,4,4,2,2,1]
=> ? = 1 - 1
[1,0,1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,0,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0,1,0,1,0]
=> [7,6,5,3,2,2,1]
=> ? = 1 - 1
[1,0,1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,1,0,0,1,0]
=> [7,5,5,3,2,2,1]
=> ? = 2 - 1
[1,0,1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0,1,0,1,0]
=> [7,6,4,3,2,2,1]
=> ? = 1 - 1
[1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> [7,6,5,4,3,1,1]
=> ? = 1 - 1
[1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0]
=> [7,5,5,4,3,1,1]
=> ? = 2 - 1
[1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> [7,6,4,4,3,1,1]
=> ? = 2 - 1
[1,0,1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,1,0,0,1,0]
=> [7,5,4,4,3,1,1]
=> ? = 2 - 1
[1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0,1,0,1,0]
=> [7,6,5,3,3,1,1]
=> ? = 2 - 1
[1,0,1,1,0,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,1,0,0,1,0,1,0]
=> [7,6,4,3,3,1,1]
=> ? = 3 - 1
[1,0,1,1,0,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,1,0,1,0,0,1,0]
=> [7,5,4,3,3,1,1]
=> ? = 1 - 1
[1,0,1,1,0,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [7,6,5,4,2,1,1]
=> ? = 1 - 1
[1,0,1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,1,0,0,1,0]
=> [7,5,5,4,2,1,1]
=> ? = 3 - 1
[1,0,1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0,1,0,1,0]
=> [7,6,4,4,2,1,1]
=> ? = 3 - 1
[1,0,1,1,0,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,1,0,0,1,0]
=> [7,5,4,4,2,1,1]
=> ? = 2 - 1
[1,0,1,1,0,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0,1,0,1,0]
=> [7,6,5,3,2,1,1]
=> ? = 1 - 1
[1,0,1,1,0,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,1,0,0,1,0]
=> [7,5,5,3,2,1,1]
=> ? = 2 - 1
[1,0,1,1,0,1,0,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0,1,0,1,0]
=> [7,6,4,3,2,1,1]
=> ? = 1 - 1
[1,1,0,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [7,5,5,4,3,2]
=> ? = 1 - 1
[1,1,0,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,1,0,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [7,6,4,4,3,2]
=> ? = 2 - 1
[1,1,0,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,0,1,1,0,1,0,0,1,0]
=> [7,5,4,4,3,2]
=> ? = 1 - 1
[1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [7,6,5,3,3,2]
=> ? = 2 - 1
Description
The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple graphs.
Matching statistic: St001785
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
Mp00143: Dyck paths —inverse promotion⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St001785: Integer partitions ⟶ ℤResult quality: 25% ●values known / values provided: 45%●distinct values known / distinct values provided: 25%
Mp00143: Dyck paths —inverse promotion⟶ Dyck paths
Mp00027: Dyck paths —to partition⟶ Integer partitions
St001785: Integer partitions ⟶ ℤResult quality: 25% ●values known / values provided: 45%●distinct values known / distinct values provided: 25%
Values
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [4,3,1,1]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [4,2,2]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,2,1]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,1]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> [5,3,3,1,1]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,1]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0,1,0]
=> [5,2,2,1,1]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,1,1]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0]
=> [5,3,3,2]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0,1,0]
=> [5,4,2,2]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0,1,0]
=> [5,3,2,2]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [5,2,2,2]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> [5,3,3,1]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,0,1,0]
=> [5,3,1,1]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,0,0,1,0]
=> [5,3,3]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> [5,4,2]
=> 0 = 1 - 1
[1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> [1,1,1,0,0,1,1,0,0,0,1,0]
=> [5,2,2]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3,2,1]
=> ? = 1 - 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,2,1]
=> ? = 1 - 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [6,4,4,2,2,1]
=> ? = 1 - 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,2,1]
=> ? = 1 - 1
[1,0,1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,0,1,1,0,1,1,0,0,0,1,0]
=> [6,3,3,2,2,1]
=> 0 = 1 - 1
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> [6,5,2,2,2,1]
=> ? = 1 - 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,1,1]
=> ? = 1 - 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> [6,4,4,3,1,1]
=> ? = 2 - 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3,1,1]
=> ? = 2 - 1
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,1,0,0,1,0]
=> [6,4,3,3,1,1]
=> ? = 1 - 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0,1,0]
=> [6,3,3,3,1,1]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,1,1]
=> ? = 1 - 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0,1,0]
=> [6,4,4,2,1,1]
=> ? = 2 - 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,1,1]
=> ? = 1 - 1
[1,0,1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,0,1,1,0,0,0,1,0]
=> [6,3,3,2,1,1]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0,1,0]
=> [1,1,0,1,1,0,1,1,0,0,0,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0,1,0,1,0]
=> [6,5,2,2,1,1]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0,1,0]
=> [6,4,2,2,1,1]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,1,0,0,0,1,0]
=> [6,3,2,2,1,1]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,1,0,0,0,0]
=> [1,1,0,1,1,0,1,1,1,0,0,0,0,0]
=> [1,0,1,1,0,1,1,1,0,0,0,0,1,0]
=> [6,2,2,2,1,1]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0,1,0]
=> [6,5,4,1,1,1]
=> ? = 1 - 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,1,0,0,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0,1,0]
=> [6,4,4,1,1,1]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,1,1,1,0,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,0,0,1,0,1,0]
=> [6,5,3,1,1,1]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0,1,0]
=> [6,3,3,1,1,1]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0,1,0,1,0]
=> [6,5,2,1,1,1]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,1,1,1,0,0,0,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0,1,0,1,0]
=> [6,5,1,1,1,1]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,1,1,0,0,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,1,0,0,0,1,0]
=> [6,3,1,1,1,1]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0,1,0]
=> [6,4,4,3,2]
=> ? = 1 - 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,1,1,0,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3,2]
=> ? = 2 - 1
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,1,0,1,0,0,1,0]
=> [6,4,3,3,2]
=> ? = 1 - 1
[1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,1,1,0,0,0,1,0]
=> [6,3,3,3,2]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,2]
=> ? = 1 - 1
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0,1,0]
=> [6,4,4,2,2]
=> ? = 2 - 1
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,2]
=> ? = 2 - 1
[1,1,0,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,1,0,0,1,0]
=> [6,4,3,2,2]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,1,0,1,1,0,0,0,0]
=> [1,1,0,0,1,1,0,1,1,0,0,0,1,0]
=> [6,3,3,2,2]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0,1,0]
=> [6,5,2,2,2]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,1,1,0,0,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,1,0,0,1,0]
=> [6,4,2,2,2]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,1,0,0,0,0]
=> [1,1,0,0,1,1,1,0,1,0,0,0,1,0]
=> [6,3,2,2,2]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,1,1,1,0,0,0,0,0]
=> [1,1,0,0,1,1,1,1,0,0,0,0,1,0]
=> [6,2,2,2,2]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,1,0,0,1,0]
=> [6,4,4,3,1]
=> ? = 1 - 1
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3,1]
=> ? = 1 - 1
[1,1,0,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,1,0,0,1,0]
=> [6,4,3,3,1]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,1,0,0,1,1,1,0,0,0,1,0]
=> [6,3,3,3,1]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,1,0,0,1,1,0,0,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0,1,0]
=> [6,4,4,2,1]
=> 0 = 1 - 1
[1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,0,1,1,0,0,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0,1,0]
=> [6,4,2,2,1]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,1,1,0,0,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,0,1,1,0,0,1,0]
=> [6,4,4,1,1]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [1,1,1,0,1,1,0,0,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0,1,0,1,0]
=> [6,5,3,1,1]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,1,0,0,1,0]
=> [6,4,3,1,1]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,1,1,0,0,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0,1,0]
=> [6,3,3,1,1]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,1,0,0,1,0,0,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0,1,0]
=> [6,4,2,1,1]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,1,0,1,1,0,0,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0,1,0]
=> [6,2,2,1,1]
=> 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,1,1,0,0,0,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0,1,0]
=> [6,4,1,1,1]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,1,0,0,1,0]
=> [6,4,4,3]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,1,1,1,0,0,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [7,6,4,4,3,2,1]
=> ? = 1 - 1
[1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [7,6,5,3,3,2,1]
=> ? = 1 - 1
[1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [7,5,5,3,3,2,1]
=> ? = 1 - 1
[1,0,1,0,1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0,1,0,1,0]
=> [7,6,4,3,3,2,1]
=> ? = 1 - 1
[1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [7,6,5,4,2,2,1]
=> ? = 1 - 1
[1,0,1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> [7,5,5,4,2,2,1]
=> ? = 2 - 1
[1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [7,6,4,4,2,2,1]
=> ? = 2 - 1
[1,0,1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,1,0,0,1,0]
=> [7,5,4,4,2,2,1]
=> ? = 1 - 1
[1,0,1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,0,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0,1,0,1,0]
=> [7,6,5,3,2,2,1]
=> ? = 1 - 1
[1,0,1,0,1,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,1,0,0,1,0]
=> [7,5,5,3,2,2,1]
=> ? = 2 - 1
[1,0,1,0,1,1,0,1,0,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0,1,0,1,0]
=> [7,6,4,3,2,2,1]
=> ? = 1 - 1
[1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> [7,6,5,4,3,1,1]
=> ? = 1 - 1
[1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0]
=> [7,5,5,4,3,1,1]
=> ? = 2 - 1
[1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> [7,6,4,4,3,1,1]
=> ? = 2 - 1
[1,0,1,1,0,0,1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,1,0,0,1,0]
=> [7,5,4,4,3,1,1]
=> ? = 2 - 1
[1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,0,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0,1,0,1,0]
=> [7,6,5,3,3,1,1]
=> ? = 2 - 1
[1,0,1,1,0,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,1,0,0,1,0,1,0]
=> [7,6,4,3,3,1,1]
=> ? = 3 - 1
[1,0,1,1,0,0,1,1,0,1,0,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,1,0,1,0,0,1,0]
=> [7,5,4,3,3,1,1]
=> ? = 1 - 1
[1,0,1,1,0,1,0,0,1,0,1,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [7,6,5,4,2,1,1]
=> ? = 1 - 1
[1,0,1,1,0,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,0,1,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,1,0,0,1,0]
=> [7,5,5,4,2,1,1]
=> ? = 3 - 1
[1,0,1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0,1,0,1,0]
=> [7,6,4,4,2,1,1]
=> ? = 3 - 1
[1,0,1,1,0,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,1,0,1,0,0,1,0]
=> [7,5,4,4,2,1,1]
=> ? = 2 - 1
[1,0,1,1,0,1,0,1,0,0,1,0,1,0]
=> [1,1,0,1,1,0,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0,1,0,1,0]
=> [7,6,5,3,2,1,1]
=> ? = 1 - 1
[1,0,1,1,0,1,0,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,1,0,0,1,0]
=> [7,5,5,3,2,1,1]
=> ? = 2 - 1
[1,0,1,1,0,1,0,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0,1,0,1,0]
=> [7,6,4,3,2,1,1]
=> ? = 1 - 1
[1,1,0,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,0,1,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [7,5,5,4,3,2]
=> ? = 1 - 1
[1,1,0,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,1,0,1,1,0,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [7,6,4,4,3,2]
=> ? = 2 - 1
[1,1,0,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,1,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,0,1,0,1,1,0,1,0,0,1,0]
=> [7,5,4,4,3,2]
=> ? = 1 - 1
[1,1,0,0,1,0,1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [7,6,5,3,3,2]
=> ? = 2 - 1
Description
The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition.
Given a partition $\lambda\vdash n$, let $\alpha(\lambda)$ be the partition given by the lengths of the antidiagonals of the Ferrers diagram of $\lambda$. Then, the value of the statistic on $\mu$ is the number of times $\mu$ appears in the multiset $\{\{\alpha(\lambda)\mid \lambda\vdash n\}\}$.
Matching statistic: St001696
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00027: Dyck paths —to partition⟶ Integer partitions
Mp00312: Integer partitions —Glaisher-Franklin⟶ Integer partitions
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
St001696: Standard tableaux ⟶ ℤResult quality: 25% ●values known / values provided: 45%●distinct values known / distinct values provided: 25%
Mp00312: Integer partitions —Glaisher-Franklin⟶ Integer partitions
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
St001696: Standard tableaux ⟶ ℤResult quality: 25% ●values known / values provided: 45%●distinct values known / distinct values provided: 25%
Values
[1,0,1,1,0,0,1,0]
=> [3,1,1]
=> [3,2]
=> [[1,2,3],[4,5]]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0]
=> [2,2]
=> [1,1,1,1]
=> [[1],[2],[3],[4]]
=> 0 = 1 - 1
[1,0,1,0,1,1,0,0,1,0]
=> [4,2,2,1]
=> [2,2,1,1,1,1,1]
=> [[1,2],[3,4],[5],[6],[7],[8],[9]]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,0,1,0]
=> [4,3,1,1]
=> [3,2,2,2]
=> [[1,2,3],[4,5],[6,7],[8,9]]
=> 0 = 1 - 1
[1,0,1,1,0,0,1,1,0,0]
=> [3,3,1,1]
=> [6,2]
=> [[1,2,3,4,5,6],[7,8]]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,0,1,0]
=> [4,2,1,1]
=> [2,2,2,1,1]
=> [[1,2],[3,4],[5,6],[7],[8]]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,2,1,1]
=> [2,1,1,1,1]
=> [[1,2],[3],[4],[5],[6]]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0]
=> [4,1,1,1]
=> [2,2,2,1]
=> [[1,2],[3,4],[5,6],[7]]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,1,0,0]
=> [3,3,2]
=> [6,1,1]
=> [[1,2,3,4,5,6],[7],[8]]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,0,1,0]
=> [4,2,2]
=> [2,2,1,1,1,1]
=> [[1,2],[3,4],[5],[6],[7],[8]]
=> 0 = 1 - 1
[1,1,0,0,1,1,0,1,0,0]
=> [3,2,2]
=> [3,1,1,1,1]
=> [[1,2,3],[4],[5],[6],[7]]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> [1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,3,1]
=> [6,1]
=> [[1,2,3,4,5,6],[7]]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,1]
=> [3,2]
=> [[1,2,3],[4,5]]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> [6]
=> [[1,2,3,4,5,6]]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0,1,0]
=> [4,2]
=> [2,2,1,1]
=> [[1,2],[3,4],[5],[6]]
=> 0 = 1 - 1
[1,1,1,0,0,1,1,0,0,0]
=> [2,2]
=> [1,1,1,1]
=> [[1],[2],[3],[4]]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [5,3,3,2,1]
=> [6,5,1,1,1]
=> [[1,2,3,4,5,6],[7,8,9,10,11],[12],[13],[14]]
=> ? = 1 - 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,2,1]
=> [5,2,2,1,1,1,1,1]
=> [[1,2,3,4,5],[6,7],[8,9],[10],[11],[12],[13],[14]]
=> ? = 1 - 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [4,4,2,2,1]
=> [2,2,2,2,1,1,1,1,1]
=> [[1,2],[3,4],[5,6],[7,8],[9],[10],[11],[12],[13]]
=> ? = 1 - 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,2,1]
=> [5,3,1,1,1,1,1]
=> [[1,2,3,4,5],[6,7,8],[9],[10],[11],[12],[13]]
=> ? = 1 - 1
[1,0,1,0,1,1,0,1,1,0,0,0]
=> [3,3,2,2,1]
=> [6,1,1,1,1,1]
=> [[1,2,3,4,5,6],[7],[8],[9],[10],[11]]
=> ? = 1 - 1
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [5,2,2,2,1]
=> [5,1,1,1,1,1,1,1]
=> [[1,2,3,4,5],[6],[7],[8],[9],[10],[11],[12]]
=> ? = 1 - 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,1]
=> [5,3,2,2,2]
=> [[1,2,3,4,5],[6,7,8],[9,10],[11,12],[13,14]]
=> ? = 1 - 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [4,4,3,1,1]
=> [3,2,2,2,2,2]
=> [[1,2,3],[4,5],[6,7],[8,9],[10,11],[12,13]]
=> ? = 2 - 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [5,3,3,1,1]
=> [6,5,2]
=> [[1,2,3,4,5,6],[7,8,9,10,11],[12,13]]
=> ? = 2 - 1
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [4,3,3,1,1]
=> [6,2,2,2]
=> [[1,2,3,4,5,6],[7,8],[9,10],[11,12]]
=> ? = 1 - 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [3,3,3,1,1]
=> [6,3,2]
=> [[1,2,3,4,5,6],[7,8,9],[10,11]]
=> ? = 1 - 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,1]
=> [5,2,2,2,1,1]
=> [[1,2,3,4,5],[6,7],[8,9],[10,11],[12],[13]]
=> ? = 1 - 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [4,4,2,1,1]
=> [2,2,2,2,2,1,1]
=> [[1,2],[3,4],[5,6],[7,8],[9,10],[11],[12]]
=> ? = 2 - 1
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,1]
=> [5,3,2,1,1]
=> [[1,2,3,4,5],[6,7,8],[9,10],[11],[12]]
=> 0 = 1 - 1
[1,0,1,1,0,1,0,1,1,0,0,0]
=> [3,3,2,1,1]
=> [6,2,1,1]
=> [[1,2,3,4,5,6],[7,8],[9],[10]]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,0,0,1,0]
=> [5,2,2,1,1]
=> [5,2,1,1,1,1]
=> [[1,2,3,4,5],[6,7],[8],[9],[10],[11]]
=> ? = 1 - 1
[1,0,1,1,0,1,1,0,0,1,0,0]
=> [4,2,2,1,1]
=> [2,2,2,1,1,1,1]
=> [[1,2],[3,4],[5,6],[7],[8],[9],[10]]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,0,1,0,0,0]
=> [3,2,2,1,1]
=> [3,2,1,1,1,1]
=> [[1,2,3],[4,5],[6],[7],[8],[9]]
=> 0 = 1 - 1
[1,0,1,1,0,1,1,1,0,0,0,0]
=> [2,2,2,1,1]
=> [2,1,1,1,1,1,1]
=> [[1,2],[3],[4],[5],[6],[7],[8]]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,1,1]
=> [5,2,2,2,1]
=> [[1,2,3,4,5],[6,7],[8,9],[10,11],[12]]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [4,4,1,1,1]
=> [2,2,2,2,2,1]
=> [[1,2],[3,4],[5,6],[7,8],[9,10],[11]]
=> ? = 1 - 1
[1,0,1,1,1,0,0,1,0,0,1,0]
=> [5,3,1,1,1]
=> [5,3,2,1]
=> [[1,2,3,4,5],[6,7,8],[9,10],[11]]
=> 0 = 1 - 1
[1,0,1,1,1,0,0,1,1,0,0,0]
=> [3,3,1,1,1]
=> [6,2,1]
=> [[1,2,3,4,5,6],[7,8],[9]]
=> 0 = 1 - 1
[1,0,1,1,1,0,1,0,0,0,1,0]
=> [5,2,1,1,1]
=> [5,2,1,1,1]
=> [[1,2,3,4,5],[6,7],[8],[9],[10]]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [5,1,1,1,1]
=> [5,4]
=> [[1,2,3,4,5],[6,7,8,9]]
=> 0 = 1 - 1
[1,0,1,1,1,1,0,0,1,0,0,0]
=> [3,1,1,1,1]
=> [4,3]
=> [[1,2,3,4],[5,6,7]]
=> 0 = 1 - 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [4,4,3,2]
=> [3,2,2,2,2,1,1]
=> [[1,2,3],[4,5],[6,7],[8,9],[10,11],[12],[13]]
=> ? = 1 - 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [5,3,3,2]
=> [6,5,1,1]
=> [[1,2,3,4,5,6],[7,8,9,10,11],[12],[13]]
=> ? = 2 - 1
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [4,3,3,2]
=> [6,2,2,1,1]
=> [[1,2,3,4,5,6],[7,8],[9,10],[11],[12]]
=> ? = 1 - 1
[1,1,0,0,1,0,1,1,1,0,0,0]
=> [3,3,3,2]
=> [6,3,1,1]
=> [[1,2,3,4,5,6],[7,8,9],[10],[11]]
=> ? = 1 - 1
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [5,4,2,2]
=> [5,2,2,1,1,1,1]
=> [[1,2,3,4,5],[6,7],[8,9],[10],[11],[12],[13]]
=> ? = 1 - 1
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [4,4,2,2]
=> [2,2,2,2,1,1,1,1]
=> [[1,2],[3,4],[5,6],[7,8],[9],[10],[11],[12]]
=> ? = 2 - 1
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [5,3,2,2]
=> [5,3,1,1,1,1]
=> [[1,2,3,4,5],[6,7,8],[9],[10],[11],[12]]
=> ? = 2 - 1
[1,1,0,0,1,1,0,1,0,1,0,0]
=> [4,3,2,2]
=> [3,2,2,1,1,1,1]
=> [[1,2,3],[4,5],[6,7],[8],[9],[10],[11]]
=> ? = 1 - 1
[1,1,0,0,1,1,0,1,1,0,0,0]
=> [3,3,2,2]
=> [6,1,1,1,1]
=> [[1,2,3,4,5,6],[7],[8],[9],[10]]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [5,2,2,2]
=> [5,1,1,1,1,1,1]
=> [[1,2,3,4,5],[6],[7],[8],[9],[10],[11]]
=> ? = 1 - 1
[1,1,0,0,1,1,1,0,0,1,0,0]
=> [4,2,2,2]
=> [2,2,1,1,1,1,1,1]
=> [[1,2],[3,4],[5],[6],[7],[8],[9],[10]]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,0,1,0,0,0]
=> [3,2,2,2]
=> [3,1,1,1,1,1,1]
=> [[1,2,3],[4],[5],[6],[7],[8],[9]]
=> 0 = 1 - 1
[1,1,0,0,1,1,1,1,0,0,0,0]
=> [2,2,2,2]
=> [1,1,1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6],[7],[8]]
=> 0 = 1 - 1
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [4,4,3,1]
=> [3,2,2,2,2,1]
=> [[1,2,3],[4,5],[6,7],[8,9],[10,11],[12]]
=> ? = 1 - 1
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [5,3,3,1]
=> [6,5,1]
=> [[1,2,3,4,5,6],[7,8,9,10,11],[12]]
=> ? = 1 - 1
[1,1,0,1,0,0,1,1,0,1,0,0]
=> [4,3,3,1]
=> [6,2,2,1]
=> [[1,2,3,4,5,6],[7,8],[9,10],[11]]
=> ? = 1 - 1
[1,1,0,1,0,0,1,1,1,0,0,0]
=> [3,3,3,1]
=> [6,3,1]
=> [[1,2,3,4,5,6],[7,8,9],[10]]
=> 0 = 1 - 1
[1,1,0,1,0,1,0,0,1,1,0,0]
=> [4,4,2,1]
=> [2,2,2,2,1,1,1]
=> [[1,2],[3,4],[5,6],[7,8],[9],[10],[11]]
=> ? = 1 - 1
[1,1,0,1,0,1,1,0,0,1,0,0]
=> [4,2,2,1]
=> [2,2,1,1,1,1,1]
=> [[1,2],[3,4],[5],[6],[7],[8],[9]]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,0,1,1,0,0]
=> [4,4,1,1]
=> [2,2,2,2,2]
=> [[1,2],[3,4],[5,6],[7,8],[9,10]]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [5,3,1,1]
=> [5,3,2]
=> [[1,2,3,4,5],[6,7,8],[9,10]]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,0,1,0,0]
=> [4,3,1,1]
=> [3,2,2,2]
=> [[1,2,3],[4,5],[6,7],[8,9]]
=> 0 = 1 - 1
[1,1,0,1,1,0,0,1,1,0,0,0]
=> [3,3,1,1]
=> [6,2]
=> [[1,2,3,4,5,6],[7,8]]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,0,0,1,0,0]
=> [4,2,1,1]
=> [2,2,2,1,1]
=> [[1,2],[3,4],[5,6],[7],[8]]
=> 0 = 1 - 1
[1,1,0,1,1,0,1,1,0,0,0,0]
=> [2,2,1,1]
=> [2,1,1,1,1]
=> [[1,2],[3],[4],[5],[6]]
=> 0 = 1 - 1
[1,1,0,1,1,1,0,0,0,1,0,0]
=> [4,1,1,1]
=> [2,2,2,1]
=> [[1,2],[3,4],[5,6],[7]]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> [4,4,3]
=> [3,2,2,2,2]
=> [[1,2,3],[4,5],[6,7],[8,9],[10,11]]
=> ? = 1 - 1
[1,1,1,0,0,0,1,1,0,0,1,0]
=> [5,3,3]
=> [6,5]
=> [[1,2,3,4,5,6],[7,8,9,10,11]]
=> ? = 1 - 1
[1,1,1,0,0,0,1,1,0,1,0,0]
=> [4,3,3]
=> [6,2,2]
=> [[1,2,3,4,5,6],[7,8],[9,10]]
=> 0 = 1 - 1
[1,1,1,0,0,0,1,1,1,0,0,0]
=> [3,3,3]
=> [6,3]
=> [[1,2,3,4,5,6],[7,8,9]]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0,1,0,1,0]
=> [5,4,2]
=> [5,2,2,1,1]
=> [[1,2,3,4,5],[6,7],[8,9],[10],[11]]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,0,1,1,0,0]
=> [4,4,2]
=> [2,2,2,2,1,1]
=> [[1,2],[3,4],[5,6],[7,8],[9],[10]]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,1,0,0,1,0]
=> [5,3,2]
=> [5,3,1,1]
=> [[1,2,3,4,5],[6,7,8],[9],[10]]
=> 0 = 1 - 1
[1,1,1,0,0,1,0,1,1,0,0,0]
=> [3,3,2]
=> [6,1,1]
=> [[1,2,3,4,5,6],[7],[8]]
=> 0 = 1 - 1
[1,1,1,0,0,1,1,0,0,0,1,0]
=> [5,2,2]
=> [5,1,1,1,1]
=> [[1,2,3,4,5],[6],[7],[8],[9]]
=> 0 = 1 - 1
[1,1,1,0,0,1,1,0,0,1,0,0]
=> [4,2,2]
=> [2,2,1,1,1,1]
=> [[1,2],[3,4],[5],[6],[7],[8]]
=> 0 = 1 - 1
[1,1,1,0,0,1,1,0,1,0,0,0]
=> [3,2,2]
=> [3,1,1,1,1]
=> [[1,2,3],[4],[5],[6],[7]]
=> 0 = 1 - 1
[1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [6,4,4,3,2,1]
=> ?
=> ?
=> ? = 1 - 1
[1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3,2,1]
=> ?
=> ?
=> ? = 1 - 1
[1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> [5,5,3,3,2,1]
=> ?
=> ?
=> ? = 1 - 1
[1,0,1,0,1,0,1,1,0,1,0,0,1,0]
=> [6,4,3,3,2,1]
=> ?
=> ?
=> ? = 1 - 1
[1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,2,1]
=> ?
=> ?
=> ? = 1 - 1
[1,0,1,0,1,1,0,0,1,0,1,1,0,0]
=> [5,5,4,2,2,1]
=> ?
=> ?
=> ? = 2 - 1
[1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [6,4,4,2,2,1]
=> ?
=> ?
=> ? = 2 - 1
[1,0,1,0,1,1,0,0,1,1,0,1,0,0]
=> [5,4,4,2,2,1]
=> ?
=> ?
=> ? = 1 - 1
[1,0,1,0,1,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,2,1]
=> ?
=> ?
=> ? = 1 - 1
[1,0,1,0,1,1,0,1,0,0,1,1,0,0]
=> [5,5,3,2,2,1]
=> ?
=> ?
=> ? = 2 - 1
[1,0,1,0,1,1,0,1,0,1,0,0,1,0]
=> [6,4,3,2,2,1]
=> ?
=> ?
=> ? = 1 - 1
[1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,1,1]
=> ?
=> ?
=> ? = 1 - 1
[1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> [5,5,4,3,1,1]
=> ?
=> ?
=> ? = 2 - 1
[1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> [6,4,4,3,1,1]
=> ?
=> ?
=> ? = 2 - 1
[1,0,1,1,0,0,1,0,1,1,0,1,0,0]
=> [5,4,4,3,1,1]
=> ?
=> ?
=> ? = 2 - 1
[1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3,1,1]
=> ?
=> ?
=> ? = 2 - 1
[1,0,1,1,0,0,1,1,0,1,0,0,1,0]
=> [6,4,3,3,1,1]
=> ?
=> ?
=> ? = 3 - 1
[1,0,1,1,0,0,1,1,0,1,0,1,0,0]
=> [5,4,3,3,1,1]
=> [6,5,2,2,2]
=> [[1,2,3,4,5,6],[7,8,9,10,11],[12,13],[14,15],[16,17]]
=> ? = 1 - 1
[1,0,1,1,0,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,1,1]
=> ?
=> ?
=> ? = 1 - 1
[1,0,1,1,0,1,0,0,1,0,1,1,0,0]
=> [5,5,4,2,1,1]
=> ?
=> ?
=> ? = 3 - 1
Description
The natural major index of a standard Young tableau.
A natural descent of a standard tableau $T$ is an entry $i$ such that $i+1$ appears in a higher row than $i$ in English notation.
The natural major index of a tableau with natural descent set $D$ is then $\sum_{d\in D} d$.
Matching statistic: St000068
(load all 11 compositions to match this statistic)
(load all 11 compositions to match this statistic)
Mp00027: Dyck paths —to partition⟶ Integer partitions
Mp00179: Integer partitions —to skew partition⟶ Skew partitions
Mp00185: Skew partitions —cell poset⟶ Posets
St000068: Posets ⟶ ℤResult quality: 25% ●values known / values provided: 42%●distinct values known / distinct values provided: 25%
Mp00179: Integer partitions —to skew partition⟶ Skew partitions
Mp00185: Skew partitions —cell poset⟶ Posets
St000068: Posets ⟶ ℤResult quality: 25% ●values known / values provided: 42%●distinct values known / distinct values provided: 25%
Values
[1,0,1,1,0,0,1,0]
=> [3,1,1]
=> [[3,1,1],[]]
=> ([(0,3),(0,4),(3,2),(4,1)],5)
=> 1
[1,1,0,0,1,1,0,0]
=> [2,2]
=> [[2,2],[]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [4,2,2,1]
=> [[4,2,2,1],[]]
=> ([(0,5),(0,6),(3,1),(4,2),(4,8),(5,3),(5,7),(6,4),(6,7),(7,8)],9)
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [4,3,1,1]
=> [[4,3,1,1],[]]
=> ([(0,5),(0,6),(3,1),(4,2),(4,8),(5,3),(5,7),(6,4),(6,7),(7,8)],9)
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [3,3,1,1]
=> [[3,3,1,1],[]]
=> ([(0,4),(0,5),(1,7),(3,2),(4,3),(4,6),(5,1),(5,6),(6,7)],8)
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [4,2,1,1]
=> [[4,2,1,1],[]]
=> ([(0,5),(0,6),(3,2),(4,1),(5,3),(5,7),(6,4),(6,7)],8)
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,2,1,1]
=> [[2,2,1,1],[]]
=> ([(0,2),(0,4),(2,5),(3,1),(4,3),(4,5)],6)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [4,1,1,1]
=> [[4,1,1,1],[]]
=> ([(0,5),(0,6),(3,2),(4,1),(5,3),(6,4)],7)
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [3,3,2]
=> [[3,3,2],[]]
=> ([(0,3),(0,4),(1,7),(2,6),(3,2),(3,5),(4,1),(4,5),(5,6),(5,7)],8)
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [4,2,2]
=> [[4,2,2],[]]
=> ([(0,4),(0,5),(1,7),(3,2),(4,3),(4,6),(5,1),(5,6),(6,7)],8)
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [3,2,2]
=> [[3,2,2],[]]
=> ([(0,3),(0,4),(2,6),(3,1),(3,5),(4,2),(4,5),(5,6)],7)
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,3,1]
=> [[3,3,1],[]]
=> ([(0,3),(0,4),(2,6),(3,1),(3,5),(4,2),(4,5),(5,6)],7)
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,1]
=> [[3,1,1],[]]
=> ([(0,3),(0,4),(3,2),(4,1)],5)
=> 1
[1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> [[3,3],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 1
[1,1,1,0,0,1,0,0,1,0]
=> [4,2]
=> [[4,2],[]]
=> ([(0,2),(0,4),(2,5),(3,1),(4,3),(4,5)],6)
=> 1
[1,1,1,0,0,1,1,0,0,0]
=> [2,2]
=> [[2,2],[]]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [5,3,3,2,1]
=> [[5,3,3,2,1],[]]
=> ([(0,7),(0,8),(3,2),(4,6),(4,12),(5,3),(5,11),(6,1),(6,10),(7,4),(7,9),(8,5),(8,9),(9,11),(9,12),(11,13),(12,10),(12,13)],14)
=> ? = 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,2,1]
=> [[5,4,2,2,1],[]]
=> ([(0,7),(0,8),(3,5),(3,12),(4,6),(4,13),(5,2),(5,10),(6,1),(6,11),(7,3),(7,9),(8,4),(8,9),(9,12),(9,13),(12,10),(13,11)],14)
=> ? = 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [4,4,2,2,1]
=> [[4,4,2,2,1],[]]
=> ([(0,6),(0,7),(2,10),(3,5),(3,11),(4,2),(4,12),(5,1),(5,9),(6,3),(6,8),(7,4),(7,8),(8,11),(8,12),(11,9),(12,10)],13)
=> ? = 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,2,1]
=> [[5,3,2,2,1],[]]
=> ([(0,7),(0,8),(3,2),(4,6),(4,12),(5,3),(5,11),(6,1),(6,10),(7,4),(7,9),(8,5),(8,9),(9,11),(9,12),(12,10)],13)
=> ? = 1
[1,0,1,0,1,1,0,1,1,0,0,0]
=> [3,3,2,2,1]
=> [[3,3,2,2,1],[]]
=> ([(0,5),(0,6),(2,9),(3,4),(3,10),(4,1),(4,8),(5,3),(5,7),(6,2),(6,7),(7,9),(7,10),(10,8)],11)
=> ? = 1
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [5,2,2,2,1]
=> [[5,2,2,2,1],[]]
=> ([(0,7),(0,8),(3,4),(4,2),(5,6),(5,11),(6,1),(6,10),(7,3),(7,9),(8,5),(8,9),(9,11),(11,10)],12)
=> ? = 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,1]
=> [[5,4,3,1,1],[]]
=> ([(0,7),(0,8),(3,2),(4,6),(4,12),(5,3),(5,11),(6,1),(6,10),(7,4),(7,9),(8,5),(8,9),(9,11),(9,12),(11,13),(12,10),(12,13)],14)
=> ? = 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [4,4,3,1,1]
=> [[4,4,3,1,1],[]]
=> ([(0,6),(0,7),(2,9),(3,1),(4,3),(4,10),(5,2),(5,11),(6,4),(6,8),(7,5),(7,8),(8,10),(8,11),(10,12),(11,9),(11,12)],13)
=> ? = 2
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [5,3,3,1,1]
=> [[5,3,3,1,1],[]]
=> ([(0,7),(0,8),(3,2),(4,1),(5,3),(5,10),(6,4),(6,11),(7,5),(7,9),(8,6),(8,9),(9,10),(9,11),(10,12),(11,12)],13)
=> ? = 2
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [4,3,3,1,1]
=> [[4,3,3,1,1],[]]
=> ([(0,6),(0,7),(3,2),(4,3),(4,9),(5,1),(5,10),(6,4),(6,8),(7,5),(7,8),(8,9),(8,10),(9,11),(10,11)],12)
=> ? = 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [3,3,3,1,1]
=> [[3,3,3,1,1],[]]
=> ([(0,5),(0,6),(2,9),(3,1),(4,3),(4,8),(5,4),(5,7),(6,2),(6,7),(7,8),(7,9),(8,10),(9,10)],11)
=> ? = 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,1]
=> [[5,4,2,1,1],[]]
=> ([(0,7),(0,8),(3,2),(4,6),(4,12),(5,3),(5,11),(6,1),(6,10),(7,4),(7,9),(8,5),(8,9),(9,11),(9,12),(12,10)],13)
=> ? = 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [4,4,2,1,1]
=> [[4,4,2,1,1],[]]
=> ([(0,6),(0,7),(2,9),(3,1),(4,3),(4,10),(5,2),(5,11),(6,4),(6,8),(7,5),(7,8),(8,10),(8,11),(11,9)],12)
=> ? = 2
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,1]
=> [[5,3,2,1,1],[]]
=> ([(0,7),(0,8),(3,2),(4,1),(5,3),(5,10),(6,4),(6,11),(7,5),(7,9),(8,6),(8,9),(9,10),(9,11)],12)
=> ? = 1
[1,0,1,1,0,1,0,1,1,0,0,0]
=> [3,3,2,1,1]
=> [[3,3,2,1,1],[]]
=> ([(0,5),(0,6),(2,9),(3,1),(4,3),(4,8),(5,4),(5,7),(6,2),(6,7),(7,8),(7,9)],10)
=> 1
[1,0,1,1,0,1,1,0,0,0,1,0]
=> [5,2,2,1,1]
=> [[5,2,2,1,1],[]]
=> ([(0,7),(0,8),(3,5),(4,6),(4,10),(5,1),(6,2),(7,3),(7,9),(8,4),(8,9),(9,10)],11)
=> ? = 1
[1,0,1,1,0,1,1,0,0,1,0,0]
=> [4,2,2,1,1]
=> [[4,2,2,1,1],[]]
=> ([(0,6),(0,7),(3,4),(3,9),(4,1),(5,2),(6,5),(6,8),(7,3),(7,8),(8,9)],10)
=> 1
[1,0,1,1,0,1,1,0,1,0,0,0]
=> [3,2,2,1,1]
=> [[3,2,2,1,1],[]]
=> ([(0,5),(0,6),(3,4),(3,8),(4,2),(5,3),(5,7),(6,1),(6,7),(7,8)],9)
=> 1
[1,0,1,1,0,1,1,1,0,0,0,0]
=> [2,2,2,1,1]
=> [[2,2,2,1,1],[]]
=> ([(0,2),(0,5),(2,6),(3,4),(3,7),(4,1),(5,3),(5,6),(6,7)],8)
=> 1
[1,0,1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,1,1]
=> [[5,4,1,1,1],[]]
=> ([(0,7),(0,8),(3,4),(4,2),(5,6),(5,11),(6,1),(6,10),(7,3),(7,9),(8,5),(8,9),(9,11),(11,10)],12)
=> ? = 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [4,4,1,1,1]
=> [[4,4,1,1,1],[]]
=> ([(0,6),(0,7),(2,9),(3,4),(4,1),(5,2),(5,10),(6,3),(6,8),(7,5),(7,8),(8,10),(10,9)],11)
=> ? = 1
[1,0,1,1,1,0,0,1,0,0,1,0]
=> [5,3,1,1,1]
=> [[5,3,1,1,1],[]]
=> ([(0,7),(0,8),(3,5),(4,6),(4,10),(5,1),(6,2),(7,3),(7,9),(8,4),(8,9),(9,10)],11)
=> ? = 1
[1,0,1,1,1,0,0,1,1,0,0,0]
=> [3,3,1,1,1]
=> [[3,3,1,1,1],[]]
=> ([(0,5),(0,6),(2,8),(3,4),(4,1),(5,3),(5,7),(6,2),(6,7),(7,8)],9)
=> 1
[1,0,1,1,1,0,1,0,0,0,1,0]
=> [5,2,1,1,1]
=> [[5,2,1,1,1],[]]
=> ([(0,7),(0,8),(3,5),(4,6),(5,2),(6,1),(7,3),(7,9),(8,4),(8,9)],10)
=> 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [5,1,1,1,1]
=> [[5,1,1,1,1],[]]
=> ([(0,7),(0,8),(3,5),(4,6),(5,2),(6,1),(7,3),(8,4)],9)
=> 1
[1,0,1,1,1,1,0,0,1,0,0,0]
=> [3,1,1,1,1]
=> [[3,1,1,1,1],[]]
=> ([(0,5),(0,6),(3,4),(4,2),(5,3),(6,1)],7)
=> 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [4,4,3,2]
=> [[4,4,3,2],[]]
=> ([(0,5),(0,6),(1,9),(2,8),(3,2),(3,10),(4,1),(4,11),(5,3),(5,7),(6,4),(6,7),(7,10),(7,11),(10,8),(10,12),(11,9),(11,12)],13)
=> ? = 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [5,3,3,2]
=> [[5,3,3,2],[]]
=> ([(0,6),(0,7),(2,9),(3,1),(4,3),(4,10),(5,2),(5,11),(6,4),(6,8),(7,5),(7,8),(8,10),(8,11),(10,12),(11,9),(11,12)],13)
=> ? = 2
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [4,3,3,2]
=> [[4,3,3,2],[]]
=> ([(0,5),(0,6),(2,8),(3,2),(3,10),(4,1),(4,9),(5,3),(5,7),(6,4),(6,7),(7,9),(7,10),(9,11),(10,8),(10,11)],12)
=> ? = 1
[1,1,0,0,1,0,1,1,1,0,0,0]
=> [3,3,3,2]
=> [[3,3,3,2],[]]
=> ([(0,4),(0,5),(1,8),(2,7),(3,2),(3,9),(4,3),(4,6),(5,1),(5,6),(6,8),(6,9),(8,10),(9,7),(9,10)],11)
=> ? = 1
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [5,4,2,2]
=> [[5,4,2,2],[]]
=> ([(0,6),(0,7),(2,10),(3,5),(3,11),(4,2),(4,12),(5,1),(5,9),(6,3),(6,8),(7,4),(7,8),(8,11),(8,12),(11,9),(12,10)],13)
=> ? = 1
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [4,4,2,2]
=> [[4,4,2,2],[]]
=> ([(0,5),(0,6),(1,9),(2,8),(3,2),(3,10),(4,1),(4,11),(5,3),(5,7),(6,4),(6,7),(7,10),(7,11),(10,8),(11,9)],12)
=> ? = 2
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [5,3,2,2]
=> [[5,3,2,2],[]]
=> ([(0,6),(0,7),(2,9),(3,1),(4,3),(4,10),(5,2),(5,11),(6,4),(6,8),(7,5),(7,8),(8,10),(8,11),(11,9)],12)
=> ? = 2
[1,1,0,0,1,1,0,1,0,1,0,0]
=> [4,3,2,2]
=> [[4,3,2,2],[]]
=> ([(0,5),(0,6),(2,8),(3,2),(3,10),(4,1),(4,9),(5,3),(5,7),(6,4),(6,7),(7,9),(7,10),(10,8)],11)
=> ? = 1
[1,1,0,0,1,1,0,1,1,0,0,0]
=> [3,3,2,2]
=> [[3,3,2,2],[]]
=> ([(0,4),(0,5),(1,8),(2,7),(3,2),(3,9),(4,3),(4,6),(5,1),(5,6),(6,8),(6,9),(9,7)],10)
=> 1
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [5,2,2,2]
=> [[5,2,2,2],[]]
=> ([(0,6),(0,7),(2,9),(3,4),(4,1),(5,2),(5,10),(6,3),(6,8),(7,5),(7,8),(8,10),(10,9)],11)
=> ? = 1
[1,1,0,0,1,1,1,0,0,1,0,0]
=> [4,2,2,2]
=> [[4,2,2,2],[]]
=> ([(0,5),(0,6),(2,8),(3,1),(4,2),(4,9),(5,3),(5,7),(6,4),(6,7),(7,9),(9,8)],10)
=> 1
[1,1,0,0,1,1,1,0,1,0,0,0]
=> [3,2,2,2]
=> [[3,2,2,2],[]]
=> ([(0,4),(0,5),(2,7),(3,2),(3,8),(4,3),(4,6),(5,1),(5,6),(6,8),(8,7)],9)
=> 1
[1,1,0,0,1,1,1,1,0,0,0,0]
=> [2,2,2,2]
=> [[2,2,2,2],[]]
=> ([(0,2),(0,4),(1,6),(2,5),(3,1),(3,7),(4,3),(4,5),(5,7),(7,6)],8)
=> 1
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [4,4,3,1]
=> [[4,4,3,1],[]]
=> ([(0,5),(0,6),(2,8),(3,2),(3,10),(4,1),(4,9),(5,3),(5,7),(6,4),(6,7),(7,9),(7,10),(9,11),(10,8),(10,11)],12)
=> ? = 1
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [5,3,3,1]
=> [[5,3,3,1],[]]
=> ([(0,6),(0,7),(3,2),(4,3),(4,9),(5,1),(5,10),(6,4),(6,8),(7,5),(7,8),(8,9),(8,10),(9,11),(10,11)],12)
=> ? = 1
[1,1,0,1,0,0,1,1,0,1,0,0]
=> [4,3,3,1]
=> [[4,3,3,1],[]]
=> ([(0,5),(0,6),(3,2),(3,8),(4,1),(4,9),(5,3),(5,7),(6,4),(6,7),(7,8),(7,9),(8,10),(9,10)],11)
=> ? = 1
[1,1,0,1,0,0,1,1,1,0,0,0]
=> [3,3,3,1]
=> [[3,3,3,1],[]]
=> ([(0,4),(0,5),(2,7),(3,1),(3,8),(4,2),(4,6),(5,3),(5,6),(6,7),(6,8),(7,9),(8,9)],10)
=> 1
[1,1,0,1,0,1,0,0,1,1,0,0]
=> [4,4,2,1]
=> [[4,4,2,1],[]]
=> ([(0,5),(0,6),(2,8),(3,2),(3,10),(4,1),(4,9),(5,3),(5,7),(6,4),(6,7),(7,9),(7,10),(10,8)],11)
=> ? = 1
[1,1,0,1,0,1,1,0,0,1,0,0]
=> [4,2,2,1]
=> [[4,2,2,1],[]]
=> ([(0,5),(0,6),(3,1),(4,2),(4,8),(5,3),(5,7),(6,4),(6,7),(7,8)],9)
=> 1
[1,1,0,1,1,0,0,0,1,1,0,0]
=> [4,4,1,1]
=> [[4,4,1,1],[]]
=> ([(0,5),(0,6),(2,8),(3,1),(4,2),(4,9),(5,3),(5,7),(6,4),(6,7),(7,9),(9,8)],10)
=> 1
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [5,3,1,1]
=> [[5,3,1,1],[]]
=> ([(0,6),(0,7),(3,4),(3,9),(4,1),(5,2),(6,5),(6,8),(7,3),(7,8),(8,9)],10)
=> 1
[1,1,0,1,1,0,0,1,0,1,0,0]
=> [4,3,1,1]
=> [[4,3,1,1],[]]
=> ([(0,5),(0,6),(3,1),(4,2),(4,8),(5,3),(5,7),(6,4),(6,7),(7,8)],9)
=> 1
[1,1,0,1,1,0,0,1,1,0,0,0]
=> [3,3,1,1]
=> [[3,3,1,1],[]]
=> ([(0,4),(0,5),(1,7),(3,2),(4,3),(4,6),(5,1),(5,6),(6,7)],8)
=> 1
[1,1,0,1,1,0,1,0,0,1,0,0]
=> [4,2,1,1]
=> [[4,2,1,1],[]]
=> ([(0,5),(0,6),(3,2),(4,1),(5,3),(5,7),(6,4),(6,7)],8)
=> 1
[1,1,0,1,1,0,1,1,0,0,0,0]
=> [2,2,1,1]
=> [[2,2,1,1],[]]
=> ([(0,2),(0,4),(2,5),(3,1),(4,3),(4,5)],6)
=> 1
[1,1,0,1,1,1,0,0,0,1,0,0]
=> [4,1,1,1]
=> [[4,1,1,1],[]]
=> ([(0,5),(0,6),(3,2),(4,1),(5,3),(6,4)],7)
=> 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> [4,4,3]
=> [[4,4,3],[]]
=> ([(0,4),(0,5),(1,8),(2,7),(3,2),(3,9),(4,3),(4,6),(5,1),(5,6),(6,8),(6,9),(8,10),(9,7),(9,10)],11)
=> ? = 1
[1,1,1,0,0,0,1,1,0,0,1,0]
=> [5,3,3]
=> [[5,3,3],[]]
=> ([(0,5),(0,6),(2,9),(3,1),(4,3),(4,8),(5,4),(5,7),(6,2),(6,7),(7,8),(7,9),(8,10),(9,10)],11)
=> ? = 1
[1,1,1,0,0,0,1,1,0,1,0,0]
=> [4,3,3]
=> [[4,3,3],[]]
=> ([(0,4),(0,5),(2,7),(3,1),(3,8),(4,2),(4,6),(5,3),(5,6),(6,7),(6,8),(7,9),(8,9)],10)
=> 1
[1,1,1,0,0,0,1,1,1,0,0,0]
=> [3,3,3]
=> [[3,3,3],[]]
=> ([(0,3),(0,4),(1,7),(2,6),(3,2),(3,5),(4,1),(4,5),(5,6),(5,7),(6,8),(7,8)],9)
=> 1
[1,1,1,0,0,1,0,0,1,0,1,0]
=> [5,4,2]
=> [[5,4,2],[]]
=> ([(0,5),(0,6),(2,9),(3,4),(3,10),(4,1),(4,8),(5,3),(5,7),(6,2),(6,7),(7,9),(7,10),(10,8)],11)
=> ? = 1
[1,1,1,0,0,1,0,0,1,1,0,0]
=> [4,4,2]
=> [[4,4,2],[]]
=> ([(0,4),(0,5),(1,8),(2,7),(3,2),(3,9),(4,3),(4,6),(5,1),(5,6),(6,8),(6,9),(9,7)],10)
=> 1
[1,1,1,0,0,1,0,1,0,0,1,0]
=> [5,3,2]
=> [[5,3,2],[]]
=> ([(0,5),(0,6),(2,9),(3,1),(4,3),(4,8),(5,4),(5,7),(6,2),(6,7),(7,8),(7,9)],10)
=> 1
[1,1,1,0,0,1,0,1,1,0,0,0]
=> [3,3,2]
=> [[3,3,2],[]]
=> ([(0,3),(0,4),(1,7),(2,6),(3,2),(3,5),(4,1),(4,5),(5,6),(5,7)],8)
=> 1
[1,1,1,0,0,1,1,0,0,0,1,0]
=> [5,2,2]
=> [[5,2,2],[]]
=> ([(0,5),(0,6),(2,8),(3,4),(4,1),(5,3),(5,7),(6,2),(6,7),(7,8)],9)
=> 1
[1,1,1,0,0,1,1,0,0,1,0,0]
=> [4,2,2]
=> [[4,2,2],[]]
=> ([(0,4),(0,5),(1,7),(3,2),(4,3),(4,6),(5,1),(5,6),(6,7)],8)
=> 1
[1,1,1,0,0,1,1,0,1,0,0,0]
=> [3,2,2]
=> [[3,2,2],[]]
=> ([(0,3),(0,4),(2,6),(3,1),(3,5),(4,2),(4,5),(5,6)],7)
=> 1
[1,1,1,0,0,1,1,1,0,0,0,0]
=> [2,2,2]
=> [[2,2,2],[]]
=> ([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> 1
[1,1,1,0,1,0,0,0,1,1,0,0]
=> [4,4,1]
=> [[4,4,1],[]]
=> ([(0,4),(0,5),(2,7),(3,2),(3,8),(4,3),(4,6),(5,1),(5,6),(6,8),(8,7)],9)
=> 1
[1,1,1,0,1,0,0,1,0,0,1,0]
=> [5,3,1]
=> [[5,3,1],[]]
=> ([(0,5),(0,6),(3,4),(3,8),(4,2),(5,3),(5,7),(6,1),(6,7),(7,8)],9)
=> 1
[1,1,1,0,1,0,0,1,1,0,0,0]
=> [3,3,1]
=> [[3,3,1],[]]
=> ([(0,3),(0,4),(2,6),(3,1),(3,5),(4,2),(4,5),(5,6)],7)
=> 1
[1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [6,4,4,3,2,1]
=> [[6,4,4,3,2,1],[]]
=> ?
=> ? = 1
[1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3,2,1]
=> [[6,5,3,3,2,1],[]]
=> ?
=> ? = 1
[1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> [5,5,3,3,2,1]
=> [[5,5,3,3,2,1],[]]
=> ?
=> ? = 1
[1,0,1,0,1,0,1,1,0,1,0,0,1,0]
=> [6,4,3,3,2,1]
=> [[6,4,3,3,2,1],[]]
=> ?
=> ? = 1
[1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,2,1]
=> [[6,5,4,2,2,1],[]]
=> ?
=> ? = 1
[1,0,1,0,1,1,0,0,1,0,1,1,0,0]
=> [5,5,4,2,2,1]
=> [[5,5,4,2,2,1],[]]
=> ?
=> ? = 2
[1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [6,4,4,2,2,1]
=> [[6,4,4,2,2,1],[]]
=> ?
=> ? = 2
[1,0,1,0,1,1,0,0,1,1,0,1,0,0]
=> [5,4,4,2,2,1]
=> [[5,4,4,2,2,1],[]]
=> ?
=> ? = 1
[1,0,1,0,1,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,2,1]
=> [[6,5,3,2,2,1],[]]
=> ?
=> ? = 1
[1,0,1,0,1,1,0,1,0,0,1,1,0,0]
=> [5,5,3,2,2,1]
=> [[5,5,3,2,2,1],[]]
=> ?
=> ? = 2
[1,0,1,0,1,1,0,1,0,1,0,0,1,0]
=> [6,4,3,2,2,1]
=> [[6,4,3,2,2,1],[]]
=> ?
=> ? = 1
[1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,1,1]
=> [[6,5,4,3,1,1],[]]
=> ?
=> ? = 1
[1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> [5,5,4,3,1,1]
=> [[5,5,4,3,1,1],[]]
=> ?
=> ? = 2
[1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> [6,4,4,3,1,1]
=> [[6,4,4,3,1,1],[]]
=> ?
=> ? = 2
[1,0,1,1,0,0,1,0,1,1,0,1,0,0]
=> [5,4,4,3,1,1]
=> [[5,4,4,3,1,1],[]]
=> ?
=> ? = 2
[1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3,1,1]
=> [[6,5,3,3,1,1],[]]
=> ?
=> ? = 2
Description
The number of minimal elements in a poset.
Matching statistic: St000115
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00027: Dyck paths —to partition⟶ Integer partitions
Mp00045: Integer partitions —reading tableau⟶ Standard tableaux
Mp00082: Standard tableaux —to Gelfand-Tsetlin pattern⟶ Gelfand-Tsetlin patterns
St000115: Gelfand-Tsetlin patterns ⟶ ℤResult quality: 25% ●values known / values provided: 42%●distinct values known / distinct values provided: 25%
Mp00045: Integer partitions —reading tableau⟶ Standard tableaux
Mp00082: Standard tableaux —to Gelfand-Tsetlin pattern⟶ Gelfand-Tsetlin patterns
St000115: Gelfand-Tsetlin patterns ⟶ ℤResult quality: 25% ●values known / values provided: 42%●distinct values known / distinct values provided: 25%
Values
[1,0,1,1,0,0,1,0]
=> [3,1,1]
=> [[1,4,5],[2],[3]]
=> [[3,1,1,0,0],[2,1,1,0],[1,1,1],[1,1],[1]]
=> 1
[1,1,0,0,1,1,0,0]
=> [2,2]
=> [[1,2],[3,4]]
=> [[2,2,0,0],[2,1,0],[2,0],[1]]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [4,2,2,1]
=> [[1,3,8,9],[2,5],[4,7],[6]]
=> [[4,2,2,1,0,0,0,0,0],[3,2,2,1,0,0,0,0],[2,2,2,1,0,0,0],[2,2,1,1,0,0],[2,2,1,0,0],[2,1,1,0],[2,1,0],[1,1],[1]]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [4,3,1,1]
=> [[1,4,5,9],[2,7,8],[3],[6]]
=> [[4,3,1,1,0,0,0,0,0],[3,3,1,1,0,0,0,0],[3,2,1,1,0,0,0],[3,1,1,1,0,0],[3,1,1,0,0],[2,1,1,0],[1,1,1],[1,1],[1]]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [3,3,1,1]
=> [[1,4,5],[2,7,8],[3],[6]]
=> [[3,3,1,1,0,0,0,0],[3,2,1,1,0,0,0],[3,1,1,1,0,0],[3,1,1,0,0],[2,1,1,0],[1,1,1],[1,1],[1]]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [4,2,1,1]
=> [[1,4,7,8],[2,6],[3],[5]]
=> [[4,2,1,1,0,0,0,0],[3,2,1,1,0,0,0],[2,2,1,1,0,0],[2,1,1,1,0],[2,1,1,0],[1,1,1],[1,1],[1]]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,2,1,1]
=> [[1,4],[2,6],[3],[5]]
=> [[2,2,1,1,0,0],[2,1,1,1,0],[2,1,1,0],[1,1,1],[1,1],[1]]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [4,1,1,1]
=> [[1,5,6,7],[2],[3],[4]]
=> [[4,1,1,1,0,0,0],[3,1,1,1,0,0],[2,1,1,1,0],[1,1,1,1],[1,1,1],[1,1],[1]]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [3,3,2]
=> [[1,2,5],[3,4,8],[6,7]]
=> [[3,3,2,0,0,0,0,0],[3,2,2,0,0,0,0],[3,2,1,0,0,0],[3,2,0,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [4,2,2]
=> [[1,2,7,8],[3,4],[5,6]]
=> [[4,2,2,0,0,0,0,0],[3,2,2,0,0,0,0],[2,2,2,0,0,0],[2,2,1,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [3,2,2]
=> [[1,2,7],[3,4],[5,6]]
=> [[3,2,2,0,0,0,0],[2,2,2,0,0,0],[2,2,1,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [[2,2,2,0,0,0],[2,2,1,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,3,1]
=> [[1,3,4],[2,6,7],[5]]
=> [[3,3,1,0,0,0,0],[3,2,1,0,0,0],[3,1,1,0,0],[3,1,0,0],[2,1,0],[1,1],[1]]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,1]
=> [[1,4,5],[2],[3]]
=> [[3,1,1,0,0],[2,1,1,0],[1,1,1],[1,1],[1]]
=> 1
[1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> [[1,2,3],[4,5,6]]
=> [[3,3,0,0,0,0],[3,2,0,0,0],[3,1,0,0],[3,0,0],[2,0],[1]]
=> 1
[1,1,1,0,0,1,0,0,1,0]
=> [4,2]
=> [[1,2,5,6],[3,4]]
=> [[4,2,0,0,0,0],[3,2,0,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> 1
[1,1,1,0,0,1,1,0,0,0]
=> [2,2]
=> [[1,2],[3,4]]
=> [[2,2,0,0],[2,1,0],[2,0],[1]]
=> 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [5,3,3,2,1]
=> [[1,3,6,13,14],[2,5,9],[4,8,12],[7,11],[10]]
=> [[5,3,3,2,1,0,0,0,0,0,0,0,0,0],[4,3,3,2,1,0,0,0,0,0,0,0,0],[3,3,3,2,1,0,0,0,0,0,0,0],[3,3,2,2,1,0,0,0,0,0,0],[3,3,2,1,1,0,0,0,0,0],[3,3,2,1,0,0,0,0,0],[3,2,2,1,0,0,0,0],[3,2,1,1,0,0,0],[3,2,1,0,0,0],[2,2,1,0,0],[2,1,1,0],[2,1,0],[1,1],[1]]
=> ? = 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,2,1]
=> [[1,3,8,9,14],[2,5,12,13],[4,7],[6,11],[10]]
=> [[5,4,2,2,1,0,0,0,0,0,0,0,0,0],[4,4,2,2,1,0,0,0,0,0,0,0,0],[4,3,2,2,1,0,0,0,0,0,0,0],[4,2,2,2,1,0,0,0,0,0,0],[4,2,2,1,1,0,0,0,0,0],[4,2,2,1,0,0,0,0,0],[3,2,2,1,0,0,0,0],[2,2,2,1,0,0,0],[2,2,1,1,0,0],[2,2,1,0,0],[2,1,1,0],[2,1,0],[1,1],[1]]
=> ? = 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [4,4,2,2,1]
=> [[1,3,8,9],[2,5,12,13],[4,7],[6,11],[10]]
=> [[4,4,2,2,1,0,0,0,0,0,0,0,0],[4,3,2,2,1,0,0,0,0,0,0,0],[4,2,2,2,1,0,0,0,0,0,0],[4,2,2,1,1,0,0,0,0,0],[4,2,2,1,0,0,0,0,0],[3,2,2,1,0,0,0,0],[2,2,2,1,0,0,0],[2,2,1,1,0,0],[2,2,1,0,0],[2,1,1,0],[2,1,0],[1,1],[1]]
=> ? = 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,2,1]
=> [[1,3,8,12,13],[2,5,11],[4,7],[6,10],[9]]
=> [[5,3,2,2,1,0,0,0,0,0,0,0,0],[4,3,2,2,1,0,0,0,0,0,0,0],[3,3,2,2,1,0,0,0,0,0,0],[3,2,2,2,1,0,0,0,0,0],[3,2,2,1,1,0,0,0,0],[3,2,2,1,0,0,0,0],[2,2,2,1,0,0,0],[2,2,1,1,0,0],[2,2,1,0,0],[2,1,1,0],[2,1,0],[1,1],[1]]
=> ? = 1
[1,0,1,0,1,1,0,1,1,0,0,0]
=> [3,3,2,2,1]
=> [[1,3,8],[2,5,11],[4,7],[6,10],[9]]
=> [[3,3,2,2,1,0,0,0,0,0,0],[3,2,2,2,1,0,0,0,0,0],[3,2,2,1,1,0,0,0,0],[3,2,2,1,0,0,0,0],[2,2,2,1,0,0,0],[2,2,1,1,0,0],[2,2,1,0,0],[2,1,1,0],[2,1,0],[1,1],[1]]
=> ? = 1
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [5,2,2,2,1]
=> [[1,3,10,11,12],[2,5],[4,7],[6,9],[8]]
=> [[5,2,2,2,1,0,0,0,0,0,0,0],[4,2,2,2,1,0,0,0,0,0,0],[3,2,2,2,1,0,0,0,0,0],[2,2,2,2,1,0,0,0,0],[2,2,2,1,1,0,0,0],[2,2,2,1,0,0,0],[2,2,1,1,0,0],[2,2,1,0,0],[2,1,1,0],[2,1,0],[1,1],[1]]
=> ? = 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,1]
=> [[1,4,5,9,14],[2,7,8,13],[3,11,12],[6],[10]]
=> [[5,4,3,1,1,0,0,0,0,0,0,0,0,0],[4,4,3,1,1,0,0,0,0,0,0,0,0],[4,3,3,1,1,0,0,0,0,0,0,0],[4,3,2,1,1,0,0,0,0,0,0],[4,3,1,1,1,0,0,0,0,0],[4,3,1,1,0,0,0,0,0],[3,3,1,1,0,0,0,0],[3,2,1,1,0,0,0],[3,1,1,1,0,0],[3,1,1,0,0],[2,1,1,0],[1,1,1],[1,1],[1]]
=> ? = 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [4,4,3,1,1]
=> [[1,4,5,9],[2,7,8,13],[3,11,12],[6],[10]]
=> [[4,4,3,1,1,0,0,0,0,0,0,0,0],[4,3,3,1,1,0,0,0,0,0,0,0],[4,3,2,1,1,0,0,0,0,0,0],[4,3,1,1,1,0,0,0,0,0],[4,3,1,1,0,0,0,0,0],[3,3,1,1,0,0,0,0],[3,2,1,1,0,0,0],[3,1,1,1,0,0],[3,1,1,0,0],[2,1,1,0],[1,1,1],[1,1],[1]]
=> ? = 2
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [5,3,3,1,1]
=> [[1,4,5,12,13],[2,7,8],[3,10,11],[6],[9]]
=> [[5,3,3,1,1,0,0,0,0,0,0,0,0],[4,3,3,1,1,0,0,0,0,0,0,0],[3,3,3,1,1,0,0,0,0,0,0],[3,3,2,1,1,0,0,0,0,0],[3,3,1,1,1,0,0,0,0],[3,3,1,1,0,0,0,0],[3,2,1,1,0,0,0],[3,1,1,1,0,0],[3,1,1,0,0],[2,1,1,0],[1,1,1],[1,1],[1]]
=> ? = 2
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [4,3,3,1,1]
=> [[1,4,5,12],[2,7,8],[3,10,11],[6],[9]]
=> [[4,3,3,1,1,0,0,0,0,0,0,0],[3,3,3,1,1,0,0,0,0,0,0],[3,3,2,1,1,0,0,0,0,0],[3,3,1,1,1,0,0,0,0],[3,3,1,1,0,0,0,0],[3,2,1,1,0,0,0],[3,1,1,1,0,0],[3,1,1,0,0],[2,1,1,0],[1,1,1],[1,1],[1]]
=> ? = 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [3,3,3,1,1]
=> [[1,4,5],[2,7,8],[3,10,11],[6],[9]]
=> [[3,3,3,1,1,0,0,0,0,0,0],[3,3,2,1,1,0,0,0,0,0],[3,3,1,1,1,0,0,0,0],[3,3,1,1,0,0,0,0],[3,2,1,1,0,0,0],[3,1,1,1,0,0],[3,1,1,0,0],[2,1,1,0],[1,1,1],[1,1],[1]]
=> ? = 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,1]
=> [[1,4,7,8,13],[2,6,11,12],[3,10],[5],[9]]
=> [[5,4,2,1,1,0,0,0,0,0,0,0,0],[4,4,2,1,1,0,0,0,0,0,0,0],[4,3,2,1,1,0,0,0,0,0,0],[4,2,2,1,1,0,0,0,0,0],[4,2,1,1,1,0,0,0,0],[4,2,1,1,0,0,0,0],[3,2,1,1,0,0,0],[2,2,1,1,0,0],[2,1,1,1,0],[2,1,1,0],[1,1,1],[1,1],[1]]
=> ? = 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [4,4,2,1,1]
=> [[1,4,7,8],[2,6,11,12],[3,10],[5],[9]]
=> [[4,4,2,1,1,0,0,0,0,0,0,0],[4,3,2,1,1,0,0,0,0,0,0],[4,2,2,1,1,0,0,0,0,0],[4,2,1,1,1,0,0,0,0],[4,2,1,1,0,0,0,0],[3,2,1,1,0,0,0],[2,2,1,1,0,0],[2,1,1,1,0],[2,1,1,0],[1,1,1],[1,1],[1]]
=> ? = 2
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,1]
=> [[1,4,7,11,12],[2,6,10],[3,9],[5],[8]]
=> [[5,3,2,1,1,0,0,0,0,0,0,0],[4,3,2,1,1,0,0,0,0,0,0],[3,3,2,1,1,0,0,0,0,0],[3,2,2,1,1,0,0,0,0],[3,2,1,1,1,0,0,0],[3,2,1,1,0,0,0],[2,2,1,1,0,0],[2,1,1,1,0],[2,1,1,0],[1,1,1],[1,1],[1]]
=> ? = 1
[1,0,1,1,0,1,0,1,1,0,0,0]
=> [3,3,2,1,1]
=> [[1,4,7],[2,6,10],[3,9],[5],[8]]
=> [[3,3,2,1,1,0,0,0,0,0],[3,2,2,1,1,0,0,0,0],[3,2,1,1,1,0,0,0],[3,2,1,1,0,0,0],[2,2,1,1,0,0],[2,1,1,1,0],[2,1,1,0],[1,1,1],[1,1],[1]]
=> 1
[1,0,1,1,0,1,1,0,0,0,1,0]
=> [5,2,2,1,1]
=> [[1,4,9,10,11],[2,6],[3,8],[5],[7]]
=> [[5,2,2,1,1,0,0,0,0,0,0],[4,2,2,1,1,0,0,0,0,0],[3,2,2,1,1,0,0,0,0],[2,2,2,1,1,0,0,0],[2,2,1,1,1,0,0],[2,2,1,1,0,0],[2,1,1,1,0],[2,1,1,0],[1,1,1],[1,1],[1]]
=> ? = 1
[1,0,1,1,0,1,1,0,0,1,0,0]
=> [4,2,2,1,1]
=> [[1,4,9,10],[2,6],[3,8],[5],[7]]
=> [[4,2,2,1,1,0,0,0,0,0],[3,2,2,1,1,0,0,0,0],[2,2,2,1,1,0,0,0],[2,2,1,1,1,0,0],[2,2,1,1,0,0],[2,1,1,1,0],[2,1,1,0],[1,1,1],[1,1],[1]]
=> 1
[1,0,1,1,0,1,1,0,1,0,0,0]
=> [3,2,2,1,1]
=> [[1,4,9],[2,6],[3,8],[5],[7]]
=> [[3,2,2,1,1,0,0,0,0],[2,2,2,1,1,0,0,0],[2,2,1,1,1,0,0],[2,2,1,1,0,0],[2,1,1,1,0],[2,1,1,0],[1,1,1],[1,1],[1]]
=> 1
[1,0,1,1,0,1,1,1,0,0,0,0]
=> [2,2,2,1,1]
=> [[1,4],[2,6],[3,8],[5],[7]]
=> [[2,2,2,1,1,0,0,0],[2,2,1,1,1,0,0],[2,2,1,1,0,0],[2,1,1,1,0],[2,1,1,0],[1,1,1],[1,1],[1]]
=> 1
[1,0,1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,1,1]
=> [[1,5,6,7,12],[2,9,10,11],[3],[4],[8]]
=> [[5,4,1,1,1,0,0,0,0,0,0,0],[4,4,1,1,1,0,0,0,0,0,0],[4,3,1,1,1,0,0,0,0,0],[4,2,1,1,1,0,0,0,0],[4,1,1,1,1,0,0,0],[4,1,1,1,0,0,0],[3,1,1,1,0,0],[2,1,1,1,0],[1,1,1,1],[1,1,1],[1,1],[1]]
=> ? = 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [4,4,1,1,1]
=> [[1,5,6,7],[2,9,10,11],[3],[4],[8]]
=> [[4,4,1,1,1,0,0,0,0,0,0],[4,3,1,1,1,0,0,0,0,0],[4,2,1,1,1,0,0,0,0],[4,1,1,1,1,0,0,0],[4,1,1,1,0,0,0],[3,1,1,1,0,0],[2,1,1,1,0],[1,1,1,1],[1,1,1],[1,1],[1]]
=> ? = 1
[1,0,1,1,1,0,0,1,0,0,1,0]
=> [5,3,1,1,1]
=> [[1,5,6,10,11],[2,8,9],[3],[4],[7]]
=> [[5,3,1,1,1,0,0,0,0,0,0],[4,3,1,1,1,0,0,0,0,0],[3,3,1,1,1,0,0,0,0],[3,2,1,1,1,0,0,0],[3,1,1,1,1,0,0],[3,1,1,1,0,0],[2,1,1,1,0],[1,1,1,1],[1,1,1],[1,1],[1]]
=> ? = 1
[1,0,1,1,1,0,0,1,1,0,0,0]
=> [3,3,1,1,1]
=> [[1,5,6],[2,8,9],[3],[4],[7]]
=> [[3,3,1,1,1,0,0,0,0],[3,2,1,1,1,0,0,0],[3,1,1,1,1,0,0],[3,1,1,1,0,0],[2,1,1,1,0],[1,1,1,1],[1,1,1],[1,1],[1]]
=> 1
[1,0,1,1,1,0,1,0,0,0,1,0]
=> [5,2,1,1,1]
=> [[1,5,8,9,10],[2,7],[3],[4],[6]]
=> [[5,2,1,1,1,0,0,0,0,0],[4,2,1,1,1,0,0,0,0],[3,2,1,1,1,0,0,0],[2,2,1,1,1,0,0],[2,1,1,1,1,0],[2,1,1,1,0],[1,1,1,1],[1,1,1],[1,1],[1]]
=> 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [5,1,1,1,1]
=> [[1,6,7,8,9],[2],[3],[4],[5]]
=> [[5,1,1,1,1,0,0,0,0],[4,1,1,1,1,0,0,0],[3,1,1,1,1,0,0],[2,1,1,1,1,0],[1,1,1,1,1],[1,1,1,1],[1,1,1],[1,1],[1]]
=> 1
[1,0,1,1,1,1,0,0,1,0,0,0]
=> [3,1,1,1,1]
=> [[1,6,7],[2],[3],[4],[5]]
=> [[3,1,1,1,1,0,0],[2,1,1,1,1,0],[1,1,1,1,1],[1,1,1,1],[1,1,1],[1,1],[1]]
=> 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [4,4,3,2]
=> [[1,2,5,9],[3,4,8,13],[6,7,12],[10,11]]
=> [[4,4,3,2,0,0,0,0,0,0,0,0,0],[4,3,3,2,0,0,0,0,0,0,0,0],[4,3,2,2,0,0,0,0,0,0,0],[4,3,2,1,0,0,0,0,0,0],[4,3,2,0,0,0,0,0,0],[3,3,2,0,0,0,0,0],[3,2,2,0,0,0,0],[3,2,1,0,0,0],[3,2,0,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> ? = 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [5,3,3,2]
=> [[1,2,5,12,13],[3,4,8],[6,7,11],[9,10]]
=> [[5,3,3,2,0,0,0,0,0,0,0,0,0],[4,3,3,2,0,0,0,0,0,0,0,0],[3,3,3,2,0,0,0,0,0,0,0],[3,3,2,2,0,0,0,0,0,0],[3,3,2,1,0,0,0,0,0],[3,3,2,0,0,0,0,0],[3,2,2,0,0,0,0],[3,2,1,0,0,0],[3,2,0,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> ? = 2
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [4,3,3,2]
=> [[1,2,5,12],[3,4,8],[6,7,11],[9,10]]
=> [[4,3,3,2,0,0,0,0,0,0,0,0],[3,3,3,2,0,0,0,0,0,0,0],[3,3,2,2,0,0,0,0,0,0],[3,3,2,1,0,0,0,0,0],[3,3,2,0,0,0,0,0],[3,2,2,0,0,0,0],[3,2,1,0,0,0],[3,2,0,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> ? = 1
[1,1,0,0,1,0,1,1,1,0,0,0]
=> [3,3,3,2]
=> [[1,2,5],[3,4,8],[6,7,11],[9,10]]
=> [[3,3,3,2,0,0,0,0,0,0,0],[3,3,2,2,0,0,0,0,0,0],[3,3,2,1,0,0,0,0,0],[3,3,2,0,0,0,0,0],[3,2,2,0,0,0,0],[3,2,1,0,0,0],[3,2,0,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> ? = 1
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [5,4,2,2]
=> [[1,2,7,8,13],[3,4,11,12],[5,6],[9,10]]
=> [[5,4,2,2,0,0,0,0,0,0,0,0,0],[4,4,2,2,0,0,0,0,0,0,0,0],[4,3,2,2,0,0,0,0,0,0,0],[4,2,2,2,0,0,0,0,0,0],[4,2,2,1,0,0,0,0,0],[4,2,2,0,0,0,0,0],[3,2,2,0,0,0,0],[2,2,2,0,0,0],[2,2,1,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> ? = 1
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [4,4,2,2]
=> [[1,2,7,8],[3,4,11,12],[5,6],[9,10]]
=> [[4,4,2,2,0,0,0,0,0,0,0,0],[4,3,2,2,0,0,0,0,0,0,0],[4,2,2,2,0,0,0,0,0,0],[4,2,2,1,0,0,0,0,0],[4,2,2,0,0,0,0,0],[3,2,2,0,0,0,0],[2,2,2,0,0,0],[2,2,1,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> ? = 2
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [5,3,2,2]
=> [[1,2,7,11,12],[3,4,10],[5,6],[8,9]]
=> [[5,3,2,2,0,0,0,0,0,0,0,0],[4,3,2,2,0,0,0,0,0,0,0],[3,3,2,2,0,0,0,0,0,0],[3,2,2,2,0,0,0,0,0],[3,2,2,1,0,0,0,0],[3,2,2,0,0,0,0],[2,2,2,0,0,0],[2,2,1,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> ? = 2
[1,1,0,0,1,1,0,1,0,1,0,0]
=> [4,3,2,2]
=> [[1,2,7,11],[3,4,10],[5,6],[8,9]]
=> [[4,3,2,2,0,0,0,0,0,0,0],[3,3,2,2,0,0,0,0,0,0],[3,2,2,2,0,0,0,0,0],[3,2,2,1,0,0,0,0],[3,2,2,0,0,0,0],[2,2,2,0,0,0],[2,2,1,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> ? = 1
[1,1,0,0,1,1,0,1,1,0,0,0]
=> [3,3,2,2]
=> [[1,2,7],[3,4,10],[5,6],[8,9]]
=> [[3,3,2,2,0,0,0,0,0,0],[3,2,2,2,0,0,0,0,0],[3,2,2,1,0,0,0,0],[3,2,2,0,0,0,0],[2,2,2,0,0,0],[2,2,1,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> 1
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [5,2,2,2]
=> [[1,2,9,10,11],[3,4],[5,6],[7,8]]
=> [[5,2,2,2,0,0,0,0,0,0,0],[4,2,2,2,0,0,0,0,0,0],[3,2,2,2,0,0,0,0,0],[2,2,2,2,0,0,0,0],[2,2,2,1,0,0,0],[2,2,2,0,0,0],[2,2,1,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> ? = 1
[1,1,0,0,1,1,1,0,0,1,0,0]
=> [4,2,2,2]
=> [[1,2,9,10],[3,4],[5,6],[7,8]]
=> [[4,2,2,2,0,0,0,0,0,0],[3,2,2,2,0,0,0,0,0],[2,2,2,2,0,0,0,0],[2,2,2,1,0,0,0],[2,2,2,0,0,0],[2,2,1,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> 1
[1,1,0,0,1,1,1,0,1,0,0,0]
=> [3,2,2,2]
=> [[1,2,9],[3,4],[5,6],[7,8]]
=> [[3,2,2,2,0,0,0,0,0],[2,2,2,2,0,0,0,0],[2,2,2,1,0,0,0],[2,2,2,0,0,0],[2,2,1,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> 1
[1,1,0,0,1,1,1,1,0,0,0,0]
=> [2,2,2,2]
=> [[1,2],[3,4],[5,6],[7,8]]
=> [[2,2,2,2,0,0,0,0],[2,2,2,1,0,0,0],[2,2,2,0,0,0],[2,2,1,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> 1
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [4,4,3,1]
=> [[1,3,4,8],[2,6,7,12],[5,10,11],[9]]
=> [[4,4,3,1,0,0,0,0,0,0,0,0],[4,3,3,1,0,0,0,0,0,0,0],[4,3,2,1,0,0,0,0,0,0],[4,3,1,1,0,0,0,0,0],[4,3,1,0,0,0,0,0],[3,3,1,0,0,0,0],[3,2,1,0,0,0],[3,1,1,0,0],[3,1,0,0],[2,1,0],[1,1],[1]]
=> ? = 1
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [5,3,3,1]
=> [[1,3,4,11,12],[2,6,7],[5,9,10],[8]]
=> [[5,3,3,1,0,0,0,0,0,0,0,0],[4,3,3,1,0,0,0,0,0,0,0],[3,3,3,1,0,0,0,0,0,0],[3,3,2,1,0,0,0,0,0],[3,3,1,1,0,0,0,0],[3,3,1,0,0,0,0],[3,2,1,0,0,0],[3,1,1,0,0],[3,1,0,0],[2,1,0],[1,1],[1]]
=> ? = 1
[1,1,0,1,0,0,1,1,0,1,0,0]
=> [4,3,3,1]
=> [[1,3,4,11],[2,6,7],[5,9,10],[8]]
=> [[4,3,3,1,0,0,0,0,0,0,0],[3,3,3,1,0,0,0,0,0,0],[3,3,2,1,0,0,0,0,0],[3,3,1,1,0,0,0,0],[3,3,1,0,0,0,0],[3,2,1,0,0,0],[3,1,1,0,0],[3,1,0,0],[2,1,0],[1,1],[1]]
=> ? = 1
[1,1,0,1,0,0,1,1,1,0,0,0]
=> [3,3,3,1]
=> [[1,3,4],[2,6,7],[5,9,10],[8]]
=> [[3,3,3,1,0,0,0,0,0,0],[3,3,2,1,0,0,0,0,0],[3,3,1,1,0,0,0,0],[3,3,1,0,0,0,0],[3,2,1,0,0,0],[3,1,1,0,0],[3,1,0,0],[2,1,0],[1,1],[1]]
=> 1
[1,1,0,1,0,1,0,0,1,1,0,0]
=> [4,4,2,1]
=> [[1,3,6,7],[2,5,10,11],[4,9],[8]]
=> [[4,4,2,1,0,0,0,0,0,0,0],[4,3,2,1,0,0,0,0,0,0],[4,2,2,1,0,0,0,0,0],[4,2,1,1,0,0,0,0],[4,2,1,0,0,0,0],[3,2,1,0,0,0],[2,2,1,0,0],[2,1,1,0],[2,1,0],[1,1],[1]]
=> ? = 1
[1,1,0,1,0,1,1,0,0,1,0,0]
=> [4,2,2,1]
=> [[1,3,8,9],[2,5],[4,7],[6]]
=> [[4,2,2,1,0,0,0,0,0],[3,2,2,1,0,0,0,0],[2,2,2,1,0,0,0],[2,2,1,1,0,0],[2,2,1,0,0],[2,1,1,0],[2,1,0],[1,1],[1]]
=> 1
[1,1,0,1,1,0,0,0,1,1,0,0]
=> [4,4,1,1]
=> [[1,4,5,6],[2,8,9,10],[3],[7]]
=> [[4,4,1,1,0,0,0,0,0,0],[4,3,1,1,0,0,0,0,0],[4,2,1,1,0,0,0,0],[4,1,1,1,0,0,0],[4,1,1,0,0,0],[3,1,1,0,0],[2,1,1,0],[1,1,1],[1,1],[1]]
=> 1
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [5,3,1,1]
=> [[1,4,5,9,10],[2,7,8],[3],[6]]
=> [[5,3,1,1,0,0,0,0,0,0],[4,3,1,1,0,0,0,0,0],[3,3,1,1,0,0,0,0],[3,2,1,1,0,0,0],[3,1,1,1,0,0],[3,1,1,0,0],[2,1,1,0],[1,1,1],[1,1],[1]]
=> 1
[1,1,0,1,1,0,0,1,0,1,0,0]
=> [4,3,1,1]
=> [[1,4,5,9],[2,7,8],[3],[6]]
=> [[4,3,1,1,0,0,0,0,0],[3,3,1,1,0,0,0,0],[3,2,1,1,0,0,0],[3,1,1,1,0,0],[3,1,1,0,0],[2,1,1,0],[1,1,1],[1,1],[1]]
=> 1
[1,1,0,1,1,0,0,1,1,0,0,0]
=> [3,3,1,1]
=> [[1,4,5],[2,7,8],[3],[6]]
=> [[3,3,1,1,0,0,0,0],[3,2,1,1,0,0,0],[3,1,1,1,0,0],[3,1,1,0,0],[2,1,1,0],[1,1,1],[1,1],[1]]
=> 1
[1,1,0,1,1,0,1,0,0,1,0,0]
=> [4,2,1,1]
=> [[1,4,7,8],[2,6],[3],[5]]
=> [[4,2,1,1,0,0,0,0],[3,2,1,1,0,0,0],[2,2,1,1,0,0],[2,1,1,1,0],[2,1,1,0],[1,1,1],[1,1],[1]]
=> 1
[1,1,0,1,1,0,1,1,0,0,0,0]
=> [2,2,1,1]
=> [[1,4],[2,6],[3],[5]]
=> [[2,2,1,1,0,0],[2,1,1,1,0],[2,1,1,0],[1,1,1],[1,1],[1]]
=> 1
[1,1,0,1,1,1,0,0,0,1,0,0]
=> [4,1,1,1]
=> [[1,5,6,7],[2],[3],[4]]
=> [[4,1,1,1,0,0,0],[3,1,1,1,0,0],[2,1,1,1,0],[1,1,1,1],[1,1,1],[1,1],[1]]
=> 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> [4,4,3]
=> [[1,2,3,7],[4,5,6,11],[8,9,10]]
=> [[4,4,3,0,0,0,0,0,0,0,0],[4,3,3,0,0,0,0,0,0,0],[4,3,2,0,0,0,0,0,0],[4,3,1,0,0,0,0,0],[4,3,0,0,0,0,0],[3,3,0,0,0,0],[3,2,0,0,0],[3,1,0,0],[3,0,0],[2,0],[1]]
=> ? = 1
[1,1,1,0,0,0,1,1,0,0,1,0]
=> [5,3,3]
=> [[1,2,3,10,11],[4,5,6],[7,8,9]]
=> [[5,3,3,0,0,0,0,0,0,0,0],[4,3,3,0,0,0,0,0,0,0],[3,3,3,0,0,0,0,0,0],[3,3,2,0,0,0,0,0],[3,3,1,0,0,0,0],[3,3,0,0,0,0],[3,2,0,0,0],[3,1,0,0],[3,0,0],[2,0],[1]]
=> ? = 1
[1,1,1,0,0,0,1,1,0,1,0,0]
=> [4,3,3]
=> [[1,2,3,10],[4,5,6],[7,8,9]]
=> [[4,3,3,0,0,0,0,0,0,0],[3,3,3,0,0,0,0,0,0],[3,3,2,0,0,0,0,0],[3,3,1,0,0,0,0],[3,3,0,0,0,0],[3,2,0,0,0],[3,1,0,0],[3,0,0],[2,0],[1]]
=> 1
[1,1,1,0,0,0,1,1,1,0,0,0]
=> [3,3,3]
=> [[1,2,3],[4,5,6],[7,8,9]]
=> [[3,3,3,0,0,0,0,0,0],[3,3,2,0,0,0,0,0],[3,3,1,0,0,0,0],[3,3,0,0,0,0],[3,2,0,0,0],[3,1,0,0],[3,0,0],[2,0],[1]]
=> 1
[1,1,1,0,0,1,0,0,1,0,1,0]
=> [5,4,2]
=> [[1,2,5,6,11],[3,4,9,10],[7,8]]
=> [[5,4,2,0,0,0,0,0,0,0,0],[4,4,2,0,0,0,0,0,0,0],[4,3,2,0,0,0,0,0,0],[4,2,2,0,0,0,0,0],[4,2,1,0,0,0,0],[4,2,0,0,0,0],[3,2,0,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> ? = 1
[1,1,1,0,0,1,0,0,1,1,0,0]
=> [4,4,2]
=> [[1,2,5,6],[3,4,9,10],[7,8]]
=> [[4,4,2,0,0,0,0,0,0,0],[4,3,2,0,0,0,0,0,0],[4,2,2,0,0,0,0,0],[4,2,1,0,0,0,0],[4,2,0,0,0,0],[3,2,0,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> 1
[1,1,1,0,0,1,0,1,0,0,1,0]
=> [5,3,2]
=> [[1,2,5,9,10],[3,4,8],[6,7]]
=> [[5,3,2,0,0,0,0,0,0,0],[4,3,2,0,0,0,0,0,0],[3,3,2,0,0,0,0,0],[3,2,2,0,0,0,0],[3,2,1,0,0,0],[3,2,0,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> 1
[1,1,1,0,0,1,0,1,1,0,0,0]
=> [3,3,2]
=> [[1,2,5],[3,4,8],[6,7]]
=> [[3,3,2,0,0,0,0,0],[3,2,2,0,0,0,0],[3,2,1,0,0,0],[3,2,0,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> 1
[1,1,1,0,0,1,1,0,0,0,1,0]
=> [5,2,2]
=> [[1,2,7,8,9],[3,4],[5,6]]
=> [[5,2,2,0,0,0,0,0,0],[4,2,2,0,0,0,0,0],[3,2,2,0,0,0,0],[2,2,2,0,0,0],[2,2,1,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> 1
[1,1,1,0,0,1,1,0,0,1,0,0]
=> [4,2,2]
=> [[1,2,7,8],[3,4],[5,6]]
=> [[4,2,2,0,0,0,0,0],[3,2,2,0,0,0,0],[2,2,2,0,0,0],[2,2,1,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> 1
[1,1,1,0,0,1,1,0,1,0,0,0]
=> [3,2,2]
=> [[1,2,7],[3,4],[5,6]]
=> [[3,2,2,0,0,0,0],[2,2,2,0,0,0],[2,2,1,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> 1
[1,1,1,0,0,1,1,1,0,0,0,0]
=> [2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [[2,2,2,0,0,0],[2,2,1,0,0],[2,2,0,0],[2,1,0],[2,0],[1]]
=> 1
[1,1,1,0,1,0,0,0,1,1,0,0]
=> [4,4,1]
=> [[1,3,4,5],[2,7,8,9],[6]]
=> [[4,4,1,0,0,0,0,0,0],[4,3,1,0,0,0,0,0],[4,2,1,0,0,0,0],[4,1,1,0,0,0],[4,1,0,0,0],[3,1,0,0],[2,1,0],[1,1],[1]]
=> 1
[1,1,1,0,1,0,0,1,0,0,1,0]
=> [5,3,1]
=> [[1,3,4,8,9],[2,6,7],[5]]
=> [[5,3,1,0,0,0,0,0,0],[4,3,1,0,0,0,0,0],[3,3,1,0,0,0,0],[3,2,1,0,0,0],[3,1,1,0,0],[3,1,0,0],[2,1,0],[1,1],[1]]
=> 1
[1,1,1,0,1,0,0,1,1,0,0,0]
=> [3,3,1]
=> [[1,3,4],[2,6,7],[5]]
=> [[3,3,1,0,0,0,0],[3,2,1,0,0,0],[3,1,1,0,0],[3,1,0,0],[2,1,0],[1,1],[1]]
=> 1
[1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [6,4,4,3,2,1]
=> [[1,3,6,10,19,20],[2,5,9,14],[4,8,13,18],[7,12,17],[11,16],[15]]
=> ?
=> ? = 1
[1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3,2,1]
=> [[1,3,6,13,14,20],[2,5,9,18,19],[4,8,12],[7,11,17],[10,16],[15]]
=> ?
=> ? = 1
[1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> [5,5,3,3,2,1]
=> [[1,3,6,13,14],[2,5,9,18,19],[4,8,12],[7,11,17],[10,16],[15]]
=> ?
=> ? = 1
[1,0,1,0,1,0,1,1,0,1,0,0,1,0]
=> [6,4,3,3,2,1]
=> [[1,3,6,13,18,19],[2,5,9,17],[4,8,12],[7,11,16],[10,15],[14]]
=> ?
=> ? = 1
[1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,2,1]
=> [[1,3,8,9,14,20],[2,5,12,13,19],[4,7,17,18],[6,11],[10,16],[15]]
=> ?
=> ? = 1
[1,0,1,0,1,1,0,0,1,0,1,1,0,0]
=> [5,5,4,2,2,1]
=> [[1,3,8,9,14],[2,5,12,13,19],[4,7,17,18],[6,11],[10,16],[15]]
=> ?
=> ? = 2
[1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [6,4,4,2,2,1]
=> [[1,3,8,9,18,19],[2,5,12,13],[4,7,16,17],[6,11],[10,15],[14]]
=> ?
=> ? = 2
[1,0,1,0,1,1,0,0,1,1,0,1,0,0]
=> [5,4,4,2,2,1]
=> [[1,3,8,9,18],[2,5,12,13],[4,7,16,17],[6,11],[10,15],[14]]
=> ?
=> ? = 1
[1,0,1,0,1,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,2,1]
=> [[1,3,8,12,13,19],[2,5,11,17,18],[4,7,16],[6,10],[9,15],[14]]
=> ?
=> ? = 1
[1,0,1,0,1,1,0,1,0,0,1,1,0,0]
=> [5,5,3,2,2,1]
=> [[1,3,8,12,13],[2,5,11,17,18],[4,7,16],[6,10],[9,15],[14]]
=> ?
=> ? = 2
[1,0,1,0,1,1,0,1,0,1,0,0,1,0]
=> [6,4,3,2,2,1]
=> [[1,3,8,12,17,18],[2,5,11,16],[4,7,15],[6,10],[9,14],[13]]
=> ?
=> ? = 1
[1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,1,1]
=> [[1,4,5,9,14,20],[2,7,8,13,19],[3,11,12,18],[6,16,17],[10],[15]]
=> ?
=> ? = 1
[1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> [5,5,4,3,1,1]
=> [[1,4,5,9,14],[2,7,8,13,19],[3,11,12,18],[6,16,17],[10],[15]]
=> ?
=> ? = 2
[1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> [6,4,4,3,1,1]
=> [[1,4,5,9,18,19],[2,7,8,13],[3,11,12,17],[6,15,16],[10],[14]]
=> ?
=> ? = 2
[1,0,1,1,0,0,1,0,1,1,0,1,0,0]
=> [5,4,4,3,1,1]
=> [[1,4,5,9,18],[2,7,8,13],[3,11,12,17],[6,15,16],[10],[14]]
=> ?
=> ? = 2
[1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3,1,1]
=> [[1,4,5,12,13,19],[2,7,8,17,18],[3,10,11],[6,15,16],[9],[14]]
=> ?
=> ? = 2
Description
The single entry in the last row.
Matching statistic: St000651
Mp00027: Dyck paths —to partition⟶ Integer partitions
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
St000651: Permutations ⟶ ℤResult quality: 25% ●values known / values provided: 42%●distinct values known / distinct values provided: 25%
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
St000651: Permutations ⟶ ℤResult quality: 25% ●values known / values provided: 42%●distinct values known / distinct values provided: 25%
Values
[1,0,1,1,0,0,1,0]
=> [3,1,1]
=> [[1,2,3],[4],[5]]
=> [5,4,1,2,3] => 1
[1,1,0,0,1,1,0,0]
=> [2,2]
=> [[1,2],[3,4]]
=> [3,4,1,2] => 1
[1,0,1,0,1,1,0,0,1,0]
=> [4,2,2,1]
=> [[1,2,3,4],[5,6],[7,8],[9]]
=> [9,7,8,5,6,1,2,3,4] => 1
[1,0,1,1,0,0,1,0,1,0]
=> [4,3,1,1]
=> [[1,2,3,4],[5,6,7],[8],[9]]
=> [9,8,5,6,7,1,2,3,4] => 1
[1,0,1,1,0,0,1,1,0,0]
=> [3,3,1,1]
=> [[1,2,3],[4,5,6],[7],[8]]
=> [8,7,4,5,6,1,2,3] => 1
[1,0,1,1,0,1,0,0,1,0]
=> [4,2,1,1]
=> [[1,2,3,4],[5,6],[7],[8]]
=> [8,7,5,6,1,2,3,4] => 1
[1,0,1,1,0,1,1,0,0,0]
=> [2,2,1,1]
=> [[1,2],[3,4],[5],[6]]
=> [6,5,3,4,1,2] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [4,1,1,1]
=> [[1,2,3,4],[5],[6],[7]]
=> [7,6,5,1,2,3,4] => 1
[1,1,0,0,1,0,1,1,0,0]
=> [3,3,2]
=> [[1,2,3],[4,5,6],[7,8]]
=> [7,8,4,5,6,1,2,3] => 1
[1,1,0,0,1,1,0,0,1,0]
=> [4,2,2]
=> [[1,2,3,4],[5,6],[7,8]]
=> [7,8,5,6,1,2,3,4] => 1
[1,1,0,0,1,1,0,1,0,0]
=> [3,2,2]
=> [[1,2,3],[4,5],[6,7]]
=> [6,7,4,5,1,2,3] => 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [5,6,3,4,1,2] => 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,3,1]
=> [[1,2,3],[4,5,6],[7]]
=> [7,4,5,6,1,2,3] => 1
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,1]
=> [[1,2,3],[4],[5]]
=> [5,4,1,2,3] => 1
[1,1,1,0,0,0,1,1,0,0]
=> [3,3]
=> [[1,2,3],[4,5,6]]
=> [4,5,6,1,2,3] => 1
[1,1,1,0,0,1,0,0,1,0]
=> [4,2]
=> [[1,2,3,4],[5,6]]
=> [5,6,1,2,3,4] => 1
[1,1,1,0,0,1,1,0,0,0]
=> [2,2]
=> [[1,2],[3,4]]
=> [3,4,1,2] => 1
[1,0,1,0,1,0,1,1,0,0,1,0]
=> [5,3,3,2,1]
=> [[1,2,3,4,5],[6,7,8],[9,10,11],[12,13],[14]]
=> [14,12,13,9,10,11,6,7,8,1,2,3,4,5] => ? = 1
[1,0,1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,2,1]
=> [[1,2,3,4,5],[6,7,8,9],[10,11],[12,13],[14]]
=> [14,12,13,10,11,6,7,8,9,1,2,3,4,5] => ? = 1
[1,0,1,0,1,1,0,0,1,1,0,0]
=> [4,4,2,2,1]
=> [[1,2,3,4],[5,6,7,8],[9,10],[11,12],[13]]
=> [13,11,12,9,10,5,6,7,8,1,2,3,4] => ? = 1
[1,0,1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,2,1]
=> [[1,2,3,4,5],[6,7,8],[9,10],[11,12],[13]]
=> [13,11,12,9,10,6,7,8,1,2,3,4,5] => ? = 1
[1,0,1,0,1,1,0,1,1,0,0,0]
=> [3,3,2,2,1]
=> [[1,2,3],[4,5,6],[7,8],[9,10],[11]]
=> [11,9,10,7,8,4,5,6,1,2,3] => ? = 1
[1,0,1,0,1,1,1,0,0,0,1,0]
=> [5,2,2,2,1]
=> [[1,2,3,4,5],[6,7],[8,9],[10,11],[12]]
=> [12,10,11,8,9,6,7,1,2,3,4,5] => ? = 1
[1,0,1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,1]
=> [[1,2,3,4,5],[6,7,8,9],[10,11,12],[13],[14]]
=> [14,13,10,11,12,6,7,8,9,1,2,3,4,5] => ? = 1
[1,0,1,1,0,0,1,0,1,1,0,0]
=> [4,4,3,1,1]
=> [[1,2,3,4],[5,6,7,8],[9,10,11],[12],[13]]
=> [13,12,9,10,11,5,6,7,8,1,2,3,4] => ? = 2
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [5,3,3,1,1]
=> [[1,2,3,4,5],[6,7,8],[9,10,11],[12],[13]]
=> [13,12,9,10,11,6,7,8,1,2,3,4,5] => ? = 2
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [4,3,3,1,1]
=> [[1,2,3,4],[5,6,7],[8,9,10],[11],[12]]
=> [12,11,8,9,10,5,6,7,1,2,3,4] => ? = 1
[1,0,1,1,0,0,1,1,1,0,0,0]
=> [3,3,3,1,1]
=> [[1,2,3],[4,5,6],[7,8,9],[10],[11]]
=> [11,10,7,8,9,4,5,6,1,2,3] => ? = 1
[1,0,1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,1]
=> [[1,2,3,4,5],[6,7,8,9],[10,11],[12],[13]]
=> [13,12,10,11,6,7,8,9,1,2,3,4,5] => ? = 1
[1,0,1,1,0,1,0,0,1,1,0,0]
=> [4,4,2,1,1]
=> [[1,2,3,4],[5,6,7,8],[9,10],[11],[12]]
=> [12,11,9,10,5,6,7,8,1,2,3,4] => ? = 2
[1,0,1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,1]
=> [[1,2,3,4,5],[6,7,8],[9,10],[11],[12]]
=> [12,11,9,10,6,7,8,1,2,3,4,5] => ? = 1
[1,0,1,1,0,1,0,1,1,0,0,0]
=> [3,3,2,1,1]
=> [[1,2,3],[4,5,6],[7,8],[9],[10]]
=> [10,9,7,8,4,5,6,1,2,3] => 1
[1,0,1,1,0,1,1,0,0,0,1,0]
=> [5,2,2,1,1]
=> [[1,2,3,4,5],[6,7],[8,9],[10],[11]]
=> [11,10,8,9,6,7,1,2,3,4,5] => ? = 1
[1,0,1,1,0,1,1,0,0,1,0,0]
=> [4,2,2,1,1]
=> [[1,2,3,4],[5,6],[7,8],[9],[10]]
=> [10,9,7,8,5,6,1,2,3,4] => 1
[1,0,1,1,0,1,1,0,1,0,0,0]
=> [3,2,2,1,1]
=> [[1,2,3],[4,5],[6,7],[8],[9]]
=> [9,8,6,7,4,5,1,2,3] => 1
[1,0,1,1,0,1,1,1,0,0,0,0]
=> [2,2,2,1,1]
=> [[1,2],[3,4],[5,6],[7],[8]]
=> [8,7,5,6,3,4,1,2] => 1
[1,0,1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,1,1]
=> [[1,2,3,4,5],[6,7,8,9],[10],[11],[12]]
=> [12,11,10,6,7,8,9,1,2,3,4,5] => ? = 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [4,4,1,1,1]
=> [[1,2,3,4],[5,6,7,8],[9],[10],[11]]
=> [11,10,9,5,6,7,8,1,2,3,4] => ? = 1
[1,0,1,1,1,0,0,1,0,0,1,0]
=> [5,3,1,1,1]
=> [[1,2,3,4,5],[6,7,8],[9],[10],[11]]
=> [11,10,9,6,7,8,1,2,3,4,5] => ? = 1
[1,0,1,1,1,0,0,1,1,0,0,0]
=> [3,3,1,1,1]
=> [[1,2,3],[4,5,6],[7],[8],[9]]
=> [9,8,7,4,5,6,1,2,3] => 1
[1,0,1,1,1,0,1,0,0,0,1,0]
=> [5,2,1,1,1]
=> [[1,2,3,4,5],[6,7],[8],[9],[10]]
=> [10,9,8,6,7,1,2,3,4,5] => 1
[1,0,1,1,1,1,0,0,0,0,1,0]
=> [5,1,1,1,1]
=> [[1,2,3,4,5],[6],[7],[8],[9]]
=> [9,8,7,6,1,2,3,4,5] => 1
[1,0,1,1,1,1,0,0,1,0,0,0]
=> [3,1,1,1,1]
=> [[1,2,3],[4],[5],[6],[7]]
=> [7,6,5,4,1,2,3] => 1
[1,1,0,0,1,0,1,0,1,1,0,0]
=> [4,4,3,2]
=> [[1,2,3,4],[5,6,7,8],[9,10,11],[12,13]]
=> [12,13,9,10,11,5,6,7,8,1,2,3,4] => ? = 1
[1,1,0,0,1,0,1,1,0,0,1,0]
=> [5,3,3,2]
=> [[1,2,3,4,5],[6,7,8],[9,10,11],[12,13]]
=> [12,13,9,10,11,6,7,8,1,2,3,4,5] => ? = 2
[1,1,0,0,1,0,1,1,0,1,0,0]
=> [4,3,3,2]
=> [[1,2,3,4],[5,6,7],[8,9,10],[11,12]]
=> [11,12,8,9,10,5,6,7,1,2,3,4] => ? = 1
[1,1,0,0,1,0,1,1,1,0,0,0]
=> [3,3,3,2]
=> [[1,2,3],[4,5,6],[7,8,9],[10,11]]
=> [10,11,7,8,9,4,5,6,1,2,3] => ? = 1
[1,1,0,0,1,1,0,0,1,0,1,0]
=> [5,4,2,2]
=> [[1,2,3,4,5],[6,7,8,9],[10,11],[12,13]]
=> [12,13,10,11,6,7,8,9,1,2,3,4,5] => ? = 1
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [4,4,2,2]
=> [[1,2,3,4],[5,6,7,8],[9,10],[11,12]]
=> [11,12,9,10,5,6,7,8,1,2,3,4] => ? = 2
[1,1,0,0,1,1,0,1,0,0,1,0]
=> [5,3,2,2]
=> [[1,2,3,4,5],[6,7,8],[9,10],[11,12]]
=> [11,12,9,10,6,7,8,1,2,3,4,5] => ? = 2
[1,1,0,0,1,1,0,1,0,1,0,0]
=> [4,3,2,2]
=> [[1,2,3,4],[5,6,7],[8,9],[10,11]]
=> [10,11,8,9,5,6,7,1,2,3,4] => ? = 1
[1,1,0,0,1,1,0,1,1,0,0,0]
=> [3,3,2,2]
=> [[1,2,3],[4,5,6],[7,8],[9,10]]
=> [9,10,7,8,4,5,6,1,2,3] => 1
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [5,2,2,2]
=> [[1,2,3,4,5],[6,7],[8,9],[10,11]]
=> [10,11,8,9,6,7,1,2,3,4,5] => ? = 1
[1,1,0,0,1,1,1,0,0,1,0,0]
=> [4,2,2,2]
=> [[1,2,3,4],[5,6],[7,8],[9,10]]
=> [9,10,7,8,5,6,1,2,3,4] => 1
[1,1,0,0,1,1,1,0,1,0,0,0]
=> [3,2,2,2]
=> [[1,2,3],[4,5],[6,7],[8,9]]
=> [8,9,6,7,4,5,1,2,3] => 1
[1,1,0,0,1,1,1,1,0,0,0,0]
=> [2,2,2,2]
=> [[1,2],[3,4],[5,6],[7,8]]
=> [7,8,5,6,3,4,1,2] => 1
[1,1,0,1,0,0,1,0,1,1,0,0]
=> [4,4,3,1]
=> [[1,2,3,4],[5,6,7,8],[9,10,11],[12]]
=> [12,9,10,11,5,6,7,8,1,2,3,4] => ? = 1
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [5,3,3,1]
=> [[1,2,3,4,5],[6,7,8],[9,10,11],[12]]
=> [12,9,10,11,6,7,8,1,2,3,4,5] => ? = 1
[1,1,0,1,0,0,1,1,0,1,0,0]
=> [4,3,3,1]
=> [[1,2,3,4],[5,6,7],[8,9,10],[11]]
=> [11,8,9,10,5,6,7,1,2,3,4] => ? = 1
[1,1,0,1,0,0,1,1,1,0,0,0]
=> [3,3,3,1]
=> [[1,2,3],[4,5,6],[7,8,9],[10]]
=> [10,7,8,9,4,5,6,1,2,3] => 1
[1,1,0,1,0,1,0,0,1,1,0,0]
=> [4,4,2,1]
=> [[1,2,3,4],[5,6,7,8],[9,10],[11]]
=> [11,9,10,5,6,7,8,1,2,3,4] => ? = 1
[1,1,0,1,0,1,1,0,0,1,0,0]
=> [4,2,2,1]
=> [[1,2,3,4],[5,6],[7,8],[9]]
=> [9,7,8,5,6,1,2,3,4] => 1
[1,1,0,1,1,0,0,0,1,1,0,0]
=> [4,4,1,1]
=> [[1,2,3,4],[5,6,7,8],[9],[10]]
=> [10,9,5,6,7,8,1,2,3,4] => 1
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [5,3,1,1]
=> [[1,2,3,4,5],[6,7,8],[9],[10]]
=> [10,9,6,7,8,1,2,3,4,5] => 1
[1,1,0,1,1,0,0,1,0,1,0,0]
=> [4,3,1,1]
=> [[1,2,3,4],[5,6,7],[8],[9]]
=> [9,8,5,6,7,1,2,3,4] => 1
[1,1,0,1,1,0,0,1,1,0,0,0]
=> [3,3,1,1]
=> [[1,2,3],[4,5,6],[7],[8]]
=> [8,7,4,5,6,1,2,3] => 1
[1,1,0,1,1,0,1,0,0,1,0,0]
=> [4,2,1,1]
=> [[1,2,3,4],[5,6],[7],[8]]
=> [8,7,5,6,1,2,3,4] => 1
[1,1,0,1,1,0,1,1,0,0,0,0]
=> [2,2,1,1]
=> [[1,2],[3,4],[5],[6]]
=> [6,5,3,4,1,2] => 1
[1,1,0,1,1,1,0,0,0,1,0,0]
=> [4,1,1,1]
=> [[1,2,3,4],[5],[6],[7]]
=> [7,6,5,1,2,3,4] => 1
[1,1,1,0,0,0,1,0,1,1,0,0]
=> [4,4,3]
=> [[1,2,3,4],[5,6,7,8],[9,10,11]]
=> [9,10,11,5,6,7,8,1,2,3,4] => ? = 1
[1,1,1,0,0,0,1,1,0,0,1,0]
=> [5,3,3]
=> [[1,2,3,4,5],[6,7,8],[9,10,11]]
=> [9,10,11,6,7,8,1,2,3,4,5] => ? = 1
[1,1,1,0,0,0,1,1,0,1,0,0]
=> [4,3,3]
=> [[1,2,3,4],[5,6,7],[8,9,10]]
=> [8,9,10,5,6,7,1,2,3,4] => 1
[1,1,1,0,0,0,1,1,1,0,0,0]
=> [3,3,3]
=> [[1,2,3],[4,5,6],[7,8,9]]
=> [7,8,9,4,5,6,1,2,3] => 1
[1,1,1,0,0,1,0,0,1,0,1,0]
=> [5,4,2]
=> [[1,2,3,4,5],[6,7,8,9],[10,11]]
=> [10,11,6,7,8,9,1,2,3,4,5] => ? = 1
[1,1,1,0,0,1,0,0,1,1,0,0]
=> [4,4,2]
=> [[1,2,3,4],[5,6,7,8],[9,10]]
=> [9,10,5,6,7,8,1,2,3,4] => 1
[1,1,1,0,0,1,0,1,0,0,1,0]
=> [5,3,2]
=> [[1,2,3,4,5],[6,7,8],[9,10]]
=> [9,10,6,7,8,1,2,3,4,5] => 1
[1,1,1,0,0,1,0,1,1,0,0,0]
=> [3,3,2]
=> [[1,2,3],[4,5,6],[7,8]]
=> [7,8,4,5,6,1,2,3] => 1
[1,1,1,0,0,1,1,0,0,0,1,0]
=> [5,2,2]
=> [[1,2,3,4,5],[6,7],[8,9]]
=> [8,9,6,7,1,2,3,4,5] => 1
[1,1,1,0,0,1,1,0,0,1,0,0]
=> [4,2,2]
=> [[1,2,3,4],[5,6],[7,8]]
=> [7,8,5,6,1,2,3,4] => 1
[1,1,1,0,0,1,1,0,1,0,0,0]
=> [3,2,2]
=> [[1,2,3],[4,5],[6,7]]
=> [6,7,4,5,1,2,3] => 1
[1,1,1,0,0,1,1,1,0,0,0,0]
=> [2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [5,6,3,4,1,2] => 1
[1,1,1,0,1,0,0,0,1,1,0,0]
=> [4,4,1]
=> [[1,2,3,4],[5,6,7,8],[9]]
=> [9,5,6,7,8,1,2,3,4] => 1
[1,1,1,0,1,0,0,1,0,0,1,0]
=> [5,3,1]
=> [[1,2,3,4,5],[6,7,8],[9]]
=> [9,6,7,8,1,2,3,4,5] => 1
[1,1,1,0,1,0,0,1,1,0,0,0]
=> [3,3,1]
=> [[1,2,3],[4,5,6],[7]]
=> [7,4,5,6,1,2,3] => 1
[1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [6,4,4,3,2,1]
=> [[1,2,3,4,5,6],[7,8,9,10],[11,12,13,14],[15,16,17],[18,19],[20]]
=> ? => ? = 1
[1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3,2,1]
=> [[1,2,3,4,5,6],[7,8,9,10,11],[12,13,14],[15,16,17],[18,19],[20]]
=> ? => ? = 1
[1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> [5,5,3,3,2,1]
=> [[1,2,3,4,5],[6,7,8,9,10],[11,12,13],[14,15,16],[17,18],[19]]
=> ? => ? = 1
[1,0,1,0,1,0,1,1,0,1,0,0,1,0]
=> [6,4,3,3,2,1]
=> [[1,2,3,4,5,6],[7,8,9,10],[11,12,13],[14,15,16],[17,18],[19]]
=> ? => ? = 1
[1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [6,5,4,2,2,1]
=> [[1,2,3,4,5,6],[7,8,9,10,11],[12,13,14,15],[16,17],[18,19],[20]]
=> ? => ? = 1
[1,0,1,0,1,1,0,0,1,0,1,1,0,0]
=> [5,5,4,2,2,1]
=> [[1,2,3,4,5],[6,7,8,9,10],[11,12,13,14],[15,16],[17,18],[19]]
=> ? => ? = 2
[1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [6,4,4,2,2,1]
=> [[1,2,3,4,5,6],[7,8,9,10],[11,12,13,14],[15,16],[17,18],[19]]
=> ? => ? = 2
[1,0,1,0,1,1,0,0,1,1,0,1,0,0]
=> [5,4,4,2,2,1]
=> [[1,2,3,4,5],[6,7,8,9],[10,11,12,13],[14,15],[16,17],[18]]
=> ? => ? = 1
[1,0,1,0,1,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,2,1]
=> [[1,2,3,4,5,6],[7,8,9,10,11],[12,13,14],[15,16],[17,18],[19]]
=> ? => ? = 1
[1,0,1,0,1,1,0,1,0,0,1,1,0,0]
=> [5,5,3,2,2,1]
=> [[1,2,3,4,5],[6,7,8,9,10],[11,12,13],[14,15],[16,17],[18]]
=> ? => ? = 2
[1,0,1,0,1,1,0,1,0,1,0,0,1,0]
=> [6,4,3,2,2,1]
=> [[1,2,3,4,5,6],[7,8,9,10],[11,12,13],[14,15],[16,17],[18]]
=> ? => ? = 1
[1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,1,1]
=> [[1,2,3,4,5,6],[7,8,9,10,11],[12,13,14,15],[16,17,18],[19],[20]]
=> ? => ? = 1
[1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> [5,5,4,3,1,1]
=> [[1,2,3,4,5],[6,7,8,9,10],[11,12,13,14],[15,16,17],[18],[19]]
=> ? => ? = 2
[1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> [6,4,4,3,1,1]
=> [[1,2,3,4,5,6],[7,8,9,10],[11,12,13,14],[15,16,17],[18],[19]]
=> ? => ? = 2
[1,0,1,1,0,0,1,0,1,1,0,1,0,0]
=> [5,4,4,3,1,1]
=> [[1,2,3,4,5],[6,7,8,9],[10,11,12,13],[14,15,16],[17],[18]]
=> ? => ? = 2
[1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [6,5,3,3,1,1]
=> [[1,2,3,4,5,6],[7,8,9,10,11],[12,13,14],[15,16,17],[18],[19]]
=> ? => ? = 2
Description
The maximal size of a rise in a permutation.
This is $\max_i \sigma_{i+1}-\sigma_i$, except for the permutations without rises, where it is $0$.
The following 499 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000742The number of big ascents of a permutation after prepending zero. St000745The index of the last row whose first entry is the row number in a standard Young tableau. St000057The Shynar inversion number of a standard tableau. St000218The number of occurrences of the pattern 213 in a permutation. St000220The number of occurrences of the pattern 132 in a permutation. St000356The number of occurrences of the pattern 13-2. St000405The number of occurrences of the pattern 1324 in a permutation. St000534The number of 2-rises of a permutation. St000731The number of double exceedences of a permutation. St000842The breadth of a permutation. St000871The number of very big ascents of a permutation. St001083The number of boxed occurrences of 132 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. St000374The number of exclusive right-to-left minima of 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. St000451The length of the longest pattern of the form k 1 2. St001568The smallest positive integer that does not appear twice in the partition. St001394The genus of a permutation. St000366The number of double descents of a permutation. St000371The number of mid points of decreasing subsequences of length 3 in a permutation. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St000404The number of occurrences of the pattern 3241 or of the pattern 4231 in a permutation. St000862The number of parts of the shifted shape of a permutation. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St000993The multiplicity of the largest part of an integer partition. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. 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. St000929The constant term of the character polynomial of an integer partition. St001162The minimum jump of a permutation. St001344The neighbouring number of a permutation. St001665The number of pure excedances of a permutation. St000358The number of occurrences of the pattern 31-2. St000360The number of occurrences of the pattern 32-1. St000367The number of simsun double descents of a permutation. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$. St000406The number of occurrences of the pattern 3241 in a permutation. St000407The number of occurrences of the pattern 2143 in a permutation. St000622The number of occurrences of the patterns 2143 or 4231 in a permutation. St000623The number of occurrences of the pattern 52341 in a permutation. 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. St000801The number of occurrences of the vincular pattern |312 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000989The number of final rises of a permutation. St001381The fertility of a permutation. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St001513The number of nested exceedences of a permutation. St001550The number of inversions between exceedances where the greater 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. St001663The number of occurrences of the Hertzsprung pattern 132 in a permutation. St001715The number of non-records in a permutation. St001728The number of invisible descents of a permutation. St001741The largest integer such that all patterns of this size are contained in the permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001847The number of occurrences of the pattern 1432 in a permutation. St001624The breadth of a lattice. 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. St000119The number of occurrences of the pattern 321 in a permutation. St000123The difference in Coxeter length of a permutation and its image under the Simion-Schmidt map. St000223The number of nestings in the permutation. St000768The number of peaks in an integer composition. St001537The number of cyclic crossings of a permutation. St001549The number of restricted non-inversions between exceedances. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St000763The sum of the positions of the strong records of an integer composition. St000805The number of peaks of the associated bargraph. St000455The second largest eigenvalue of a graph if it is integral. St000761The number of ascents in an integer composition. St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001498The normalised height of a Nakayama algebra with magnitude 1. St000036The evaluation at 1 of the Kazhdan-Lusztig polynomial with parameters given by the identity and the permutation. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St000264The girth of a graph, which is not a tree. St000065The number of entries equal to -1 in an alternating sign matrix. St000687The dimension of $Hom(I,P)$ for the LNakayama algebra of a Dyck path. St000007The number of saliances of the permutation. St000214The number of adjacencies of a permutation. St000215The number of adjacencies of a permutation, zero appended. St000617The number of global maxima of a Dyck path. St000999Number of indecomposable projective module with injective 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. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001493The number of simple modules with maximal even projective dimension 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. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St000266The number of spanning subgraphs of a graph with the same connected components. St000267The number of maximal spanning forests contained in a graph. St000671The maximin edge-connectivity for choosing a subgraph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000775The multiplicity of the largest eigenvalue in a graph. St000785The number of distinct colouring schemes of a graph. St001272The number of graphs with the same degree sequence. St001316The domatic number of a graph. St001353The number of prime nodes in the modular decomposition of a graph. St001395The number of strictly unfriendly partitions of a graph. St001475The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,0). St001476The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,-1). St001496The number of graphs with the same Laplacian spectrum as the given graph. St001546The number of monomials in the Tutte polynomial of a graph. St000283The size of the preimage of the map 'to graph' from Binary trees to Graphs. St000323The minimal crossing number of a graph. St000351The determinant of the adjacency matrix of a graph. St000368The Altshuler-Steinberg determinant of a graph. St000370The genus of a graph. St000379The number of Hamiltonian cycles in a graph. St000403The Szeged index minus the Wiener index of a graph. St000636The hull number of a graph. St000637The length of the longest cycle in a graph. St000699The toughness times the least common multiple of 1,. St000948The chromatic discriminant of a graph. St001029The size of the core of a graph. St001069The coefficient of the monomial xy of the Tutte polynomial of the graph. St001070The absolute value of the derivative of the chromatic polynomial of the graph at 1. St001071The beta invariant of the graph. St001109The number of proper colourings of a graph with as few colours as possible. St001111The weak 2-dynamic chromatic number of a graph. St001119The length of a shortest maximal path in a graph. St001271The competition number of a graph. St001281The normalized isoperimetric number of a graph. St001305The number of induced cycles on four vertices in a graph. St001307The number of induced stars on four vertices in a graph. St001309The number of four-cliques in a graph. St001310The number of induced diamond graphs in a graph. St001311The cyclomatic number of a graph. St001317The minimal number of occurrences of the forest-pattern in a linear ordering of the vertices of the graph. St001320The minimal number of occurrences of the path-pattern in a linear ordering of the vertices of the graph. St001323The independence gap of a graph. St001324The minimal number of occurrences of the chordal-pattern in a linear ordering of the vertices of the graph. St001325The minimal number of occurrences of the comparability-pattern in a linear ordering of the vertices of the graph. St001326The minimal number of occurrences of the interval-pattern in a linear ordering of the vertices of the graph. St001328The minimal number of occurrences of the bipartite-pattern in a linear ordering of the vertices of the graph. St001329The minimal number of occurrences of the outerplanar pattern in a linear ordering of the vertices of the graph. St001331The size of the minimal feedback vertex set. St001334The minimal number of occurrences of the 3-colorable pattern in a linear ordering of the vertices of the graph. St001335The cardinality of a minimal cycle-isolating set of a graph. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001354The number of series nodes in the modular decomposition of a graph. St001357The maximal degree of a regular spanning subgraph of a graph. St001367The smallest number which does not occur as degree of a vertex in a graph. St001638The book thickness of a graph. St001654The monophonic hull number of a graph. St001689The number of celebrities in a graph. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001716The 1-improper chromatic number of a graph. St001736The total number of cycles in a graph. St001793The difference between the clique number and the chromatic number of a graph. St001794Half the number of sets of vertices in a graph which are dominating and non-blocking. St001795The binary logarithm of the evaluation of the Tutte polynomial of the graph at (x,y) equal to (-1,-1). St001796The absolute value of the quotient of the Tutte polynomial of the graph at (1,1) and (-1,-1). St001797The number of overfull subgraphs of a graph. St001116The game chromatic number of a graph. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St001743The discrepancy of a graph. St001826The maximal number of leaves on a vertex of a graph. St000268The number of strongly connected orientations of a graph. St000344The number of strongly connected outdegree sequences of a graph. St001073The number of nowhere zero 3-flows of a graph. St001327The minimal number of occurrences of the split-pattern in a linear ordering of the vertices of the graph. St001477The number of nowhere zero 5-flows of a graph. St001478The number of nowhere zero 4-flows of a graph. St000255The number of reduced Kogan faces with the permutation as type. St000326The position of the first one in a binary word after appending a 1 at the end. St000627The exponent of a binary word. St000876The number of factors in the Catalan decomposition of a binary word. St001322The size of a minimal independent dominating set in a graph. St001333The cardinality of a minimal edge-isolating set of a graph. St001339The irredundance number of a graph. St001340The cardinality of a minimal non-edge isolating set of a graph. St001363The Euler characteristic of a graph according to Knill. St001393The induced matching number of a graph. St000042The number of crossings of a perfect matching. St000296The length of the symmetric border of a binary word. St000629The defect of a binary word. St000733The row containing the largest entry of a standard tableau. St000877The depth of the binary word interpreted as a path. 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. St001047The maximal number of arcs crossing a given arc of a perfect matching. St001261The Castelnuovo-Mumford regularity of a graph. St001306The number of induced paths on four vertices in a graph. St001356The number of vertices in prime modules of a graph. St001256Number of simple reflexive modules that are 2-stable reflexive. St001330The hat guessing number of a graph. St000078The number of alternating sign matrices whose left key is the permutation. St000546The number of global descents of a permutation. 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. St000570The Edelman-Greene number of a permutation. St000685The dominant dimension of the LNakayama algebra associated to a Dyck path. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St000889The number of alternating sign matrices with the same antidiagonal sums. St000968We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n−1}]$ by adding $c_0$ to $c_{n−1}$. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. 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. 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]/(x^n)$. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001257The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001273The projective dimension of the first term in an injective coresolution of the regular module. 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. St001481The minimal height of a peak of a Dyck path. St001859The number of factors of the Stanley symmetric function associated with a permutation. St000217The number of occurrences of the pattern 312 in a permutation. St000234The number of global ascents of a permutation. St000317The cycle descent number of a permutation. St000516The number of stretching pairs of a permutation. St000674The number of hills of a Dyck path. St000709The number of occurrences of 14-2-3 or 14-3-2. St000803The number of occurrences of the vincular pattern |132 in a permutation. St000879The number of long braid edges in the graph of braid moves of a permutation. 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. St001025Number of simple modules with projective dimension 4 in the Nakayama algebra corresponding to the Dyck path. St001037The number of inner corners of the upper path of the parallelogram polyomino associated with the Dyck path. St001059Number of occurrences of the patterns 41352,42351,51342,52341 in a permutation. 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. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. 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. 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. St001193The dimension of $Ext_A^1(A/AeA,A)$ in the corresponding Nakayama algebra $A$ such that $eA$ is a minimal faithful projective-injective module. 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$. St001204Call 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. 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$. 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. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. 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. St001234The number of indecomposable three dimensional modules with projective dimension one. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001434The number of negative sum pairs of a signed permutation. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001705The number of occurrences of the pattern 2413 in a permutation. St001766The number of cells which are not occupied by the same tile in all reduced pipe dreams corresponding to a permutation. St001613The binary logarithm of the size of the center of a lattice. St001681The number of inclusion-wise minimal subsets of a lattice, whose meet is the bottom element. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001881The number of factors of a lattice as a Cartesian product of lattices. St000117The number of centered tunnels of 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. St001677The number of non-degenerate subsets of a lattice whose meet is the bottom element. St001845The number of join irreducibles minus the rank of a lattice. St000788The number of nesting-similar perfect matchings of a perfect matching. St000787The number of flips required to make a perfect matching noncrossing. St001570The minimal number of edges to add to make a graph Hamiltonian. St001060The distinguishing index of a graph. St001260The permanent of an alternating sign matrix. St000508Eigenvalues of the random-to-random operator acting on a simple module. St001947The number of ties in a parking function. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St000260The radius of a connected graph. St000259The diameter of a connected graph. St000022The number of fixed points of a permutation. St000153The number of adjacent cycles of a permutation. St000298The order dimension or Dushnik-Miller dimension of a poset. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St000322The skewness of a graph. St001964The interval resolution global dimension of a poset. St000054The first entry of the permutation. St000056The decomposition (or block) number of a permutation. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000486The number of cycles of length at least 3 of a permutation. St000694The number of affine bounded permutations that project to a given permutation. St000717The number of ordinal summands of a poset. St000832The number of permutations obtained by reversing blocks of three consecutive numbers. St001081The number of minimal length factorizations of a permutation into star transpositions. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. 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)$. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001461The number of topologically connected components of the chord diagram of a permutation. St001590The crossing number of a perfect matching. St001661Half the permanent of the Identity matrix plus the permutation matrix associated to the permutation. St001830The chord expansion number of a perfect matching. St001832The number of non-crossing perfect matchings in the chord expansion of a perfect matching. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St000221The number of strong fixed points of a permutation. St000279The size of the preimage of the map 'cycle-as-one-line notation' from Permutations to Permutations. 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. St000488The number of cycles of a permutation of length at most 2. St000489The number of cycles of a permutation of length at most 3. St000666The number of right tethers of a permutation. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001130The number of two successive successions in a permutation. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St001444The rank of the skew-symmetric form which is non-zero on crossing arcs of a perfect matching. St001469The holeyness of a permutation. St001810The number of fixed points of a permutation smaller than its largest moved point. St001811The Castelnuovo-Mumford regularity of a permutation. St001831The multiplicity of the non-nesting perfect matching in the chord expansion 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. St000741The Colin de Verdière graph invariant. 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. 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. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St000028The number of stack-sorts needed to sort a permutation. St000359The number of occurrences of the pattern 23-1. 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. St000667The greatest common divisor of the parts of the partition. St000990The first ascent of a permutation. St000996The number of exclusive left-to-right maxima of a permutation. St001043The depth of the leaf closest to the root in the binary unordered tree associated with the perfect matching. St001468The smallest fixpoint of a permutation. St001737The number of descents of type 2 in a permutation. St000124The cardinality of the preimage of the Simion-Schmidt map. St000210Minimum over maximum difference of elements in cycles. St000355The number of occurrences of the pattern 21-3. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000715The number of semistandard Young tableaux of given shape and entries at most 3. St000799The number of occurrences of the vincular pattern |213 in a permutation. St000800The number of occurrences of the vincular pattern |231 in a permutation. St001084The number of occurrences of the vincular pattern |1-23 in a permutation. St001087The number of occurrences of the vincular pattern |12-3 in a permutation. 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. St001133The smallest label in the subtree rooted at the sister of 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St000477The weight of a partition according to Alladi. St000478Another weight of a partition according to Alladi. St000232The number of crossings of a set partition. St000233The number of nestings of a set partition. St000496The rcs statistic of a set partition. St000716The dimension of the irreducible representation of Sp(6) labelled by an integer partition. St000793The length of the longest partition in the vacillating tableau corresponding to a set partition. St000962The 3-shifted major index of a permutation. St001722The number of minimal chains with small intervals between a binary word and the top element. 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$. St000253The crossing number of a set partition. St000254The nesting number of a set partition. St000352The Elizalde-Pak rank of a permutation. St000695The number of blocks in the first part of the atomic decomposition of a set partition. St000730The maximal arc length of a set partition. St000491The number of inversions of a set partition. St000497The lcb statistic of a set partition. St000555The number of occurrences of the pattern {{1,3},{2}} in a set partition. St000559The number of occurrences of the pattern {{1,3},{2,4}} in a set partition. St000562The number of internal points of a set partition. St000563The number of overlapping pairs of blocks of a set partition. St000565The major index of a set partition. St000572The dimension exponent of a set partition. St000581The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 2 is maximal. St000582The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 3 is maximal, (1,3) are consecutive in a block. St000585The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal, (1,3) are consecutive in a block. St000594The number of occurrences of the pattern {{1,3},{2}} such that 1,2 are minimal, (1,3) are consecutive in a block. St000600The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, (1,3) are consecutive in a block. St000602The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal. St000610The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal. St000613The number of occurrences of the pattern {{1,3},{2}} such that 2 is minimal, 3 is maximal, (1,3) are consecutive in a block. St000748The major index of the permutation obtained by flattening the set partition. St001545The second Elser number of a connected graph. St000883The number of longest increasing subsequences of a permutation. St000058The order of a permutation. St000091The descent variation of a composition. St001745The number of occurrences of the arrow pattern 13 with an arrow from 1 to 2 in a permutation. St001781The interlacing number of a set partition. St001784The minimum of the smallest closer and the second element of the block containing 1 in a set partition. St001816Eigenvalues of the top-to-random operator acting on a simple module. St001839The number of excedances of a set partition. St001840The number of descents of a set partition. St001841The number of inversions of a set partition. St001842The major index of a set partition. St001843The Z-index of a set partition. St001132The number of leaves in the subtree whose sister has label 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St000664The number of right ropes of a permutation. St000754The Grundy value for the game of removing nestings in a perfect matching. St001771The number of occurrences of the signed pattern 1-2 in a signed permutation. St001866The nesting alignments of a signed permutation. St001870The number of positive entries followed by a negative entry in a signed permutation. St001895The oddness of a signed permutation. St000896The number of zeros on the main diagonal of an alternating sign matrix. St001118The acyclic chromatic index of a graph. St000460The hook length of the last cell along the main diagonal of an integer partition. St000461The rix statistic of a permutation. St000237The number of small exceedances. St000480The number of lower covers of a partition in dominance order. St000481The number of upper covers of a partition in dominance order. St000846The maximal number of elements covering an element of a poset. St001616The number of neutral elements in a lattice. St001720The minimal length of a chain of small intervals in a lattice. St000159The number of distinct parts of the integer partition. St001432The order dimension of the partition. St000891The number of distinct diagonal sums of a permutation matrix. St000066The column of the unique '1' in the first row of the alternating sign matrix. St000297The number of leading ones in a binary word. St000353The number of inner valleys of a permutation. St000872The number of very big descents of a permutation. St000097The order of the largest clique of the graph. St000738The first entry in the last row of a standard tableau. St000836The number of descents of distance 2 of a permutation. St001820The size of the image of the pop stack sorting operator. St000834The number of right outer peaks of a permutation. St001846The number of elements which do not have a complement in the lattice. St000402Half the size of the symmetry class of a permutation. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000286The number of connected components of the complement of a graph. St000287The number of connected components of a graph. St000310The minimal degree of a vertex of a graph. St000632The jump number of the poset. St001518The number of graphs with the same ordinary spectrum as the given graph. St000095The number of triangles of a graph. St000096The number of spanning trees of a graph. St000274The number of perfect matchings of a graph. St000276The size of the preimage of the map 'to graph' from Ordered trees to Graphs. 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. St000447The number of pairs of vertices of a graph with distance 3. St000449The number of pairs of vertices of a graph with distance 4. St000845The maximal number of elements covered by an element in a poset. St001536The number of cyclic misalignments of a permutation. 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. St001575The minimal number of edges to add or remove to make a graph edge transitive. 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. 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. St001827The number of two-component spanning forests of a graph. St001871The number of triconnected components of a graph. St000031The number of cycles in the cycle decomposition of a permutation. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St000485The length of the longest cycle of a permutation. St000662The staircase size of the code of a permutation. St000779The tier of a permutation. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St000401The size of the symmetry class of a permutation. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001627The number of coloured connected graphs such that the multiplicities of colours are given by a partition. St000838The number of terminal right-hand endpoints when the vertices are written in order. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St000011The number of touch points (or returns) of a Dyck path. St000002The number of occurrences of the pattern 123 in a permutation. St001005The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both. St001621The number of atoms of a lattice. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000441The number of successions of a permutation. St000665The number of rafts of a permutation. St001625The Möbius invariant of a lattice. St000439The position of the first down step of a Dyck path. St000069The number of maximal elements of a poset. St000035The number of left outer peaks of a permutation. St000098The chromatic number of a graph. St000183The side length of the Durfee square of an integer partition. St000454The largest eigenvalue of a graph if it is integral. St000648The number of 2-excedences of a permutation. St000654The first descent of a permutation. St000864The number of circled entries of the shifted recording tableau of a permutation. St000873The aix statistic of a permutation. St000894The trace of an alternating sign matrix. St001114The number of odd descents of a permutation. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001644The dimension of a graph. St001004The number of indices that are either left-to-right maxima or right-to-left minima. St000245The number of ascents of a permutation. St000633The size of the automorphism group of a poset. St001399The distinguishing number of a poset. St000652The maximal difference between successive positions of a permutation. St000729The minimal arc length of a set partition. St001051The depth of the label 1 in the decreasing labelled unordered tree associated with the set partition. St001652The length of a longest interval of consecutive numbers. St001662The length of the longest factor of consecutive numbers in a permutation. St001729The number of visible descents of a permutation. St001735The number of permutations with the same set of runs. St000241The number of cyclical small excedances. St000425The number of occurrences of the pattern 132 or of the pattern 213 in a permutation. St000646The number of big ascents of a permutation. St000650The number of 3-rises of a permutation. St000663The number of right floats of a permutation. St000710The number of big deficiencies of a permutation. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset.
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!