Processing math: 100%

Your data matches 423 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
St001481: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> 1
[1,0,1,0]
=> 1
[1,1,0,0]
=> 2
[1,0,1,0,1,0]
=> 1
[1,0,1,1,0,0]
=> 1
[1,1,0,0,1,0]
=> 1
[1,1,0,1,0,0]
=> 2
[1,1,1,0,0,0]
=> 3
[1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,1,0,0]
=> 1
[1,0,1,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,0]
=> 1
[1,0,1,1,1,0,0,0]
=> 1
[1,1,0,0,1,0,1,0]
=> 1
[1,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,0]
=> 2
[1,1,0,1,1,0,0,0]
=> 2
[1,1,1,0,0,0,1,0]
=> 1
[1,1,1,0,0,1,0,0]
=> 2
[1,1,1,0,1,0,0,0]
=> 3
[1,1,1,1,0,0,0,0]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> 2
Description
The minimal height of a peak of a Dyck path.
Mp00026: Dyck paths to ordered treeOrdered trees
St000700: Ordered trees ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [[]]
=> 1
[1,0,1,0]
=> [[],[]]
=> 1
[1,1,0,0]
=> [[[]]]
=> 2
[1,0,1,0,1,0]
=> [[],[],[]]
=> 1
[1,0,1,1,0,0]
=> [[],[[]]]
=> 1
[1,1,0,0,1,0]
=> [[[]],[]]
=> 1
[1,1,0,1,0,0]
=> [[[],[]]]
=> 2
[1,1,1,0,0,0]
=> [[[[]]]]
=> 3
[1,0,1,0,1,0,1,0]
=> [[],[],[],[]]
=> 1
[1,0,1,0,1,1,0,0]
=> [[],[],[[]]]
=> 1
[1,0,1,1,0,0,1,0]
=> [[],[[]],[]]
=> 1
[1,0,1,1,0,1,0,0]
=> [[],[[],[]]]
=> 1
[1,0,1,1,1,0,0,0]
=> [[],[[[]]]]
=> 1
[1,1,0,0,1,0,1,0]
=> [[[]],[],[]]
=> 1
[1,1,0,0,1,1,0,0]
=> [[[]],[[]]]
=> 2
[1,1,0,1,0,0,1,0]
=> [[[],[]],[]]
=> 1
[1,1,0,1,0,1,0,0]
=> [[[],[],[]]]
=> 2
[1,1,0,1,1,0,0,0]
=> [[[],[[]]]]
=> 2
[1,1,1,0,0,0,1,0]
=> [[[[]]],[]]
=> 1
[1,1,1,0,0,1,0,0]
=> [[[[]],[]]]
=> 2
[1,1,1,0,1,0,0,0]
=> [[[[],[]]]]
=> 3
[1,1,1,1,0,0,0,0]
=> [[[[[]]]]]
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [[],[],[],[],[]]
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [[],[],[],[[]]]
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [[],[],[[]],[]]
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [[],[],[[],[]]]
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [[],[],[[[]]]]
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [[],[[]],[],[]]
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [[],[[]],[[]]]
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [[],[[],[]],[]]
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [[],[[],[],[]]]
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [[],[[],[[]]]]
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [[],[[[]]],[]]
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [[],[[[]],[]]]
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [[],[[[],[]]]]
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [[],[[[[]]]]]
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [[[]],[],[],[]]
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [[[]],[],[[]]]
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [[[]],[[]],[]]
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [[[]],[[],[]]]
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [[[]],[[[]]]]
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [[[],[]],[],[]]
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [[[],[]],[[]]]
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [[[],[],[]],[]]
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [[[],[],[],[]]]
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [[[],[],[[]]]]
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [[[],[[]]],[]]
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [[[],[[]],[]]]
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [[[],[[],[]]]]
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [[[],[[[]]]]]
=> 2
Description
The protection number of an ordered tree. This is the minimal distance from the root to a leaf.
Mp00100: Dyck paths touch compositionInteger compositions
St000765: Integer compositions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => 1
[1,0,1,0]
=> [1,1] => 2
[1,1,0,0]
=> [2] => 1
[1,0,1,0,1,0]
=> [1,1,1] => 3
[1,0,1,1,0,0]
=> [1,2] => 2
[1,1,0,0,1,0]
=> [2,1] => 1
[1,1,0,1,0,0]
=> [3] => 1
[1,1,1,0,0,0]
=> [3] => 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => 4
[1,0,1,0,1,1,0,0]
=> [1,1,2] => 3
[1,0,1,1,0,0,1,0]
=> [1,2,1] => 2
[1,0,1,1,0,1,0,0]
=> [1,3] => 2
[1,0,1,1,1,0,0,0]
=> [1,3] => 2
[1,1,0,0,1,0,1,0]
=> [2,1,1] => 1
[1,1,0,0,1,1,0,0]
=> [2,2] => 2
[1,1,0,1,0,0,1,0]
=> [3,1] => 1
[1,1,0,1,0,1,0,0]
=> [4] => 1
[1,1,0,1,1,0,0,0]
=> [4] => 1
[1,1,1,0,0,0,1,0]
=> [3,1] => 1
[1,1,1,0,0,1,0,0]
=> [4] => 1
[1,1,1,0,1,0,0,0]
=> [4] => 1
[1,1,1,1,0,0,0,0]
=> [4] => 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => 4
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => 3
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,3] => 3
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => 3
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => 3
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,1] => 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,4] => 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,4] => 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,4] => 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,4] => 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => 2
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => 2
[1,1,0,0,1,1,0,1,0,0]
=> [2,3] => 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => 2
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,1] => 1
[1,1,0,1,0,0,1,1,0,0]
=> [3,2] => 1
[1,1,0,1,0,1,0,0,1,0]
=> [4,1] => 1
[1,1,0,1,0,1,0,1,0,0]
=> [5] => 1
[1,1,0,1,0,1,1,0,0,0]
=> [5] => 1
[1,1,0,1,1,0,0,0,1,0]
=> [4,1] => 1
[1,1,0,1,1,0,0,1,0,0]
=> [5] => 1
[1,1,0,1,1,0,1,0,0,0]
=> [5] => 1
[1,1,0,1,1,1,0,0,0,0]
=> [5] => 1
Description
The number of weak records in an integer composition. A weak record is an element ai such that aiaj for all j<i.
Mp00242: Dyck paths Hessenberg posetPosets
St000908: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> ([],1)
=> 1
[1,0,1,0]
=> ([(0,1)],2)
=> 1
[1,1,0,0]
=> ([],2)
=> 2
[1,0,1,0,1,0]
=> ([(0,2),(2,1)],3)
=> 1
[1,0,1,1,0,0]
=> ([(0,2),(1,2)],3)
=> 1
[1,1,0,0,1,0]
=> ([(0,1),(0,2)],3)
=> 1
[1,1,0,1,0,0]
=> ([(1,2)],3)
=> 2
[1,1,1,0,0,0]
=> ([],3)
=> 3
[1,0,1,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> 1
[1,0,1,0,1,1,0,0]
=> ([(0,3),(1,3),(3,2)],4)
=> 1
[1,0,1,1,0,0,1,0]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,0,1,0,0]
=> ([(0,3),(1,2),(2,3)],4)
=> 1
[1,0,1,1,1,0,0,0]
=> ([(0,3),(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,0,1,0]
=> ([(0,3),(3,1),(3,2)],4)
=> 1
[1,1,0,0,1,1,0,0]
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
[1,1,0,1,0,0,1,0]
=> ([(0,2),(0,3),(3,1)],4)
=> 1
[1,1,0,1,0,1,0,0]
=> ([(0,3),(1,2),(1,3)],4)
=> 2
[1,1,0,1,1,0,0,0]
=> ([(1,3),(2,3)],4)
=> 2
[1,1,1,0,0,0,1,0]
=> ([(0,1),(0,2),(0,3)],4)
=> 1
[1,1,1,0,0,1,0,0]
=> ([(1,2),(1,3)],4)
=> 2
[1,1,1,0,1,0,0,0]
=> ([(2,3)],4)
=> 3
[1,1,1,1,0,0,0,0]
=> ([],4)
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> ([(0,4),(2,3),(3,1),(4,2)],5)
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> ([(0,4),(1,4),(2,3),(4,2)],5)
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> ([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> ([(0,4),(1,2),(2,4),(4,3)],5)
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> ([(0,4),(1,4),(2,4),(4,3)],5)
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> ([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> ([(0,3),(0,4),(1,3),(1,4),(3,2),(4,2)],5)
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> ([(0,2),(0,3),(1,4),(2,4),(3,1)],5)
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> ([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> ([(0,4),(1,3),(2,3),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> ([(0,1),(0,2),(0,3),(1,4),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> ([(0,4),(1,2),(1,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> ([(0,4),(1,4),(2,3),(3,4)],5)
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> ([(0,3),(3,4),(4,1),(4,2)],5)
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> ([(0,4),(1,4),(4,2),(4,3)],5)
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> ([(0,1),(0,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> ([(0,3),(0,4),(1,2),(2,3),(2,4)],5)
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> ([(0,4),(3,2),(4,1),(4,3)],5)
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> ([(0,3),(0,4),(1,3),(1,4),(4,2)],5)
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> ([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> ([(0,3),(0,4),(1,2),(1,3),(2,4)],5)
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> ([(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> ([(0,1),(0,2),(0,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> ([(0,4),(1,2),(1,3),(3,4)],5)
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> ([(0,4),(1,4),(2,3),(2,4)],5)
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> ([(1,4),(2,4),(3,4)],5)
=> 2
Description
The length of the shortest maximal antichain in a poset.
Mp00023: Dyck paths to non-crossing permutationPermutations
Mp00149: Permutations Lehmer code rotationPermutations
St000056: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => 1
[1,0,1,0]
=> [1,2] => [2,1] => 1
[1,1,0,0]
=> [2,1] => [1,2] => 2
[1,0,1,0,1,0]
=> [1,2,3] => [2,3,1] => 1
[1,0,1,1,0,0]
=> [1,3,2] => [2,1,3] => 2
[1,1,0,0,1,0]
=> [2,1,3] => [3,2,1] => 1
[1,1,0,1,0,0]
=> [2,3,1] => [3,1,2] => 1
[1,1,1,0,0,0]
=> [3,2,1] => [1,2,3] => 3
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => [2,3,4,1] => 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => [2,3,1,4] => 2
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => [2,4,3,1] => 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => [2,4,1,3] => 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => [2,1,3,4] => 3
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => [3,2,4,1] => 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => [3,2,1,4] => 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => [3,4,2,1] => 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => [3,4,1,2] => 1
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => [3,1,2,4] => 2
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => [4,3,2,1] => 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => [4,3,1,2] => 1
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => [1,4,2,3] => 2
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => [1,2,3,4] => 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => [2,3,4,5,1] => 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => [2,3,4,1,5] => 2
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => [2,3,5,4,1] => 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => [2,3,5,1,4] => 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => [2,3,1,4,5] => 3
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => [2,4,3,5,1] => 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => [2,4,3,1,5] => 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => [2,4,5,3,1] => 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => [2,4,5,1,3] => 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => [2,4,1,3,5] => 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => [2,5,4,3,1] => 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => [2,5,4,1,3] => 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => [2,1,5,3,4] => 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => [2,1,3,4,5] => 4
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => [3,2,4,5,1] => 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => [3,2,4,1,5] => 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => [3,2,5,4,1] => 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => [3,2,5,1,4] => 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => [3,2,1,4,5] => 3
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => [3,4,2,5,1] => 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => [3,4,2,1,5] => 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => [3,4,5,2,1] => 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => [3,4,5,1,2] => 1
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => [3,4,1,2,5] => 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => [3,5,4,2,1] => 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => [3,5,4,1,2] => 1
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => [3,1,5,2,4] => 1
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => [3,1,2,4,5] => 3
Description
The decomposition (or block) number of a permutation. For πSn, this is given by #{1kn:{π1,,πk}={1,,k}}. This is also known as the number of connected components [1] or the number of blocks [2] of the permutation, considering it as a direct sum. This is one plus [[St000234]].
Mp00025: Dyck paths to 132-avoiding permutationPermutations
Mp00160: Permutations graph of inversionsGraphs
St000273: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => ([],1)
=> 1
[1,0,1,0]
=> [2,1] => ([(0,1)],2)
=> 1
[1,1,0,0]
=> [1,2] => ([],2)
=> 2
[1,0,1,0,1,0]
=> [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> 1
[1,0,1,1,0,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> 1
[1,1,0,0,1,0]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> 1
[1,1,0,1,0,0]
=> [2,1,3] => ([(1,2)],3)
=> 2
[1,1,1,0,0,0]
=> [1,2,3] => ([],3)
=> 3
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,0,1,0,0]
=> [3,2,4,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
[1,1,0,1,0,0,1,0]
=> [4,2,1,3] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,1,0,1,0,0]
=> [3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
=> 2
[1,1,0,1,1,0,0,0]
=> [2,3,1,4] => ([(1,3),(2,3)],4)
=> 2
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
=> 1
[1,1,1,0,0,1,0,0]
=> [3,1,2,4] => ([(1,3),(2,3)],4)
=> 2
[1,1,1,0,1,0,0,0]
=> [2,1,3,4] => ([(2,3)],4)
=> 3
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => ([],4)
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,4,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [3,4,2,5,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [3,2,4,5,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [4,5,2,1,3] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,2,1,5] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [5,2,3,1,4] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [4,2,3,1,5] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [3,2,4,1,5] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,3,4,1,5] => ([(1,4),(2,4),(3,4)],5)
=> 2
Description
The domination number of a graph. The domination number of a graph is given by the minimum size of a dominating set of vertices. A dominating set of vertices is a subset of the vertex set of such that every vertex is either in this subset or adjacent to an element of this subset.
Mp00100: Dyck paths touch compositionInteger compositions
Mp00094: Integer compositions to binary wordBinary words
St000392: Binary words ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => 1 => 1
[1,0,1,0]
=> [1,1] => 11 => 2
[1,1,0,0]
=> [2] => 10 => 1
[1,0,1,0,1,0]
=> [1,1,1] => 111 => 3
[1,0,1,1,0,0]
=> [1,2] => 110 => 2
[1,1,0,0,1,0]
=> [2,1] => 101 => 1
[1,1,0,1,0,0]
=> [3] => 100 => 1
[1,1,1,0,0,0]
=> [3] => 100 => 1
[1,0,1,0,1,0,1,0]
=> [1,1,1,1] => 1111 => 4
[1,0,1,0,1,1,0,0]
=> [1,1,2] => 1110 => 3
[1,0,1,1,0,0,1,0]
=> [1,2,1] => 1101 => 2
[1,0,1,1,0,1,0,0]
=> [1,3] => 1100 => 2
[1,0,1,1,1,0,0,0]
=> [1,3] => 1100 => 2
[1,1,0,0,1,0,1,0]
=> [2,1,1] => 1011 => 2
[1,1,0,0,1,1,0,0]
=> [2,2] => 1010 => 1
[1,1,0,1,0,0,1,0]
=> [3,1] => 1001 => 1
[1,1,0,1,0,1,0,0]
=> [4] => 1000 => 1
[1,1,0,1,1,0,0,0]
=> [4] => 1000 => 1
[1,1,1,0,0,0,1,0]
=> [3,1] => 1001 => 1
[1,1,1,0,0,1,0,0]
=> [4] => 1000 => 1
[1,1,1,0,1,0,0,0]
=> [4] => 1000 => 1
[1,1,1,1,0,0,0,0]
=> [4] => 1000 => 1
[1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1] => 11111 => 5
[1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,2] => 11110 => 4
[1,0,1,0,1,1,0,0,1,0]
=> [1,1,2,1] => 11101 => 3
[1,0,1,0,1,1,0,1,0,0]
=> [1,1,3] => 11100 => 3
[1,0,1,0,1,1,1,0,0,0]
=> [1,1,3] => 11100 => 3
[1,0,1,1,0,0,1,0,1,0]
=> [1,2,1,1] => 11011 => 2
[1,0,1,1,0,0,1,1,0,0]
=> [1,2,2] => 11010 => 2
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,1] => 11001 => 2
[1,0,1,1,0,1,0,1,0,0]
=> [1,4] => 11000 => 2
[1,0,1,1,0,1,1,0,0,0]
=> [1,4] => 11000 => 2
[1,0,1,1,1,0,0,0,1,0]
=> [1,3,1] => 11001 => 2
[1,0,1,1,1,0,0,1,0,0]
=> [1,4] => 11000 => 2
[1,0,1,1,1,0,1,0,0,0]
=> [1,4] => 11000 => 2
[1,0,1,1,1,1,0,0,0,0]
=> [1,4] => 11000 => 2
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,1,1] => 10111 => 3
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,2] => 10110 => 2
[1,1,0,0,1,1,0,0,1,0]
=> [2,2,1] => 10101 => 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,3] => 10100 => 1
[1,1,0,0,1,1,1,0,0,0]
=> [2,3] => 10100 => 1
[1,1,0,1,0,0,1,0,1,0]
=> [3,1,1] => 10011 => 2
[1,1,0,1,0,0,1,1,0,0]
=> [3,2] => 10010 => 1
[1,1,0,1,0,1,0,0,1,0]
=> [4,1] => 10001 => 1
[1,1,0,1,0,1,0,1,0,0]
=> [5] => 10000 => 1
[1,1,0,1,0,1,1,0,0,0]
=> [5] => 10000 => 1
[1,1,0,1,1,0,0,0,1,0]
=> [4,1] => 10001 => 1
[1,1,0,1,1,0,0,1,0,0]
=> [5] => 10000 => 1
[1,1,0,1,1,0,1,0,0,0]
=> [5] => 10000 => 1
[1,1,0,1,1,1,0,0,0,0]
=> [5] => 10000 => 1
Description
The length of the longest run of ones in a binary word.
Mp00025: Dyck paths to 132-avoiding permutationPermutations
Mp00160: Permutations graph of inversionsGraphs
St000544: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => ([],1)
=> 1
[1,0,1,0]
=> [2,1] => ([(0,1)],2)
=> 1
[1,1,0,0]
=> [1,2] => ([],2)
=> 2
[1,0,1,0,1,0]
=> [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> 1
[1,0,1,1,0,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> 1
[1,1,0,0,1,0]
=> [3,1,2] => ([(0,2),(1,2)],3)
=> 1
[1,1,0,1,0,0]
=> [2,1,3] => ([(1,2)],3)
=> 2
[1,1,1,0,0,0]
=> [1,2,3] => ([],3)
=> 3
[1,0,1,0,1,0,1,0]
=> [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,0,1,1,0,0]
=> [3,4,2,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,0,1,0,0]
=> [3,2,4,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,0,1,0]
=> [4,3,1,2] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => ([(0,2),(0,3),(1,2),(1,3)],4)
=> 2
[1,1,0,1,0,0,1,0]
=> [4,2,1,3] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,1,0,1,0,0]
=> [3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
=> 2
[1,1,0,1,1,0,0,0]
=> [2,3,1,4] => ([(1,3),(2,3)],4)
=> 2
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => ([(0,3),(1,3),(2,3)],4)
=> 1
[1,1,1,0,0,1,0,0]
=> [3,1,2,4] => ([(1,3),(2,3)],4)
=> 2
[1,1,1,0,1,0,0,0]
=> [2,1,3,4] => ([(2,3)],4)
=> 3
[1,1,1,1,0,0,0,0]
=> [1,2,3,4] => ([],4)
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,4,1] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [3,4,2,5,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [3,2,4,5,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => ([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => ([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [4,5,2,1,3] => ([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5)
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [3,4,2,1,5] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [5,2,3,1,4] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [4,2,3,1,5] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [3,2,4,1,5] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,3,4,1,5] => ([(1,4),(2,4),(3,4)],5)
=> 2
Description
The cop number of a graph. This is the minimal number of cops needed to catch the robber. The algorithm is from [2].
Mp00233: Dyck paths skew partitionSkew partitions
Mp00181: Skew partitions row lengthsInteger compositions
St000657: Integer compositions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [[1],[]]
=> [1] => 1
[1,0,1,0]
=> [[1,1],[]]
=> [1,1] => 1
[1,1,0,0]
=> [[2],[]]
=> [2] => 2
[1,0,1,0,1,0]
=> [[1,1,1],[]]
=> [1,1,1] => 1
[1,0,1,1,0,0]
=> [[2,1],[]]
=> [2,1] => 1
[1,1,0,0,1,0]
=> [[2,2],[1]]
=> [1,2] => 1
[1,1,0,1,0,0]
=> [[3],[]]
=> [3] => 3
[1,1,1,0,0,0]
=> [[2,2],[]]
=> [2,2] => 2
[1,0,1,0,1,0,1,0]
=> [[1,1,1,1],[]]
=> [1,1,1,1] => 1
[1,0,1,0,1,1,0,0]
=> [[2,1,1],[]]
=> [2,1,1] => 1
[1,0,1,1,0,0,1,0]
=> [[2,2,1],[1]]
=> [1,2,1] => 1
[1,0,1,1,0,1,0,0]
=> [[3,1],[]]
=> [3,1] => 1
[1,0,1,1,1,0,0,0]
=> [[2,2,1],[]]
=> [2,2,1] => 1
[1,1,0,0,1,0,1,0]
=> [[2,2,2],[1,1]]
=> [1,1,2] => 1
[1,1,0,0,1,1,0,0]
=> [[3,2],[1]]
=> [2,2] => 2
[1,1,0,1,0,0,1,0]
=> [[3,3],[2]]
=> [1,3] => 1
[1,1,0,1,0,1,0,0]
=> [[4],[]]
=> [4] => 4
[1,1,0,1,1,0,0,0]
=> [[3,3],[1]]
=> [2,3] => 2
[1,1,1,0,0,0,1,0]
=> [[2,2,2],[1]]
=> [1,2,2] => 1
[1,1,1,0,0,1,0,0]
=> [[3,2],[]]
=> [3,2] => 2
[1,1,1,0,1,0,0,0]
=> [[2,2,2],[]]
=> [2,2,2] => 2
[1,1,1,1,0,0,0,0]
=> [[3,3],[]]
=> [3,3] => 3
[1,0,1,0,1,0,1,0,1,0]
=> [[1,1,1,1,1],[]]
=> [1,1,1,1,1] => 1
[1,0,1,0,1,0,1,1,0,0]
=> [[2,1,1,1],[]]
=> [2,1,1,1] => 1
[1,0,1,0,1,1,0,0,1,0]
=> [[2,2,1,1],[1]]
=> [1,2,1,1] => 1
[1,0,1,0,1,1,0,1,0,0]
=> [[3,1,1],[]]
=> [3,1,1] => 1
[1,0,1,0,1,1,1,0,0,0]
=> [[2,2,1,1],[]]
=> [2,2,1,1] => 1
[1,0,1,1,0,0,1,0,1,0]
=> [[2,2,2,1],[1,1]]
=> [1,1,2,1] => 1
[1,0,1,1,0,0,1,1,0,0]
=> [[3,2,1],[1]]
=> [2,2,1] => 1
[1,0,1,1,0,1,0,0,1,0]
=> [[3,3,1],[2]]
=> [1,3,1] => 1
[1,0,1,1,0,1,0,1,0,0]
=> [[4,1],[]]
=> [4,1] => 1
[1,0,1,1,0,1,1,0,0,0]
=> [[3,3,1],[1]]
=> [2,3,1] => 1
[1,0,1,1,1,0,0,0,1,0]
=> [[2,2,2,1],[1]]
=> [1,2,2,1] => 1
[1,0,1,1,1,0,0,1,0,0]
=> [[3,2,1],[]]
=> [3,2,1] => 1
[1,0,1,1,1,0,1,0,0,0]
=> [[2,2,2,1],[]]
=> [2,2,2,1] => 1
[1,0,1,1,1,1,0,0,0,0]
=> [[3,3,1],[]]
=> [3,3,1] => 1
[1,1,0,0,1,0,1,0,1,0]
=> [[2,2,2,2],[1,1,1]]
=> [1,1,1,2] => 1
[1,1,0,0,1,0,1,1,0,0]
=> [[3,2,2],[1,1]]
=> [2,1,2] => 1
[1,1,0,0,1,1,0,0,1,0]
=> [[3,3,2],[2,1]]
=> [1,2,2] => 1
[1,1,0,0,1,1,0,1,0,0]
=> [[4,2],[1]]
=> [3,2] => 2
[1,1,0,0,1,1,1,0,0,0]
=> [[3,3,2],[1,1]]
=> [2,2,2] => 2
[1,1,0,1,0,0,1,0,1,0]
=> [[3,3,3],[2,2]]
=> [1,1,3] => 1
[1,1,0,1,0,0,1,1,0,0]
=> [[4,3],[2]]
=> [2,3] => 2
[1,1,0,1,0,1,0,0,1,0]
=> [[4,4],[3]]
=> [1,4] => 1
[1,1,0,1,0,1,0,1,0,0]
=> [[5],[]]
=> [5] => 5
[1,1,0,1,0,1,1,0,0,0]
=> [[4,4],[2]]
=> [2,4] => 2
[1,1,0,1,1,0,0,0,1,0]
=> [[3,3,3],[2,1]]
=> [1,2,3] => 1
[1,1,0,1,1,0,0,1,0,0]
=> [[4,3],[1]]
=> [3,3] => 3
[1,1,0,1,1,0,1,0,0,0]
=> [[3,3,3],[1,1]]
=> [2,2,3] => 2
[1,1,0,1,1,1,0,0,0,0]
=> [[4,4],[1]]
=> [3,4] => 3
Description
The smallest part of an integer composition.
Mp00023: Dyck paths to non-crossing permutationPermutations
Mp00160: Permutations graph of inversionsGraphs
St001316: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => ([],1)
=> 1
[1,0,1,0]
=> [1,2] => ([],2)
=> 1
[1,1,0,0]
=> [2,1] => ([(0,1)],2)
=> 2
[1,0,1,0,1,0]
=> [1,2,3] => ([],3)
=> 1
[1,0,1,1,0,0]
=> [1,3,2] => ([(1,2)],3)
=> 1
[1,1,0,0,1,0]
=> [2,1,3] => ([(1,2)],3)
=> 1
[1,1,0,1,0,0]
=> [2,3,1] => ([(0,2),(1,2)],3)
=> 2
[1,1,1,0,0,0]
=> [3,2,1] => ([(0,1),(0,2),(1,2)],3)
=> 3
[1,0,1,0,1,0,1,0]
=> [1,2,3,4] => ([],4)
=> 1
[1,0,1,0,1,1,0,0]
=> [1,2,4,3] => ([(2,3)],4)
=> 1
[1,0,1,1,0,0,1,0]
=> [1,3,2,4] => ([(2,3)],4)
=> 1
[1,0,1,1,0,1,0,0]
=> [1,3,4,2] => ([(1,3),(2,3)],4)
=> 1
[1,0,1,1,1,0,0,0]
=> [1,4,3,2] => ([(1,2),(1,3),(2,3)],4)
=> 1
[1,1,0,0,1,0,1,0]
=> [2,1,3,4] => ([(2,3)],4)
=> 1
[1,1,0,0,1,1,0,0]
=> [2,1,4,3] => ([(0,3),(1,2)],4)
=> 2
[1,1,0,1,0,0,1,0]
=> [2,3,1,4] => ([(1,3),(2,3)],4)
=> 1
[1,1,0,1,0,1,0,0]
=> [2,3,4,1] => ([(0,3),(1,3),(2,3)],4)
=> 2
[1,1,0,1,1,0,0,0]
=> [2,4,3,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[1,1,1,0,0,0,1,0]
=> [3,2,1,4] => ([(1,2),(1,3),(2,3)],4)
=> 1
[1,1,1,0,0,1,0,0]
=> [3,2,4,1] => ([(0,3),(1,2),(1,3),(2,3)],4)
=> 2
[1,1,1,0,1,0,0,0]
=> [4,2,3,1] => ([(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 3
[1,1,1,1,0,0,0,0]
=> [4,3,2,1] => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4)
=> 4
[1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => ([],5)
=> 1
[1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => ([(3,4)],5)
=> 1
[1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => ([(3,4)],5)
=> 1
[1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => ([(2,4),(3,4)],5)
=> 1
[1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => ([(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => ([(3,4)],5)
=> 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => ([(1,4),(2,3)],5)
=> 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,3,4,2,5] => ([(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => ([(1,4),(2,4),(3,4)],5)
=> 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,3,5,4,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => ([(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,0,1,0,0,0]
=> [1,5,3,4,2] => ([(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => ([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => ([(3,4)],5)
=> 1
[1,1,0,0,1,0,1,1,0,0]
=> [2,1,3,5,4] => ([(1,4),(2,3)],5)
=> 1
[1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,5] => ([(1,4),(2,3)],5)
=> 1
[1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,5,3] => ([(0,1),(2,4),(3,4)],5)
=> 2
[1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => ([(0,1),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => ([(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,0,1,1,0,0]
=> [2,3,1,5,4] => ([(0,1),(2,4),(3,4)],5)
=> 2
[1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => ([(1,4),(2,4),(3,4)],5)
=> 1
[1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 2
[1,1,0,1,0,1,1,0,0,0]
=> [2,3,5,4,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,0,0,0,1,0]
=> [2,4,3,1,5] => ([(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[1,1,0,1,1,0,0,1,0,0]
=> [2,4,3,5,1] => ([(0,4),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,0,1,0,0,0]
=> [2,5,3,4,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
[1,1,0,1,1,1,0,0,0,0]
=> [2,5,4,3,1] => ([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 2
Description
The domatic number of a graph. This is the maximal size of a partition of the vertices into dominating sets.
The following 413 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001322The size of a minimal independent dominating set in a graph. St001339The irredundance number of a graph. St001652The length of a longest interval of consecutive numbers. St001662The length of the longest factor of consecutive numbers in a permutation. St001829The common independence number of a graph. St000234The number of global ascents of a permutation. St000310The minimal degree of a vertex of a graph. St000906The length of the shortest maximal chain in a poset. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. 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. St000011The number of touch points (or returns) of a Dyck path. St000261The edge connectivity of a graph. St000287The number of connected components of a graph. St000314The number of left-to-right-maxima of a permutation. St000383The last part of an integer composition. St000546The number of global descents of a permutation. St000617The number of global maxima of a Dyck path. St000654The first descent of a permutation. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000729The minimal arc length of a set partition. St000745The index of the last row whose first entry is the row number in a standard Young tableau. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000916The packing number of a graph. St000991The number of right-to-left minima of a permutation. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001050The number of terminal closers of a set partition. St001051The depth of the label 1 in the decreasing labelled unordered tree associated with the set partition. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001340The cardinality of a minimal non-edge isolating set of a graph. St001733The number of weak left to right maxima of a Dyck path. St001933The largest multiplicity of a part in an integer partition. St000214The number of adjacencies of a permutation. St000215The number of adjacencies of a permutation, zero appended. St000221The number of strong fixed points of a permutation. St000237The number of small exceedances. St000241The number of cyclical small excedances. St000262The vertex connectivity of a graph. St000441The number of successions of a permutation. St000504The cardinality of the first block of a set partition. St000731The number of double exceedences of a permutation. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St000969We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) [c0,c1,...,cn1] by adding c0 to cn1. St000974The length of the trunk of an ordered tree. St000989The number of final rises of a permutation. St001130The number of two successive successions in a permutation. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001530The depth of a Dyck path. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St000990The first ascent of a permutation. St000993The multiplicity of the largest part of an integer partition. St000717The number of ordinal summands of a poset. St000288The number of ones in a binary word. St000297The number of leading ones in a binary word. St001372The length of a longest cyclic run of ones of a binary word. St000899The maximal number of repetitions of an integer composition. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001199The dominant dimension of eAe for the corresponding Nakayama algebra A with minimal faithful projective-injective module eA. St000895The number of ones on the main diagonal of an alternating sign matrix. St000968We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) [c0,c1,...,cn1] by adding c0 to cn1. St001202Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series L=[c0,c1,...,cn1] such that n=c0<ci for all i>0 a special CNakayama algebra. St000667The greatest common divisor of the parts of the partition. St001568The smallest positive integer that does not appear twice in the partition. St000061The number of nodes on the left branch of a binary tree. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001571The Cartan determinant of the integer partition. St000733The row containing the largest entry of a standard tableau. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St000983The length of the longest alternating subword. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001420Half the length of a longest factor which is its own reverse-complement of a binary word. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001498The normalised height of a Nakayama algebra with magnitude 1. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000382The first part of an integer composition. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001527The cyclic permutation representation number of an integer partition. St000335The difference of lower and upper interactions. St001075The minimal size of a block of a set partition. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St001651The Frankl number of a lattice. St000781The number of proper colouring schemes of a Ferrers diagram. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000260The radius of a connected graph. St000444The length of the maximal rise of a Dyck path. St000668The least common multiple of the parts of the partition. St000675The number of centered multitunnels of a Dyck path. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000708The product of the parts of an integer partition. St001128The exponens consonantiae of a partition. St001389The number of partitions of the same length below the given integer partition. St001432The order dimension of the partition. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001959The product of the heights of the peaks of a Dyck path. St000307The number of rowmotion orbits of a poset. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St000460The hook length of the last cell along the main diagonal of an integer partition. St000681The Grundy value of Chomp on Ferrers diagrams. St000707The product of the factorials of the parts. St000815The number of semistandard Young tableaux of partition weight of given shape. St000817The sum of the entries in the column specified by the composition of the change of basis matrix from dual immaculate quasisymmetric functions to monomial quasisymmetric functions. St000818The sum of the entries in the column specified by the composition of the change of basis matrix from quasisymmetric Schur functions to monomial quasisymmetric functions. St000870The product of the hook lengths of the diagonal cells in an integer partition. St000933The number of multipartitions of sizes given by an integer partition. St000937The number of positive values of the symmetric group character corresponding to the partition. St001380The number of monomer-dimer tilings of a Ferrers diagram. St001645The pebbling number of a connected graph. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000633The size of the automorphism group of a poset. St000640The rank of the largest boolean interval in a poset. St001964The interval resolution global dimension of a poset. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St000888The maximal sum of entries on a diagonal of an alternating sign matrix. St000892The maximal number of nonzero entries on a diagonal of an alternating sign matrix. St000883The number of longest increasing subsequences of a permutation. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001780The order of promotion on the set of standard tableaux of given shape. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001924The number of cells in an integer partition whose arm and leg length coincide. St000005The bounce statistic of a Dyck path. St000006The dinv of a Dyck path. St000015The number of peaks of a Dyck path. St000026The position of the first return of a Dyck path. St000032The number of elements smaller than the given Dyck path in the Tamari Order. St000053The number of valleys of the Dyck path. St000063The number of linear extensions of a certain poset defined for an integer partition. St000075The orbit size of a standard tableau under promotion. St000079The number of alternating sign matrices for a given Dyck path. St000108The number of partitions contained in the given partition. St000120The number of left tunnels of a Dyck path. St000144The pyramid weight of the Dyck path. St000179The product of the hook lengths of the integer partition. St000184The size of the centralizer of any permutation of given cycle type. St000291The number of descents of a binary word. St000293The number of inversions of a binary word. St000306The bounce count of a Dyck path. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000331The number of upper interactions of a Dyck path. St000390The number of runs of ones in a binary word. St000395The sum of the heights of the peaks of a Dyck path. St000443The number of long tunnels of a Dyck path. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000511The number of invariant subsets when acting with a permutation of given cycle type. St000519The largest length of a factor maximising the subword complexity. St000531The leading coefficient of the rook polynomial of an integer partition. St000532The total number of rook placements on a Ferrers board. St000627The exponent of a binary word. St000655The length of the minimal rise of a Dyck path. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000685The dominant dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St000691The number of changes of a binary word. St000734The last entry in the first row of a standard tableau. St000738The first entry in the last row of a standard tableau. St000759The smallest missing part in an integer partition. St000812The sum of the entries in the column specified by the partition of the change of basis matrix from complete homogeneous symmetric functions to monomial symmetric functions. St000847The number of standard Young tableaux whose descent set is the binary word. St000876The number of factors in the Catalan decomposition of a binary word. St000922The minimal number such that all substrings of this length are unique. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000947The major index east count of a Dyck path. St000952Gives the number of irreducible factors of the Coxeter polynomial of the Dyck path over the rational numbers. St000955Number of times one has Exti(D(A),A)>0 for i>0 for the corresponding LNakayama algebra. St000982The length of the longest constant subword. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001013Number of indecomposable injective modules with codominant dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001014Number of indecomposable injective modules with codominant dimension equal to the dominant dimension of the Nakayama algebra corresponding to the Dyck path. St001018Sum of projective dimension of the indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001118The acyclic chromatic index of a graph. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001161The major index north count of a Dyck path. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001170Number of indecomposable injective modules whose socle has projective dimension at most g-1 when g denotes the global dimension in the corresponding Nakayama algebra. St001183The maximum of projdim(S)+injdim(S) over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001191Number of simple modules S with ExtiA(S,A)=0 for all i=0,1,...,g1 in the corresponding Nakayama algebra A with global dimension g. St001197The global dimension of eAe for the corresponding Nakayama algebra A with minimal faithful projective-injective module eA. St001201The grade of the simple module S0 in the special CNakayama algebra corresponding to the Dyck path. St001203We associate to a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series L=[c0,c1,...,cn1] such that n=c0<ci for all i>0 a Dyck path as follows: St001205The number of non-simple indecomposable projective-injective modules of the algebra eAe in the corresponding Nakayama algebra A with minimal faithful projective-injective module eA. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001257The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001278The number of indecomposable modules that are fixed by τΩ1 composed with its inverse in the corresponding Nakayama algebra. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001313The number of Dyck paths above the lattice path given by a binary word. St001400The total number of Littlewood-Richardson tableaux of given shape. St001415The length of the longest palindromic prefix of a binary word. St001416The length of a longest palindromic factor of a binary word. St001417The length of a longest palindromic subword of a binary word. St001419The length of the longest palindromic factor beginning with a one of a binary word. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001462The number of factors of a standard tableaux under concatenation. St001471The magnitude of a Dyck path. St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001523The degree of symmetry of a Dyck path. St001595The number of standard Young tableaux of the skew partition. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001612The number of coloured multisets of cycles such that the multiplicities of colours are given by a partition. St001614The cyclic permutation representation number of a skew partition. St001659The number of ways to place as many non-attacking rooks as possible on a Ferrers board. St001660The number of ways to place as many non-attacking rooks as possible on a skew Ferrers board. St001710The number of permutations such that conjugation with a permutation of given cycle type yields the inverse permutation. St001732The number of peaks visible from the left. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St001814The number of partitions interlacing the given partition. St001884The number of borders of a binary word. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001929The number of meanders with top half given by the noncrossing matching corresponding to the Dyck path. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St001955The number of natural descents for set-valued two row standard Young tableaux. St000706The product of the factorials of the multiplicities of an integer partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000456The monochromatic index of a connected graph. St000741The Colin de Verdière graph invariant. St000326The position of the first one in a binary word after appending a 1 at the end. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St001889The size of the connectivity set of a signed permutation. St000649The number of 3-excedences of a permutation. St001330The hat guessing number of a graph. St000877The depth of the binary word interpreted as a path. St000910The number of maximal chains of minimal length in a poset. St000914The sum of the values of the Möbius function of a poset. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St001632The number of indecomposable injective modules I with dimExt1(I,A)=1 for the incidence algebra A of a poset. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001637The number of (upper) dissectors of a poset. St001668The number of points of the poset minus the width of the poset. St001890The maximum magnitude of the Möbius function of a poset. St001846The number of elements which do not have a complement in the lattice. St001267The length of the Lyndon factorization of the binary word. St000117The number of centered tunnels of a Dyck path. St000338The number of pixed points of a permutation. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000911The number of maximal antichains of maximal size in a poset. 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. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001413Half the length of the longest even length palindromic prefix of a binary word. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001904The length of the initial strictly increasing segment of a parking function. St001937The size of the center of a parking function. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000894The trace of an alternating sign matrix. St001008Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001811The Castelnuovo-Mumford regularity of a permutation. St001948The number of augmented double ascents of a permutation. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001096The size of the overlap set of a permutation. St001820The size of the image of the pop stack sorting operator. St001087The number of occurrences of the vincular pattern |12-3 in a permutation. St000100The number of linear extensions of a poset. St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. St000327The number of cover relations in a poset. St000418The number of Dyck paths that are weakly below a Dyck path. St000420The number of Dyck paths that are weakly above a Dyck path. St000515The number of invariant set partitions when acting with a permutation of given cycle type. St000524The number of posets with the same order polynomial. St000525The number of posets with the same zeta polynomial. St000526The number of posets with combinatorially isomorphic order polytopes. St000635The number of strictly order preserving maps of a poset into itself. St000678The number of up steps after the last double rise of a Dyck path. St000735The last entry on the main diagonal of a standard tableau. St000744The length of the path to the largest entry in a standard Young tableau. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001500The global dimension of magnitude 1 Nakayama algebras. St001501The dominant dimension of magnitude 1 Nakayama algebras. 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. St001864The number of excedances of a signed permutation. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St001862The number of crossings of a signed permutation. St001868The number of alignments of type NE of a signed permutation. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St000454The largest eigenvalue of a graph if it is integral. St000648The number of 2-excedences of a permutation. 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. 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. St000352The Elizalde-Pak rank of a permutation. St000054The first entry of the permutation. St000496The rcs statistic of a set partition. St000618The number of self-evacuating tableaux of given shape. St001262The dimension of the maximal parabolic seaweed algebra corresponding to the partition. St001360The number of covering relations in Young's lattice below a partition. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001378The product of the cohook lengths of the integer partition. St001529The number of monomials in the expansion of the nabla operator applied to the power-sum symmetric function indexed by the partition. St001562The value of the complete homogeneous symmetric function evaluated at 1. St001563The value of the power-sum symmetric function evaluated at 1. St001564The value of the forgotten symmetric functions when all variables set to 1. St001602The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on endofunctions. St001607The number of coloured graphs such that the multiplicities of colours are given by a partition. St001608The number of coloured rooted trees such that the multiplicities of colours are given by a partition. St001610The number of coloured endofunctions such that the multiplicities of colours are given by a partition. St001611The number of multiset partitions such that the multiplicities of elements are given by a partition. St001627The number of coloured connected graphs such that the multiplicities of colours are given by a partition. St001763The Hurwitz number of an integer partition. St001938The number of transitive monotone factorizations of genus zero of a permutation of given cycle type. St000233The number of nestings of a set partition. St000534The number of 2-rises of a permutation. St000145The Dyson rank of a partition. St000153The number of adjacent cycles of a permutation. St000284The Plancherel distribution on integer partitions. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000474Dyson's crank of a partition. St000477The weight of a partition according to Alladi. St000478Another weight of a partition according to Alladi. St000509The diagonal index (content) of a partition. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000514The number of invariant simple graphs when acting with a permutation of given cycle type. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000770The major index of an integer partition when read from bottom to top. St000782The indicator function of whether a given perfect matching is an L & P matching. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000934The 2-degree of an integer partition. St001060The distinguishing index of a graph. St001175The size of a partition minus the hook length of the base cell. St001176The size of a partition minus its first part. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001249Sum of the odd parts of a partition. St001279The sum of the parts of an integer partition that are at least two. St001280The number of parts of an integer partition that are at least two. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001541The Gini index of an integer partition. St001593This is the number of standard Young tableaux of the given shifted shape. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St000650The number of 3-rises of a permutation. St001816Eigenvalues of the top-to-random operator acting on a simple module. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000210Minimum over maximum difference of elements in cycles. St000239The number of small weak excedances. St000492The rob statistic of a set partition. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000570The Edelman-Greene number of a permutation. St000695The number of blocks in the first part of the atomic decomposition of a set partition. St000884The number of isolated descents of a permutation. St001162The minimum jump of a permutation. St001357The maximal degree of a regular spanning subgraph of a graph. St001461The number of topologically connected components of the chord diagram of a permutation. St001665The number of pure excedances of a permutation. St001722The number of minimal chains with small intervals between a binary word and the top element. St001737The number of descents of type 2 in a permutation. St001859The number of factors of the Stanley symmetric function associated with a permutation. St001860The number of factors of the Stanley symmetric function associated with a signed permutation. St001905The number of preferred parking spots in a parking function less than the index of the car. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length 3. St000516The number of stretching pairs of a permutation. St000542The number of left-to-right-minima of a permutation. St000663The number of right floats of a permutation. St000671The maximin edge-connectivity for choosing a subgraph. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000803The number of occurrences of the vincular pattern |132 in a permutation. St000839The largest opener of a set partition. St001061The number of indices that are both descents and recoils of a permutation. St001069The coefficient of the monomial xy of the Tutte polynomial of the graph. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001298The number of repeated entries in the Lehmer code of a permutation. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001403The number of vertical separators in a permutation. St001423The number of distinct cubes in a binary word. St001552The number of inversions between excedances and fixed points of a permutation. St001556The number of inversions of the third entry of a permutation. St001730The number of times the path corresponding to a binary word crosses the base line. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001784The minimum of the smallest closer and the second element of the block containing 1 in a set partition. St001866The nesting alignments of a signed permutation. St001903The number of fixed points of a parking function. St000230Sum of the minimal elements of the blocks of a set partition. St000461The rix statistic of a permutation. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset.