Loading [MathJax]/jax/output/HTML-CSS/jax.js

Your data matches 685 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Mp00295: Standard tableaux valley compositionInteger compositions
St001673: Integer compositions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[1]]
=> [1] => 0
[[1,3],[2]]
=> [2,1] => 1
[[1,2,4],[3]]
=> [3,1] => 1
[[1,2],[3,4]]
=> [3,1] => 1
[[1,4],[2],[3]]
=> [3,1] => 1
[[1,2,3,5],[4]]
=> [4,1] => 1
[[1,3,5],[2,4]]
=> [2,2,1] => 1
[[1,2,3],[4,5]]
=> [4,1] => 1
[[1,3,5],[2],[4]]
=> [2,2,1] => 1
[[1,2,5],[3],[4]]
=> [4,1] => 1
[[1,3],[2,5],[4]]
=> [2,2,1] => 1
[[1,2],[3,5],[4]]
=> [4,1] => 1
[[1,5],[2],[3],[4]]
=> [4,1] => 1
[[1,2,3,4,6],[5]]
=> [5,1] => 1
[[1,3,4,6],[2,5]]
=> [2,3,1] => 1
[[1,2,4,6],[3,5]]
=> [3,2,1] => 1
[[1,2,3,4],[5,6]]
=> [5,1] => 1
[[1,3,4,6],[2],[5]]
=> [2,3,1] => 1
[[1,2,4,6],[3],[5]]
=> [3,2,1] => 1
[[1,2,3,6],[4],[5]]
=> [5,1] => 1
[[1,3,4],[2,5,6]]
=> [2,3,1] => 1
[[1,2,4],[3,5,6]]
=> [3,2,1] => 1
[[1,4,6],[2,5],[3]]
=> [3,2,1] => 1
[[1,3,6],[2,4],[5]]
=> [2,3,1] => 1
[[1,2,6],[3,4],[5]]
=> [3,2,1] => 1
[[1,3,4],[2,6],[5]]
=> [2,3,1] => 1
[[1,2,4],[3,6],[5]]
=> [3,2,1] => 1
[[1,2,3],[4,6],[5]]
=> [5,1] => 1
[[1,4,6],[2],[3],[5]]
=> [3,2,1] => 1
[[1,3,6],[2],[4],[5]]
=> [2,3,1] => 1
[[1,2,6],[3],[4],[5]]
=> [5,1] => 1
[[1,3],[2,4],[5,6]]
=> [2,3,1] => 1
[[1,2],[3,4],[5,6]]
=> [3,2,1] => 1
[[1,4],[2,6],[3],[5]]
=> [3,2,1] => 1
[[1,3],[2,6],[4],[5]]
=> [2,3,1] => 1
[[1,2],[3,6],[4],[5]]
=> [5,1] => 1
[[1,6],[2],[3],[4],[5]]
=> [5,1] => 1
[[1,2,3,4,5,7],[6]]
=> [6,1] => 1
[[1,3,4,5,7],[2,6]]
=> [2,4,1] => 1
[[1,2,4,5,7],[3,6]]
=> [3,3,1] => 1
[[1,2,3,5,7],[4,6]]
=> [4,2,1] => 1
[[1,2,3,4,5],[6,7]]
=> [6,1] => 1
[[1,3,4,5,7],[2],[6]]
=> [2,4,1] => 1
[[1,2,4,5,7],[3],[6]]
=> [3,3,1] => 1
[[1,2,3,5,7],[4],[6]]
=> [4,2,1] => 1
[[1,2,3,4,7],[5],[6]]
=> [6,1] => 1
[[1,3,5,7],[2,4,6]]
=> [2,2,2,1] => 1
[[1,2,5,7],[3,4,6]]
=> [3,3,1] => 1
[[1,3,4,5],[2,6,7]]
=> [2,4,1] => 1
[[1,2,4,5],[3,6,7]]
=> [3,3,1] => 1
Description
The degree of asymmetry of an integer composition. This is the number of pairs of symmetrically positioned distinct entries.
Mp00295: Standard tableaux valley compositionInteger compositions
Mp00039: Integer compositions complementInteger compositions
St000090: Integer compositions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[1]]
=> [1] => [1] => 0
[[1,3],[2]]
=> [2,1] => [1,2] => 1
[[1,2,4],[3]]
=> [3,1] => [1,1,2] => 1
[[1,2],[3,4]]
=> [3,1] => [1,1,2] => 1
[[1,4],[2],[3]]
=> [3,1] => [1,1,2] => 1
[[1,2,3,5],[4]]
=> [4,1] => [1,1,1,2] => 1
[[1,3,5],[2,4]]
=> [2,2,1] => [1,2,2] => 1
[[1,2,3],[4,5]]
=> [4,1] => [1,1,1,2] => 1
[[1,3,5],[2],[4]]
=> [2,2,1] => [1,2,2] => 1
[[1,2,5],[3],[4]]
=> [4,1] => [1,1,1,2] => 1
[[1,3],[2,5],[4]]
=> [2,2,1] => [1,2,2] => 1
[[1,2],[3,5],[4]]
=> [4,1] => [1,1,1,2] => 1
[[1,5],[2],[3],[4]]
=> [4,1] => [1,1,1,2] => 1
[[1,2,3,4,6],[5]]
=> [5,1] => [1,1,1,1,2] => 1
[[1,3,4,6],[2,5]]
=> [2,3,1] => [1,2,1,2] => 1
[[1,2,4,6],[3,5]]
=> [3,2,1] => [1,1,2,2] => 1
[[1,2,3,4],[5,6]]
=> [5,1] => [1,1,1,1,2] => 1
[[1,3,4,6],[2],[5]]
=> [2,3,1] => [1,2,1,2] => 1
[[1,2,4,6],[3],[5]]
=> [3,2,1] => [1,1,2,2] => 1
[[1,2,3,6],[4],[5]]
=> [5,1] => [1,1,1,1,2] => 1
[[1,3,4],[2,5,6]]
=> [2,3,1] => [1,2,1,2] => 1
[[1,2,4],[3,5,6]]
=> [3,2,1] => [1,1,2,2] => 1
[[1,4,6],[2,5],[3]]
=> [3,2,1] => [1,1,2,2] => 1
[[1,3,6],[2,4],[5]]
=> [2,3,1] => [1,2,1,2] => 1
[[1,2,6],[3,4],[5]]
=> [3,2,1] => [1,1,2,2] => 1
[[1,3,4],[2,6],[5]]
=> [2,3,1] => [1,2,1,2] => 1
[[1,2,4],[3,6],[5]]
=> [3,2,1] => [1,1,2,2] => 1
[[1,2,3],[4,6],[5]]
=> [5,1] => [1,1,1,1,2] => 1
[[1,4,6],[2],[3],[5]]
=> [3,2,1] => [1,1,2,2] => 1
[[1,3,6],[2],[4],[5]]
=> [2,3,1] => [1,2,1,2] => 1
[[1,2,6],[3],[4],[5]]
=> [5,1] => [1,1,1,1,2] => 1
[[1,3],[2,4],[5,6]]
=> [2,3,1] => [1,2,1,2] => 1
[[1,2],[3,4],[5,6]]
=> [3,2,1] => [1,1,2,2] => 1
[[1,4],[2,6],[3],[5]]
=> [3,2,1] => [1,1,2,2] => 1
[[1,3],[2,6],[4],[5]]
=> [2,3,1] => [1,2,1,2] => 1
[[1,2],[3,6],[4],[5]]
=> [5,1] => [1,1,1,1,2] => 1
[[1,6],[2],[3],[4],[5]]
=> [5,1] => [1,1,1,1,2] => 1
[[1,2,3,4,5,7],[6]]
=> [6,1] => [1,1,1,1,1,2] => 1
[[1,3,4,5,7],[2,6]]
=> [2,4,1] => [1,2,1,1,2] => 1
[[1,2,4,5,7],[3,6]]
=> [3,3,1] => [1,1,2,1,2] => 1
[[1,2,3,5,7],[4,6]]
=> [4,2,1] => [1,1,1,2,2] => 1
[[1,2,3,4,5],[6,7]]
=> [6,1] => [1,1,1,1,1,2] => 1
[[1,3,4,5,7],[2],[6]]
=> [2,4,1] => [1,2,1,1,2] => 1
[[1,2,4,5,7],[3],[6]]
=> [3,3,1] => [1,1,2,1,2] => 1
[[1,2,3,5,7],[4],[6]]
=> [4,2,1] => [1,1,1,2,2] => 1
[[1,2,3,4,7],[5],[6]]
=> [6,1] => [1,1,1,1,1,2] => 1
[[1,3,5,7],[2,4,6]]
=> [2,2,2,1] => [1,2,2,2] => 1
[[1,2,5,7],[3,4,6]]
=> [3,3,1] => [1,1,2,1,2] => 1
[[1,3,4,5],[2,6,7]]
=> [2,4,1] => [1,2,1,1,2] => 1
[[1,2,4,5],[3,6,7]]
=> [3,3,1] => [1,1,2,1,2] => 1
Description
The variation of a composition.
Mp00295: Standard tableaux valley compositionInteger compositions
Mp00184: Integer compositions to threshold graphGraphs
St000260: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[1]]
=> [1] => ([],1)
=> 0
[[1,3],[2]]
=> [2,1] => ([(0,2),(1,2)],3)
=> 1
[[1,2,4],[3]]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1
[[1,2],[3,4]]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1
[[1,4],[2],[3]]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1
[[1,2,3,5],[4]]
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[[1,3,5],[2,4]]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[[1,2,3],[4,5]]
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[[1,3,5],[2],[4]]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[[1,2,5],[3],[4]]
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[[1,3],[2,5],[4]]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[[1,2],[3,5],[4]]
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[[1,5],[2],[3],[4]]
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[[1,2,3,4,6],[5]]
=> [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1
[[1,3,4,6],[2,5]]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,4,6],[3,5]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,3,4],[5,6]]
=> [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1
[[1,3,4,6],[2],[5]]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,4,6],[3],[5]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,3,6],[4],[5]]
=> [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1
[[1,3,4],[2,5,6]]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,4],[3,5,6]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,4,6],[2,5],[3]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,3,6],[2,4],[5]]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,6],[3,4],[5]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,3,4],[2,6],[5]]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,4],[3,6],[5]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,3],[4,6],[5]]
=> [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1
[[1,4,6],[2],[3],[5]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,3,6],[2],[4],[5]]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,6],[3],[4],[5]]
=> [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1
[[1,3],[2,4],[5,6]]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2],[3,4],[5,6]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,4],[2,6],[3],[5]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,3],[2,6],[4],[5]]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2],[3,6],[4],[5]]
=> [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1
[[1,6],[2],[3],[4],[5]]
=> [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1
[[1,2,3,4,5,7],[6]]
=> [6,1] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> 1
[[1,3,4,5,7],[2,6]]
=> [2,4,1] => ([(0,6),(1,6),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,2,4,5,7],[3,6]]
=> [3,3,1] => ([(0,6),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,2,3,5,7],[4,6]]
=> [4,2,1] => ([(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,2,3,4,5],[6,7]]
=> [6,1] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> 1
[[1,3,4,5,7],[2],[6]]
=> [2,4,1] => ([(0,6),(1,6),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,2,4,5,7],[3],[6]]
=> [3,3,1] => ([(0,6),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,2,3,5,7],[4],[6]]
=> [4,2,1] => ([(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,2,3,4,7],[5],[6]]
=> [6,1] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> 1
[[1,3,5,7],[2,4,6]]
=> [2,2,2,1] => ([(0,6),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,2,5,7],[3,4,6]]
=> [3,3,1] => ([(0,6),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,3,4,5],[2,6,7]]
=> [2,4,1] => ([(0,6),(1,6),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,2,4,5],[3,6,7]]
=> [3,3,1] => ([(0,6),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
Description
The radius of a connected graph. This is the minimum eccentricity of any vertex.
Mp00081: Standard tableaux reading word permutationPermutations
Mp00204: Permutations LLPSInteger partitions
St000480: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[1]]
=> [1] => [1]
=> 0
[[1,3],[2]]
=> [2,1,3] => [2,1]
=> 1
[[1,2,4],[3]]
=> [3,1,2,4] => [2,1,1]
=> 1
[[1,2],[3,4]]
=> [3,4,1,2] => [2,1,1]
=> 1
[[1,4],[2],[3]]
=> [3,2,1,4] => [3,1]
=> 1
[[1,2,3,5],[4]]
=> [4,1,2,3,5] => [2,1,1,1]
=> 1
[[1,3,5],[2,4]]
=> [2,4,1,3,5] => [2,1,1,1]
=> 1
[[1,2,3],[4,5]]
=> [4,5,1,2,3] => [2,1,1,1]
=> 1
[[1,3,5],[2],[4]]
=> [4,2,1,3,5] => [3,1,1]
=> 1
[[1,2,5],[3],[4]]
=> [4,3,1,2,5] => [3,1,1]
=> 1
[[1,3],[2,5],[4]]
=> [4,2,5,1,3] => [3,1,1]
=> 1
[[1,2],[3,5],[4]]
=> [4,3,5,1,2] => [3,1,1]
=> 1
[[1,5],[2],[3],[4]]
=> [4,3,2,1,5] => [4,1]
=> 1
[[1,2,3,4,6],[5]]
=> [5,1,2,3,4,6] => [2,1,1,1,1]
=> 1
[[1,3,4,6],[2,5]]
=> [2,5,1,3,4,6] => [2,1,1,1,1]
=> 1
[[1,2,4,6],[3,5]]
=> [3,5,1,2,4,6] => [2,1,1,1,1]
=> 1
[[1,2,3,4],[5,6]]
=> [5,6,1,2,3,4] => [2,1,1,1,1]
=> 1
[[1,3,4,6],[2],[5]]
=> [5,2,1,3,4,6] => [3,1,1,1]
=> 1
[[1,2,4,6],[3],[5]]
=> [5,3,1,2,4,6] => [3,1,1,1]
=> 1
[[1,2,3,6],[4],[5]]
=> [5,4,1,2,3,6] => [3,1,1,1]
=> 1
[[1,3,4],[2,5,6]]
=> [2,5,6,1,3,4] => [2,1,1,1,1]
=> 1
[[1,2,4],[3,5,6]]
=> [3,5,6,1,2,4] => [2,1,1,1,1]
=> 1
[[1,4,6],[2,5],[3]]
=> [3,2,5,1,4,6] => [3,1,1,1]
=> 1
[[1,3,6],[2,4],[5]]
=> [5,2,4,1,3,6] => [3,1,1,1]
=> 1
[[1,2,6],[3,4],[5]]
=> [5,3,4,1,2,6] => [3,1,1,1]
=> 1
[[1,3,4],[2,6],[5]]
=> [5,2,6,1,3,4] => [3,1,1,1]
=> 1
[[1,2,4],[3,6],[5]]
=> [5,3,6,1,2,4] => [3,1,1,1]
=> 1
[[1,2,3],[4,6],[5]]
=> [5,4,6,1,2,3] => [3,1,1,1]
=> 1
[[1,4,6],[2],[3],[5]]
=> [5,3,2,1,4,6] => [4,1,1]
=> 1
[[1,3,6],[2],[4],[5]]
=> [5,4,2,1,3,6] => [4,1,1]
=> 1
[[1,2,6],[3],[4],[5]]
=> [5,4,3,1,2,6] => [4,1,1]
=> 1
[[1,3],[2,4],[5,6]]
=> [5,6,2,4,1,3] => [3,1,1,1]
=> 1
[[1,2],[3,4],[5,6]]
=> [5,6,3,4,1,2] => [3,1,1,1]
=> 1
[[1,4],[2,6],[3],[5]]
=> [5,3,2,6,1,4] => [4,1,1]
=> 1
[[1,3],[2,6],[4],[5]]
=> [5,4,2,6,1,3] => [4,1,1]
=> 1
[[1,2],[3,6],[4],[5]]
=> [5,4,3,6,1,2] => [4,1,1]
=> 1
[[1,6],[2],[3],[4],[5]]
=> [5,4,3,2,1,6] => [5,1]
=> 1
[[1,2,3,4,5,7],[6]]
=> [6,1,2,3,4,5,7] => [2,1,1,1,1,1]
=> 1
[[1,3,4,5,7],[2,6]]
=> [2,6,1,3,4,5,7] => [2,1,1,1,1,1]
=> 1
[[1,2,4,5,7],[3,6]]
=> [3,6,1,2,4,5,7] => [2,1,1,1,1,1]
=> 1
[[1,2,3,5,7],[4,6]]
=> [4,6,1,2,3,5,7] => [2,1,1,1,1,1]
=> 1
[[1,2,3,4,5],[6,7]]
=> [6,7,1,2,3,4,5] => [2,1,1,1,1,1]
=> 1
[[1,3,4,5,7],[2],[6]]
=> [6,2,1,3,4,5,7] => [3,1,1,1,1]
=> 1
[[1,2,4,5,7],[3],[6]]
=> [6,3,1,2,4,5,7] => [3,1,1,1,1]
=> 1
[[1,2,3,5,7],[4],[6]]
=> [6,4,1,2,3,5,7] => [3,1,1,1,1]
=> 1
[[1,2,3,4,7],[5],[6]]
=> [6,5,1,2,3,4,7] => [3,1,1,1,1]
=> 1
[[1,3,5,7],[2,4,6]]
=> [2,4,6,1,3,5,7] => [2,1,1,1,1,1]
=> 1
[[1,2,5,7],[3,4,6]]
=> [3,4,6,1,2,5,7] => [2,1,1,1,1,1]
=> 1
[[1,3,4,5],[2,6,7]]
=> [2,6,7,1,3,4,5] => [2,1,1,1,1,1]
=> 1
[[1,2,4,5],[3,6,7]]
=> [3,6,7,1,2,4,5] => [2,1,1,1,1,1]
=> 1
Description
The number of lower covers of a partition in dominance order. According to [1], Corollary 2.4, the maximum number of elements one element (apparently for $n\neq 2$) can cover is $$ \frac{1}{2}(\sqrt{1+8n}-3) $$ and an element which covers this number of elements is given by $(c+i,c,c-1,\dots,3,2,1)$, where $1\leq i\leq c+2$.
Mp00081: Standard tableaux reading word permutationPermutations
Mp00204: Permutations LLPSInteger partitions
St000481: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[1]]
=> [1] => [1]
=> 0
[[1,3],[2]]
=> [2,1,3] => [2,1]
=> 1
[[1,2,4],[3]]
=> [3,1,2,4] => [2,1,1]
=> 1
[[1,2],[3,4]]
=> [3,4,1,2] => [2,1,1]
=> 1
[[1,4],[2],[3]]
=> [3,2,1,4] => [3,1]
=> 1
[[1,2,3,5],[4]]
=> [4,1,2,3,5] => [2,1,1,1]
=> 1
[[1,3,5],[2,4]]
=> [2,4,1,3,5] => [2,1,1,1]
=> 1
[[1,2,3],[4,5]]
=> [4,5,1,2,3] => [2,1,1,1]
=> 1
[[1,3,5],[2],[4]]
=> [4,2,1,3,5] => [3,1,1]
=> 1
[[1,2,5],[3],[4]]
=> [4,3,1,2,5] => [3,1,1]
=> 1
[[1,3],[2,5],[4]]
=> [4,2,5,1,3] => [3,1,1]
=> 1
[[1,2],[3,5],[4]]
=> [4,3,5,1,2] => [3,1,1]
=> 1
[[1,5],[2],[3],[4]]
=> [4,3,2,1,5] => [4,1]
=> 1
[[1,2,3,4,6],[5]]
=> [5,1,2,3,4,6] => [2,1,1,1,1]
=> 1
[[1,3,4,6],[2,5]]
=> [2,5,1,3,4,6] => [2,1,1,1,1]
=> 1
[[1,2,4,6],[3,5]]
=> [3,5,1,2,4,6] => [2,1,1,1,1]
=> 1
[[1,2,3,4],[5,6]]
=> [5,6,1,2,3,4] => [2,1,1,1,1]
=> 1
[[1,3,4,6],[2],[5]]
=> [5,2,1,3,4,6] => [3,1,1,1]
=> 1
[[1,2,4,6],[3],[5]]
=> [5,3,1,2,4,6] => [3,1,1,1]
=> 1
[[1,2,3,6],[4],[5]]
=> [5,4,1,2,3,6] => [3,1,1,1]
=> 1
[[1,3,4],[2,5,6]]
=> [2,5,6,1,3,4] => [2,1,1,1,1]
=> 1
[[1,2,4],[3,5,6]]
=> [3,5,6,1,2,4] => [2,1,1,1,1]
=> 1
[[1,4,6],[2,5],[3]]
=> [3,2,5,1,4,6] => [3,1,1,1]
=> 1
[[1,3,6],[2,4],[5]]
=> [5,2,4,1,3,6] => [3,1,1,1]
=> 1
[[1,2,6],[3,4],[5]]
=> [5,3,4,1,2,6] => [3,1,1,1]
=> 1
[[1,3,4],[2,6],[5]]
=> [5,2,6,1,3,4] => [3,1,1,1]
=> 1
[[1,2,4],[3,6],[5]]
=> [5,3,6,1,2,4] => [3,1,1,1]
=> 1
[[1,2,3],[4,6],[5]]
=> [5,4,6,1,2,3] => [3,1,1,1]
=> 1
[[1,4,6],[2],[3],[5]]
=> [5,3,2,1,4,6] => [4,1,1]
=> 1
[[1,3,6],[2],[4],[5]]
=> [5,4,2,1,3,6] => [4,1,1]
=> 1
[[1,2,6],[3],[4],[5]]
=> [5,4,3,1,2,6] => [4,1,1]
=> 1
[[1,3],[2,4],[5,6]]
=> [5,6,2,4,1,3] => [3,1,1,1]
=> 1
[[1,2],[3,4],[5,6]]
=> [5,6,3,4,1,2] => [3,1,1,1]
=> 1
[[1,4],[2,6],[3],[5]]
=> [5,3,2,6,1,4] => [4,1,1]
=> 1
[[1,3],[2,6],[4],[5]]
=> [5,4,2,6,1,3] => [4,1,1]
=> 1
[[1,2],[3,6],[4],[5]]
=> [5,4,3,6,1,2] => [4,1,1]
=> 1
[[1,6],[2],[3],[4],[5]]
=> [5,4,3,2,1,6] => [5,1]
=> 1
[[1,2,3,4,5,7],[6]]
=> [6,1,2,3,4,5,7] => [2,1,1,1,1,1]
=> 1
[[1,3,4,5,7],[2,6]]
=> [2,6,1,3,4,5,7] => [2,1,1,1,1,1]
=> 1
[[1,2,4,5,7],[3,6]]
=> [3,6,1,2,4,5,7] => [2,1,1,1,1,1]
=> 1
[[1,2,3,5,7],[4,6]]
=> [4,6,1,2,3,5,7] => [2,1,1,1,1,1]
=> 1
[[1,2,3,4,5],[6,7]]
=> [6,7,1,2,3,4,5] => [2,1,1,1,1,1]
=> 1
[[1,3,4,5,7],[2],[6]]
=> [6,2,1,3,4,5,7] => [3,1,1,1,1]
=> 1
[[1,2,4,5,7],[3],[6]]
=> [6,3,1,2,4,5,7] => [3,1,1,1,1]
=> 1
[[1,2,3,5,7],[4],[6]]
=> [6,4,1,2,3,5,7] => [3,1,1,1,1]
=> 1
[[1,2,3,4,7],[5],[6]]
=> [6,5,1,2,3,4,7] => [3,1,1,1,1]
=> 1
[[1,3,5,7],[2,4,6]]
=> [2,4,6,1,3,5,7] => [2,1,1,1,1,1]
=> 1
[[1,2,5,7],[3,4,6]]
=> [3,4,6,1,2,5,7] => [2,1,1,1,1,1]
=> 1
[[1,3,4,5],[2,6,7]]
=> [2,6,7,1,3,4,5] => [2,1,1,1,1,1]
=> 1
[[1,2,4,5],[3,6,7]]
=> [3,6,7,1,2,4,5] => [2,1,1,1,1,1]
=> 1
Description
The number of upper covers of a partition in dominance order.
Mp00295: Standard tableaux valley compositionInteger compositions
Mp00184: Integer compositions to threshold graphGraphs
St000535: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[1]]
=> [1] => ([],1)
=> 0
[[1,3],[2]]
=> [2,1] => ([(0,2),(1,2)],3)
=> 1
[[1,2,4],[3]]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1
[[1,2],[3,4]]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1
[[1,4],[2],[3]]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1
[[1,2,3,5],[4]]
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[[1,3,5],[2,4]]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[[1,2,3],[4,5]]
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[[1,3,5],[2],[4]]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[[1,2,5],[3],[4]]
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[[1,3],[2,5],[4]]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[[1,2],[3,5],[4]]
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[[1,5],[2],[3],[4]]
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[[1,2,3,4,6],[5]]
=> [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1
[[1,3,4,6],[2,5]]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,4,6],[3,5]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,3,4],[5,6]]
=> [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1
[[1,3,4,6],[2],[5]]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,4,6],[3],[5]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,3,6],[4],[5]]
=> [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1
[[1,3,4],[2,5,6]]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,4],[3,5,6]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,4,6],[2,5],[3]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,3,6],[2,4],[5]]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,6],[3,4],[5]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,3,4],[2,6],[5]]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,4],[3,6],[5]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,3],[4,6],[5]]
=> [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1
[[1,4,6],[2],[3],[5]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,3,6],[2],[4],[5]]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,6],[3],[4],[5]]
=> [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1
[[1,3],[2,4],[5,6]]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2],[3,4],[5,6]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,4],[2,6],[3],[5]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,3],[2,6],[4],[5]]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2],[3,6],[4],[5]]
=> [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1
[[1,6],[2],[3],[4],[5]]
=> [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1
[[1,2,3,4,5,7],[6]]
=> [6,1] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> 1
[[1,3,4,5,7],[2,6]]
=> [2,4,1] => ([(0,6),(1,6),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,2,4,5,7],[3,6]]
=> [3,3,1] => ([(0,6),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,2,3,5,7],[4,6]]
=> [4,2,1] => ([(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,2,3,4,5],[6,7]]
=> [6,1] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> 1
[[1,3,4,5,7],[2],[6]]
=> [2,4,1] => ([(0,6),(1,6),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,2,4,5,7],[3],[6]]
=> [3,3,1] => ([(0,6),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,2,3,5,7],[4],[6]]
=> [4,2,1] => ([(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,2,3,4,7],[5],[6]]
=> [6,1] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> 1
[[1,3,5,7],[2,4,6]]
=> [2,2,2,1] => ([(0,6),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,2,5,7],[3,4,6]]
=> [3,3,1] => ([(0,6),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,3,4,5],[2,6,7]]
=> [2,4,1] => ([(0,6),(1,6),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,2,4,5],[3,6,7]]
=> [3,3,1] => ([(0,6),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
Description
The rank-width of a graph.
Mp00295: Standard tableaux valley compositionInteger compositions
Mp00184: Integer compositions to threshold graphGraphs
St000552: Graphs ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[1]]
=> [1] => ([],1)
=> 0
[[1,3],[2]]
=> [2,1] => ([(0,2),(1,2)],3)
=> 1
[[1,2,4],[3]]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1
[[1,2],[3,4]]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1
[[1,4],[2],[3]]
=> [3,1] => ([(0,3),(1,3),(2,3)],4)
=> 1
[[1,2,3,5],[4]]
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[[1,3,5],[2,4]]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[[1,2,3],[4,5]]
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[[1,3,5],[2],[4]]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[[1,2,5],[3],[4]]
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[[1,3],[2,5],[4]]
=> [2,2,1] => ([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5)
=> 1
[[1,2],[3,5],[4]]
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[[1,5],[2],[3],[4]]
=> [4,1] => ([(0,4),(1,4),(2,4),(3,4)],5)
=> 1
[[1,2,3,4,6],[5]]
=> [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1
[[1,3,4,6],[2,5]]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,4,6],[3,5]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,3,4],[5,6]]
=> [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1
[[1,3,4,6],[2],[5]]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,4,6],[3],[5]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,3,6],[4],[5]]
=> [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1
[[1,3,4],[2,5,6]]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,4],[3,5,6]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,4,6],[2,5],[3]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,3,6],[2,4],[5]]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,6],[3,4],[5]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,3,4],[2,6],[5]]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,4],[3,6],[5]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,3],[4,6],[5]]
=> [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1
[[1,4,6],[2],[3],[5]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,3,6],[2],[4],[5]]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2,6],[3],[4],[5]]
=> [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1
[[1,3],[2,4],[5,6]]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2],[3,4],[5,6]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,4],[2,6],[3],[5]]
=> [3,2,1] => ([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,3],[2,6],[4],[5]]
=> [2,3,1] => ([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6)
=> 1
[[1,2],[3,6],[4],[5]]
=> [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1
[[1,6],[2],[3],[4],[5]]
=> [5,1] => ([(0,5),(1,5),(2,5),(3,5),(4,5)],6)
=> 1
[[1,2,3,4,5,7],[6]]
=> [6,1] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> 1
[[1,3,4,5,7],[2,6]]
=> [2,4,1] => ([(0,6),(1,6),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,2,4,5,7],[3,6]]
=> [3,3,1] => ([(0,6),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,2,3,5,7],[4,6]]
=> [4,2,1] => ([(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,2,3,4,5],[6,7]]
=> [6,1] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> 1
[[1,3,4,5,7],[2],[6]]
=> [2,4,1] => ([(0,6),(1,6),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,2,4,5,7],[3],[6]]
=> [3,3,1] => ([(0,6),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,2,3,5,7],[4],[6]]
=> [4,2,1] => ([(0,6),(1,5),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,2,3,4,7],[5],[6]]
=> [6,1] => ([(0,6),(1,6),(2,6),(3,6),(4,6),(5,6)],7)
=> 1
[[1,3,5,7],[2,4,6]]
=> [2,2,2,1] => ([(0,6),(1,5),(1,6),(2,4),(2,5),(2,6),(3,4),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,2,5,7],[3,4,6]]
=> [3,3,1] => ([(0,6),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,3,4,5],[2,6,7]]
=> [2,4,1] => ([(0,6),(1,6),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
[[1,2,4,5],[3,6,7]]
=> [3,3,1] => ([(0,6),(1,6),(2,5),(2,6),(3,5),(3,6),(4,5),(4,6),(5,6)],7)
=> 1
Description
The number of cut vertices of a graph. A cut vertex is one whose deletion increases the number of connected components.
Mp00295: Standard tableaux valley compositionInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
St000688: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[1]]
=> [1] => [1,0]
=> 0
[[1,3],[2]]
=> [2,1] => [1,1,0,0,1,0]
=> 1
[[1,2,4],[3]]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[[1,2],[3,4]]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[[1,4],[2],[3]]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[[1,2,3,5],[4]]
=> [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[[1,3,5],[2,4]]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1
[[1,2,3],[4,5]]
=> [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[[1,3,5],[2],[4]]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1
[[1,2,5],[3],[4]]
=> [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[[1,3],[2,5],[4]]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1
[[1,2],[3,5],[4]]
=> [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[[1,5],[2],[3],[4]]
=> [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[[1,2,3,4,6],[5]]
=> [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
[[1,3,4,6],[2,5]]
=> [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> 1
[[1,2,4,6],[3,5]]
=> [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> 1
[[1,2,3,4],[5,6]]
=> [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
[[1,3,4,6],[2],[5]]
=> [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> 1
[[1,2,4,6],[3],[5]]
=> [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> 1
[[1,2,3,6],[4],[5]]
=> [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
[[1,3,4],[2,5,6]]
=> [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> 1
[[1,2,4],[3,5,6]]
=> [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> 1
[[1,4,6],[2,5],[3]]
=> [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> 1
[[1,3,6],[2,4],[5]]
=> [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> 1
[[1,2,6],[3,4],[5]]
=> [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> 1
[[1,3,4],[2,6],[5]]
=> [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> 1
[[1,2,4],[3,6],[5]]
=> [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> 1
[[1,2,3],[4,6],[5]]
=> [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
[[1,4,6],[2],[3],[5]]
=> [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> 1
[[1,3,6],[2],[4],[5]]
=> [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> 1
[[1,2,6],[3],[4],[5]]
=> [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
[[1,3],[2,4],[5,6]]
=> [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> 1
[[1,2],[3,4],[5,6]]
=> [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> 1
[[1,4],[2,6],[3],[5]]
=> [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> 1
[[1,3],[2,6],[4],[5]]
=> [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> 1
[[1,2],[3,6],[4],[5]]
=> [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
[[1,6],[2],[3],[4],[5]]
=> [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
[[1,2,3,4,5,7],[6]]
=> [6,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> 1
[[1,3,4,5,7],[2,6]]
=> [2,4,1] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0]
=> 1
[[1,2,4,5,7],[3,6]]
=> [3,3,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0]
=> 1
[[1,2,3,5,7],[4,6]]
=> [4,2,1] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0]
=> 1
[[1,2,3,4,5],[6,7]]
=> [6,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> 1
[[1,3,4,5,7],[2],[6]]
=> [2,4,1] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0]
=> 1
[[1,2,4,5,7],[3],[6]]
=> [3,3,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0]
=> 1
[[1,2,3,5,7],[4],[6]]
=> [4,2,1] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0]
=> 1
[[1,2,3,4,7],[5],[6]]
=> [6,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> 1
[[1,3,5,7],[2,4,6]]
=> [2,2,2,1] => [1,1,0,0,1,1,0,0,1,1,0,0,1,0]
=> 1
[[1,2,5,7],[3,4,6]]
=> [3,3,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0]
=> 1
[[1,3,4,5],[2,6,7]]
=> [2,4,1] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0]
=> 1
[[1,2,4,5],[3,6,7]]
=> [3,3,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0]
=> 1
Description
The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. The global dimension is given by [[St000684]] and the dominant dimension is given by [[St000685]]. To every Dyck path there is an LNakayama algebra associated as described in [[St000684]]. Dyck paths for which the global dimension and the dominant dimension of the the LNakayama algebra coincide and both dimensions at least $2$ correspond to the LNakayama algebras that are higher Auslander algebras in the sense of [1].
Mp00295: Standard tableaux valley compositionInteger compositions
Mp00173: Integer compositions rotate front to backInteger compositions
St000761: Integer compositions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[1]]
=> [1] => [1] => 0
[[1,3],[2]]
=> [2,1] => [1,2] => 1
[[1,2,4],[3]]
=> [3,1] => [1,3] => 1
[[1,2],[3,4]]
=> [3,1] => [1,3] => 1
[[1,4],[2],[3]]
=> [3,1] => [1,3] => 1
[[1,2,3,5],[4]]
=> [4,1] => [1,4] => 1
[[1,3,5],[2,4]]
=> [2,2,1] => [2,1,2] => 1
[[1,2,3],[4,5]]
=> [4,1] => [1,4] => 1
[[1,3,5],[2],[4]]
=> [2,2,1] => [2,1,2] => 1
[[1,2,5],[3],[4]]
=> [4,1] => [1,4] => 1
[[1,3],[2,5],[4]]
=> [2,2,1] => [2,1,2] => 1
[[1,2],[3,5],[4]]
=> [4,1] => [1,4] => 1
[[1,5],[2],[3],[4]]
=> [4,1] => [1,4] => 1
[[1,2,3,4,6],[5]]
=> [5,1] => [1,5] => 1
[[1,3,4,6],[2,5]]
=> [2,3,1] => [3,1,2] => 1
[[1,2,4,6],[3,5]]
=> [3,2,1] => [2,1,3] => 1
[[1,2,3,4],[5,6]]
=> [5,1] => [1,5] => 1
[[1,3,4,6],[2],[5]]
=> [2,3,1] => [3,1,2] => 1
[[1,2,4,6],[3],[5]]
=> [3,2,1] => [2,1,3] => 1
[[1,2,3,6],[4],[5]]
=> [5,1] => [1,5] => 1
[[1,3,4],[2,5,6]]
=> [2,3,1] => [3,1,2] => 1
[[1,2,4],[3,5,6]]
=> [3,2,1] => [2,1,3] => 1
[[1,4,6],[2,5],[3]]
=> [3,2,1] => [2,1,3] => 1
[[1,3,6],[2,4],[5]]
=> [2,3,1] => [3,1,2] => 1
[[1,2,6],[3,4],[5]]
=> [3,2,1] => [2,1,3] => 1
[[1,3,4],[2,6],[5]]
=> [2,3,1] => [3,1,2] => 1
[[1,2,4],[3,6],[5]]
=> [3,2,1] => [2,1,3] => 1
[[1,2,3],[4,6],[5]]
=> [5,1] => [1,5] => 1
[[1,4,6],[2],[3],[5]]
=> [3,2,1] => [2,1,3] => 1
[[1,3,6],[2],[4],[5]]
=> [2,3,1] => [3,1,2] => 1
[[1,2,6],[3],[4],[5]]
=> [5,1] => [1,5] => 1
[[1,3],[2,4],[5,6]]
=> [2,3,1] => [3,1,2] => 1
[[1,2],[3,4],[5,6]]
=> [3,2,1] => [2,1,3] => 1
[[1,4],[2,6],[3],[5]]
=> [3,2,1] => [2,1,3] => 1
[[1,3],[2,6],[4],[5]]
=> [2,3,1] => [3,1,2] => 1
[[1,2],[3,6],[4],[5]]
=> [5,1] => [1,5] => 1
[[1,6],[2],[3],[4],[5]]
=> [5,1] => [1,5] => 1
[[1,2,3,4,5,7],[6]]
=> [6,1] => [1,6] => 1
[[1,3,4,5,7],[2,6]]
=> [2,4,1] => [4,1,2] => 1
[[1,2,4,5,7],[3,6]]
=> [3,3,1] => [3,1,3] => 1
[[1,2,3,5,7],[4,6]]
=> [4,2,1] => [2,1,4] => 1
[[1,2,3,4,5],[6,7]]
=> [6,1] => [1,6] => 1
[[1,3,4,5,7],[2],[6]]
=> [2,4,1] => [4,1,2] => 1
[[1,2,4,5,7],[3],[6]]
=> [3,3,1] => [3,1,3] => 1
[[1,2,3,5,7],[4],[6]]
=> [4,2,1] => [2,1,4] => 1
[[1,2,3,4,7],[5],[6]]
=> [6,1] => [1,6] => 1
[[1,3,5,7],[2,4,6]]
=> [2,2,2,1] => [2,2,1,2] => 1
[[1,2,5,7],[3,4,6]]
=> [3,3,1] => [3,1,3] => 1
[[1,3,4,5],[2,6,7]]
=> [2,4,1] => [4,1,2] => 1
[[1,2,4,5],[3,6,7]]
=> [3,3,1] => [3,1,3] => 1
Description
The number of ascents in an integer composition. A composition has an ascent, or rise, at position $i$ if $a_i < a_{i+1}$.
Mp00295: Standard tableaux valley compositionInteger compositions
Mp00231: Integer compositions bounce pathDyck paths
St001026: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[1]]
=> [1] => [1,0]
=> 0
[[1,3],[2]]
=> [2,1] => [1,1,0,0,1,0]
=> 1
[[1,2,4],[3]]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[[1,2],[3,4]]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[[1,4],[2],[3]]
=> [3,1] => [1,1,1,0,0,0,1,0]
=> 1
[[1,2,3,5],[4]]
=> [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[[1,3,5],[2,4]]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1
[[1,2,3],[4,5]]
=> [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[[1,3,5],[2],[4]]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1
[[1,2,5],[3],[4]]
=> [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[[1,3],[2,5],[4]]
=> [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> 1
[[1,2],[3,5],[4]]
=> [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[[1,5],[2],[3],[4]]
=> [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> 1
[[1,2,3,4,6],[5]]
=> [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
[[1,3,4,6],[2,5]]
=> [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> 1
[[1,2,4,6],[3,5]]
=> [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> 1
[[1,2,3,4],[5,6]]
=> [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
[[1,3,4,6],[2],[5]]
=> [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> 1
[[1,2,4,6],[3],[5]]
=> [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> 1
[[1,2,3,6],[4],[5]]
=> [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
[[1,3,4],[2,5,6]]
=> [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> 1
[[1,2,4],[3,5,6]]
=> [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> 1
[[1,4,6],[2,5],[3]]
=> [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> 1
[[1,3,6],[2,4],[5]]
=> [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> 1
[[1,2,6],[3,4],[5]]
=> [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> 1
[[1,3,4],[2,6],[5]]
=> [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> 1
[[1,2,4],[3,6],[5]]
=> [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> 1
[[1,2,3],[4,6],[5]]
=> [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
[[1,4,6],[2],[3],[5]]
=> [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> 1
[[1,3,6],[2],[4],[5]]
=> [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> 1
[[1,2,6],[3],[4],[5]]
=> [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
[[1,3],[2,4],[5,6]]
=> [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> 1
[[1,2],[3,4],[5,6]]
=> [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> 1
[[1,4],[2,6],[3],[5]]
=> [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> 1
[[1,3],[2,6],[4],[5]]
=> [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> 1
[[1,2],[3,6],[4],[5]]
=> [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
[[1,6],[2],[3],[4],[5]]
=> [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
[[1,2,3,4,5,7],[6]]
=> [6,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> 1
[[1,3,4,5,7],[2,6]]
=> [2,4,1] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0]
=> 1
[[1,2,4,5,7],[3,6]]
=> [3,3,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0]
=> 1
[[1,2,3,5,7],[4,6]]
=> [4,2,1] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0]
=> 1
[[1,2,3,4,5],[6,7]]
=> [6,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> 1
[[1,3,4,5,7],[2],[6]]
=> [2,4,1] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0]
=> 1
[[1,2,4,5,7],[3],[6]]
=> [3,3,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0]
=> 1
[[1,2,3,5,7],[4],[6]]
=> [4,2,1] => [1,1,1,1,0,0,0,0,1,1,0,0,1,0]
=> 1
[[1,2,3,4,7],[5],[6]]
=> [6,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> 1
[[1,3,5,7],[2,4,6]]
=> [2,2,2,1] => [1,1,0,0,1,1,0,0,1,1,0,0,1,0]
=> 1
[[1,2,5,7],[3,4,6]]
=> [3,3,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0]
=> 1
[[1,3,4,5],[2,6,7]]
=> [2,4,1] => [1,1,0,0,1,1,1,1,0,0,0,0,1,0]
=> 1
[[1,2,4,5],[3,6,7]]
=> [3,3,1] => [1,1,1,0,0,0,1,1,1,0,0,0,1,0]
=> 1
Description
The maximum of the projective dimensions of the indecomposable non-projective injective modules minus the minimum in the Nakayama algebra corresponding to the Dyck path.
The following 675 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001271The competition number of a graph. St001280The number of parts of an integer partition that are at least two. St001333The cardinality of a minimal edge-isolating set of a graph. St001340The cardinality of a minimal non-edge isolating set of a graph. St001393The induced matching number of a graph. St001743The discrepancy of a graph. St000159The number of distinct parts of the integer partition. St000258The burning number of a graph. St000381The largest part of an integer composition. St000382The first part of an integer composition. St000383The last part of an integer composition. St000396The register function (or Horton-Strahler number) of a binary tree. St000630The length of the shortest palindromic decomposition of a binary word. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St000701The protection number of a binary tree. St000745The index of the last row whose first entry is the row number in a standard Young tableau. St000758The length of the longest staircase fitting into an integer composition. St000760The length of the longest strictly decreasing subsequence of parts of an integer composition. St000764The number of strong records in an integer composition. St000783The side length of the largest staircase partition fitting into a partition. St000903The number of different parts of an integer composition. St000917The open packing number of a graph. St000918The 2-limited packing number of a graph. St001111The weak 2-dynamic chromatic number of a graph. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001261The Castelnuovo-Mumford regularity of a graph. St001316The domatic number of a graph. St001372The length of a longest cyclic run of ones of a binary word. St001432The order dimension of the partition. St001784The minimum of the smallest closer and the second element of the block containing 1 in a set partition. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000011The number of touch points (or returns) of a Dyck path. St000024The number of double up and double down steps of a Dyck path. St000053The number of valleys of the Dyck path. St000147The largest part of an integer partition. St000150The floored half-sum of the multiplicities of a partition. St000160The multiplicity of the smallest part of a partition. St000183The side length of the Durfee square of an integer partition. St000225Difference between largest and smallest parts in a partition. St000256The number of parts from which one can substract 2 and still get an integer partition. St000257The number of distinct parts of a partition that occur at least twice. St000272The treewidth of a graph. St000292The number of ascents of a binary word. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000340The number of non-final maximal constant sub-paths of length greater than one. St000374The number of exclusive right-to-left minima of a permutation. St000378The diagonal inversion number of an integer partition. St000387The matching number of a graph. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000475The number of parts equal to 1 in a partition. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000536The pathwidth of a graph. St000547The number of even non-empty partial sums of an integer partition. St000628The balance of a binary word. St000651The maximal size of a rise in a permutation. St000660The number of rises of length at least 3 of a Dyck path. St000742The number of big ascents of a permutation after prepending zero. St000769The major index of a composition regarded as a word. St000845The maximal number of elements covered by an element in a poset. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St000897The number of different multiplicities of parts of an integer partition. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama algebra. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001022Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to the Dyck path. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001037The number of inner corners of the upper path of the parallelogram polyomino associated with the Dyck path. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001092The number of distinct even parts of a partition. St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001276The number of 2-regular indecomposable modules in the corresponding Nakayama algebra. St001277The degeneracy of a graph. St001335The cardinality of a minimal cycle-isolating set of a graph. St001349The number of different graphs obtained from the given graph by removing an edge. St001354The number of series nodes in the modular decomposition of a graph. St001358The largest degree of a regular subgraph of a graph. St001413Half the length of the longest even length palindromic prefix of a binary word. St001469The holeyness of a permutation. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001587Half of the largest even part of an integer partition. St001588The number of distinct odd parts smaller than the largest even part in an integer partition. St001665The number of pure excedances of a permutation. St001712The number of natural descents of a standard Young tableau. St001730The number of times the path corresponding to a binary word crosses the base line. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001792The arboricity of a graph. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St000013The height of a Dyck path. St000025The number of initial rises of a Dyck path. St000026The position of the first return of a Dyck path. St000058The order of a permutation. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000273The domination number of a graph. St000291The number of descents of a binary word. St000297The number of leading ones in a binary word. St000298The order dimension or Dushnik-Miller dimension of a poset. St000306The bounce count of a Dyck path. St000326The position of the first one in a binary word after appending a 1 at the end. St000363The number of minimal vertex covers of a graph. St000390The number of runs of ones in a binary word. St000392The length of the longest run of ones in a binary word. St000397The Strahler number of a rooted tree. St000451The length of the longest pattern of the form k 1 2. St000544The cop number of a graph. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000759The smallest missing part in an integer partition. St000767The number of runs in an integer composition. St000862The number of parts of the shifted shape of a permutation. St000916The packing number of a graph. St000920The logarithmic height of a Dyck path. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001029The size of the core of a graph. St001050The number of terminal closers of a set partition. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001109The number of proper colourings of a graph with as few colours as possible. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001203We associate to a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n-1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a Dyck path as follows: St001322The size of a minimal independent dominating set in a graph. St001330The hat guessing number of a graph. St001368The number of vertices of maximal degree in a graph. St001415The length of the longest palindromic prefix of a binary word. St001463The number of distinct columns in the nullspace of a graph. St001471The magnitude of a Dyck path. St001486The number of corners of the ribbon associated with an integer composition. St001494The Alon-Tarsi number of a graph. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001580The acyclic chromatic number of a graph. St001716The 1-improper chromatic number of a graph. St001732The number of peaks visible from the left. St001741The largest integer such that all patterns of this size are contained in the permutation. St001809The index of the step at the first peak of maximal height in a Dyck path. St001814The number of partitions interlacing the given partition. St001829The common independence number of a graph. St001884The number of borders of a binary word. St001933The largest multiplicity of a part in an integer partition. St000439The position of the first down step of a Dyck path. St000969We 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}$. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001166Number of indecomposable projective non-injective modules with dominant dimension equal to the global dimension plus the number of indecomposable projective injective modules in the corresponding Nakayama algebra. St001267The length of the Lyndon factorization of the binary word. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St000629The defect of a binary word. St000929The constant term of the character polynomial of an integer partition. St000056The decomposition (or block) number of a permutation. St000069The number of maximal elements of a poset. St000627The exponent of a binary word. St000657The smallest part of an integer composition. St000659The number of rises of length at least 2 of a Dyck path. St000674The number of hills of a Dyck path. St000675The number of centered multitunnels of a Dyck path. St000678The number of up steps after the last double rise of a Dyck path. St000729The minimal arc length of a set partition. St000781The number of proper colouring schemes of a Ferrers diagram. St000847The number of standard Young tableaux whose descent set is the binary word. St000919The number of maximal left branches of a binary tree. St000993The multiplicity of the largest part of an integer partition. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001437The flex of a binary word. St001501The dominant dimension of magnitude 1 Nakayama algebras. St001568The smallest positive integer that does not appear twice in the partition. St001722The number of minimal chains with small intervals between a binary word and the top element. St001859The number of factors of the Stanley symmetric function associated with a permutation. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St000221The number of strong fixed points of a permutation. St000234The number of global ascents of a permutation. St000279The size of the preimage of the map 'cycle-as-one-line notation' from Permutations to Permutations. St000290The major index of a binary word. St000293The number of inversions of a binary word. St000295The length of the border of a binary word. St000296The length of the symmetric border of a binary word. St000347The inversion sum of a binary word. St000379The number of Hamiltonian cycles in a graph. St000508Eigenvalues of the random-to-random operator acting on a simple module. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000623The number of occurrences of the pattern 52341 in a permutation. St000699The toughness times the least common multiple of 1,. St000790The number of pairs of centered tunnels, one strictly containing the other, of a Dyck path. St000921The number of internal inversions of a binary word. St000932The number of occurrences of the pattern UDU in a Dyck path. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St000981The length of the longest zigzag subpath. St001059Number of occurrences of the patterns 41352,42351,51342,52341 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. St001281The normalized isoperimetric number of a graph. St001371The length of the longest Yamanouchi prefix of a binary word. St001381The fertility of a permutation. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001485The modular major index of a binary word. St001663The number of occurrences of the Hertzsprung pattern 132 in a permutation. St000054The first entry of the permutation. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000253The crossing number of a set partition. St000254The nesting number of a set partition. St000284The Plancherel distribution on integer partitions. St000287The number of connected components of a graph. St000288The number of ones in a binary word. St000354The number of recoils of a permutation. St000389The number of runs of ones of odd length in a binary word. St000442The maximal area to the right of an up step of a Dyck path. St000456The monochromatic index of a connected graph. St000487The length of the shortest cycle of a permutation. St000501The size of the first part in the decomposition of a permutation. St000504The cardinality of the first block of a set partition. St000529The number of permutations whose descent word is the given binary word. St000542The number of left-to-right-minima of a permutation. St000543The size of the conjugacy class of a binary word. St000570The Edelman-Greene number of a permutation. St000618The number of self-evacuating tableaux of given shape. St000626The minimal period of a binary word. St000655The length of the minimal rise of a Dyck path. St000658The number of rises of length 2 of a Dyck path. St000667The greatest common divisor of the parts of the partition. St000685The dominant dimension of the LNakayama algebra associated to a Dyck path. St000695The number of blocks in the first part of the atomic decomposition of a set partition. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000706The product of the factorials of the multiplicities of an integer partition. St000717The number of ordinal summands of a poset. St000730The maximal arc length of a set partition. St000735The last entry on the main diagonal of a standard tableau. St000753The Grundy value for the game of Kayles on a binary word. St000762The sum of the positions of the weak records of an integer composition. St000763The sum of the positions of the strong records of an integer composition. St000775The multiplicity of the largest eigenvalue in a graph. St000805The number of peaks of the associated bargraph. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000816The number of standard composition tableaux of the composition. St000823The number of unsplittable factors of the set partition. St000900The minimal number of repetitions of a part in an integer composition. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000905The number of different multiplicities of parts of an integer composition. St000913The number of ways to refine the partition into singletons. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. 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}$. St000983The length of the longest alternating subword. St000989The number of final rises of a permutation. St000990The first ascent of a permutation. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001013Number of indecomposable injective modules with codominant dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001038The minimal height of a column in 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. St001075The minimal size of a block of a set partition. St001128The exponens consonantiae of a partition. St001162The minimum jump of a permutation. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001196The global dimension of $A$ minus the global dimension of $eAe$ for the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001256Number of simple reflexive modules that are 2-stable reflexive. St001257The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001272The number of graphs with the same degree sequence. 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. St001313The number of Dyck paths above the lattice path given by a binary word. St001339The irredundance number of a graph. St001344The neighbouring number of a permutation. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St001363The Euler characteristic of a graph according to Knill. St001385The number of conjugacy classes of subgroups with connected subgroups of sizes prescribed by an integer partition. St001389The number of partitions of the same length below the given integer partition. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001419The length of the longest palindromic factor beginning with a one of a binary word. St001420Half the length of a longest factor which is its own reverse-complement of a binary word. St001468The smallest fixpoint of a permutation. St001481The minimal height of a peak 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. St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001496The number of graphs with the same Laplacian spectrum as the given graph. St001498The normalised height of a Nakayama algebra with magnitude 1. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001571The Cartan determinant of the integer partition. St001591The number of graphs with the given composition of multiplicities of Laplacian eigenvalues. St001592The maximal number of simple paths between any two different vertices of a graph. St001597The Frobenius rank of a skew partition. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St001737The number of descents of type 2 in a permutation. St001776The degree of the minimal polynomial of the largest Laplacian eigenvalue of a graph. St001780The order of promotion on the set of standard tableaux of given shape. St001786The number of total orderings of the north steps of a Dyck path such that steps after the k-th east step are not among the first k positions in the order. St001838The number of nonempty primitive factors of a binary word. St001885The number of binary words with the same proper border set. 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. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St000052The number of valleys of a Dyck path not on the x-axis. St000065The number of entries equal to -1 in an alternating sign matrix. St000091The descent variation of a composition. St000122The number of occurrences of the contiguous pattern [.,[.,[[.,.],.]]] in a binary tree. St000125The number of occurrences of the contiguous pattern [.,[[[.,.],.],. St000127The number of occurrences of the contiguous pattern [.,[.,[.,[[.,.],.]]]] in a binary tree. St000128The number of occurrences of the contiguous pattern [.,[.,[[.,[.,.]],.]]] in a binary tree. St000129The number of occurrences of the contiguous pattern [.,[.,[[[.,.],.],.]]] in a binary tree. St000130The number of occurrences of the contiguous pattern [.,[[.,.],[[.,.],.]]] in a binary tree. St000131The number of occurrences of the contiguous pattern [.,[[[[.,.],.],.],. St000132The number of occurrences of the contiguous pattern [[.,.],[.,[[.,.],.]]] in a binary tree. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000210Minimum over maximum difference of elements in cycles. 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. St000289The decimal representation of a binary word. St000315The number of isolated vertices of a graph. St000317The cycle descent number of a permutation. St000348The non-inversion sum of a binary word. St000352The Elizalde-Pak rank of a permutation. St000355The number of occurrences of the pattern 21-3. St000357The number of occurrences of the pattern 12-3. St000365The number of double ascents of a permutation. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St000391The sum of the positions of the ones in a binary word. St000406The number of occurrences of the pattern 3241 in a permutation. St000407The number of occurrences of the pattern 2143 in a permutation. St000444The length of the maximal rise of a Dyck path. St000447The number of pairs of vertices of a graph with distance 3. St000449The number of pairs of vertices of a graph with distance 4. St000477The weight of a partition according to Alladi. St000478Another weight of a partition according to Alladi. St000485The length of the longest cycle of a permutation. St000486The number of cycles of length at least 3 of a permutation. St000491The number of inversions of a set partition. St000497The lcb statistic of a set partition. St000516The number of stretching pairs of a permutation. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. 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. St000560The number of occurrences of the pattern {{1,2},{3,4}} in a set partition. St000561The number of occurrences of the pattern {{1,2,3}} 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. St000567The sum of the products of all pairs of parts. 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. St000583The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 1, 2 are maximal. St000585The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal, (1,3) are consecutive in a block. St000590The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, 1 is maximal, (2,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. St000596The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 1 is maximal. 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. St000622The number of occurrences of the patterns 2143 or 4231 in a permutation. St000661The number of rises of length 3 of a Dyck path. St000664The number of right ropes of a permutation. St000666The number of right tethers of a permutation. St000668The least common multiple of the parts of the partition. St000682The Grundy value of Welter's game on a binary word. St000687The dimension of $Hom(I,P)$ for the LNakayama algebra of a Dyck path. St000691The number of changes of a binary word. St000713The dimension of the irreducible representation of Sp(4) labelled by an integer partition. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000732The number of double deficiencies of a permutation. St000748The major index of the permutation obtained by flattening the set partition. St000749The smallest integer d such that the restriction of the representation corresponding to a partition of n to the symmetric group on n-d letters has a constituent of odd degree. 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. St000752The Grundy value for the game 'Couples are forever' on an integer partition. St000766The number of inversions of an integer composition. St000768The number of peaks in an integer composition. St000791The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. St000792The Grundy value for the game of ruler on a binary word. St000799The number of occurrences of the vincular pattern |213 in a permutation. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000801The number of occurrences of the vincular pattern |312 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000803The number of occurrences of the vincular pattern |132 in a permutation. St000804The number of occurrences of the vincular pattern |123 in a permutation. St000807The sum of the heights of the valleys of the associated bargraph. St000842The breadth of a permutation. St000877The depth of the binary word interpreted as a path. St000931The number of occurrences of the pattern UUU in a Dyck path. St000936The number of even values of the symmetric group character corresponding to the partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St000944The 3-degree of an integer partition. St000954Number of times the corresponding LNakayama algebra has $Ext^i(D(A),A)=0$ for $i>0$. St000966Number of peaks minus the global dimension of the corresponding LNakayama algebra. 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. St001062The maximal size of a block of a set partition. St001082The number of boxed occurrences of 123 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. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St001098The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for vertex labelled trees. St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001130The number of two successive successions in a permutation. St001139The number of occurrences of hills of size 2 in a Dyck path. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001141The number of occurrences of hills of size 3 in a Dyck path. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001172The number of 1-rises at odd height of a Dyck path. St001175The size of a partition minus the hook length of the base cell. St001178Twelve times the variance of the major index among all standard Young tableaux of a partition. St001181Number of indecomposable injective modules with grade at least 3 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$. 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. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001248Sum of the even parts of a partition. St001279The sum of the parts of an integer partition that are at least two. St001283The number of finite solvable groups that are realised by the given partition over the complex numbers. St001284The number of finite groups that are realised by the given partition over the complex numbers. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001305The number of induced cycles on four vertices in a graph. St001306The number of induced paths on four vertices in 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. St001327The minimal number of occurrences of the split-pattern in a linear ordering of the vertices of the graph. St001353The number of prime nodes in the modular decomposition of a graph. St001356The number of vertices in prime modules of a graph. St001367The smallest number which does not occur as degree of a vertex in a graph. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001434The number of negative sum pairs of a signed permutation. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St001541The Gini index of an integer partition. St001550The number of inversions between exceedances where the greater exceedance is linked. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001552The number of inversions between excedances and fixed points of a permutation. St001577The minimal number of edges to add or remove to make a graph a cograph. St001584The area statistic between a Dyck path and its bounce path. St001586The number of odd parts smaller than the largest even part in an integer partition. St001596The number of two-by-two squares inside a skew partition. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001657The number of twos in an integer partition. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. 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. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001715The number of non-records in a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001793The difference between the clique number and the chromatic number of a graph. St001847The number of occurrences of the pattern 1432 in a permutation. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St000264The girth of a graph, which is not a tree. St000996The number of exclusive left-to-right maxima of a permutation. St001217The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St000445The number of rises of length 1 of a Dyck path. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000962The 3-shifted major index of a permutation. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000770The major index of an integer partition when read from bottom to top. St000815The number of semistandard Young tableaux of partition weight of given shape. St000933The number of multipartitions of sizes given by an integer partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001913The number of preimages of an integer partition in Bulgarian solitaire. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000617The number of global maxima of a Dyck path. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000934The 2-degree of an integer partition. St000940The number of characters of the symmetric group whose value on the partition is zero. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St000245The number of ascents of a permutation. St000834The number of right outer peaks of a permutation. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. St001347The number of pairs of vertices of a graph having the same neighbourhood. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St000331The number of upper interactions of a Dyck path. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. 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$. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St000015The number of peaks of a Dyck path. St000455The second largest eigenvalue of a graph if it is integral. St001090The number of pop-stack-sorts needed to sort a permutation. St000007The number of saliances of the permutation. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St000709The number of occurrences of 14-2-3 or 14-3-2. St000886The number of permutations with the same antidiagonal sums. St000432The number of occurrences of the pattern 231 or of the pattern 312 in a permutation. St000779The tier of a permutation. St000872The number of very big descents of a permutation. St000963The 2-shifted major index of a permutation. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001734The lettericity of a graph. St001570The minimal number of edges to add to make a graph Hamiltonian. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St001004The number of indices that are either left-to-right maxima or right-to-left minima. St000662The staircase size of the code of a permutation. St000961The shifted major index of a permutation. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St000437The number of occurrences of the pattern 312 or of the pattern 321 in a permutation. St000528The height of a poset. St000649The number of 3-excedences of a permutation. St000711The number of big exceedences of a permutation. St001343The dimension of the reduced incidence algebra of a poset. St001717The largest size of an interval in a poset. St000640The rank of the largest boolean interval in a poset. St000906The length of the shortest maximal chain in a poset. St001593This is the number of standard Young tableaux of the given shifted shape. St001091The number of parts in an integer partition whose next smaller part has the same size. St000436The number of occurrences of the pattern 231 or of the pattern 321 in a permutation. St000710The number of big deficiencies of a permutation. St000914The sum of the values of the Möbius function of a poset. St000028The number of stack-sorts needed to sort a permutation. St000035The number of left outer peaks of a permutation. St000483The number of times a permutation switches from increasing to decreasing or decreasing to increasing. St001096The size of the overlap set of a permutation. St001052The length of the exterior of a permutation. St000023The number of inner peaks of a permutation. St001115The number of even descents of a permutation. St001174The Gorenstein dimension of the algebra $A/I$ when $I$ is the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St000099The number of valleys of a permutation, including the boundary. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001811The Castelnuovo-Mumford regularity of a permutation. St000093The cardinality of a maximal independent set of vertices of a graph. 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$. St000654The first descent of a permutation. St000243The number of cyclic valleys and cyclic peaks of a permutation. St000524The number of posets with the same order polynomial. St000526The number of posets with combinatorially isomorphic order polytopes. St000031The number of cycles in the cycle decomposition of a permutation. St000740The last entry of a permutation. St000461The rix statistic of a permutation. St000141The maximum drop size of a permutation. St000068The number of minimal elements in a poset. St000838The number of terminal right-hand endpoints when the vertices are written in order. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St001235The global dimension of the corresponding Comp-Nakayama algebra. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000310The minimal degree of a vertex of a graph. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St000062The length of the longest increasing subsequence of the permutation. St000286The number of connected components of the complement of a graph. St000308The height of the tree associated to a permutation. St000314The number of left-to-right-maxima of a permutation. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St000991The number of right-to-left minima of a permutation. St001530The depth of a Dyck path. St000080The rank of the poset. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000259The diameter of a connected graph. St000663The number of right floats of a permutation. St000671The maximin edge-connectivity for choosing a subgraph. St000864The number of circled entries of the shifted recording tableau of a permutation. St001071The beta invariant of the graph. St001164Number of indecomposable injective modules whose socle has projective dimension at most g-1 (g the global dimension) minus the number of indecomposable projective-injective modules. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module 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. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001375The pancake length of a permutation. St001512The minimum rank of a graph. St001691The number of kings in a graph. St001729The number of visible descents of a permutation. St001760The number of prefix or suffix reversals needed to sort a permutation. St000092The number of outer peaks of a permutation. St000236The number of cyclical small weak excedances. St000299The number of nonisomorphic vertex-induced subtrees. St000328The maximum number of child nodes in a tree. St000443The number of long tunnels of a Dyck path. St000452The number of distinct eigenvalues of a graph. St000453The number of distinct Laplacian eigenvalues of a graph. St000553The number of blocks of a graph. St000700The protection number of an ordered tree. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000822The Hadwiger number of the graph. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001093The detour number of a graph. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001202Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. 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. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001273The projective dimension of the first term in an injective coresolution of the regular module. St001299The product of all non-zero projective dimensions of simple modules of the corresponding Nakayama algebra. St001315The dissociation number of a graph. St001318The number of vertices of the largest induced subforest with the same number of connected components of a graph. St001321The number of vertices of the largest induced subforest of a graph. St001661Half the permanent of the Identity matrix plus the permutation matrix associated to the permutation. St001662The length of the longest factor of consecutive numbers in a permutation. St001674The number of vertices of the largest induced star graph in the graph. 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. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. 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)$. St000061The number of nodes on the left branch of a binary tree. St000353The number of inner valleys of a permutation. St000472The sum of the ascent bottoms of a permutation. St000633The size of the automorphism group of a poset. St000646The number of big ascents of a permutation. St000652The maximal difference between successive positions of a permutation. St000694The number of affine bounded permutations that project to a given permutation. St000832The number of permutations obtained by reversing blocks of three consecutive numbers. St000873The aix statistic of a permutation. St000988The orbit size of a permutation under Foata's bijection. St001081The number of minimal length factorizations of a permutation into star transpositions. St001260The permanent of an alternating sign matrix. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001890The maximum magnitude of the Möbius function of a poset. St000219The number of occurrences of the pattern 231 in a permutation. St000226The convexity of a permutation. St000624The normalized sum of the minimal distances to a greater element. St000650The number of 3-rises of a permutation. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000850The number of 1/2-balanced pairs in a poset. St001005The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both. St001060The distinguishing index of a graph. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001429The number of negative entries in a signed permutation. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2. St001875The number of simple modules with projective dimension at most 1. St000454The largest eigenvalue of a graph if it is integral. St000880The number of connected components of long braid edges in the graph of braid moves of a permutation. St000881The number of short braid edges in the graph of braid moves of a permutation. St000908The length of the shortest maximal antichain in a poset. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001399The distinguishing number of a poset. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St000193The row of the unique '1' in the first column of the alternating sign matrix. St001301The first Betti number of the order complex associated with the poset. St001396Number of triples of incomparable elements in a finite poset. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001765The number of connected components of the friends and strangers graph. St001472The permanent of the Coxeter matrix of the poset. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001889The size of the connectivity set of a signed permutation. St001948The number of augmented double ascents of a permutation. 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. St001520The number of strict 3-descents. St001556The number of inversions of the third entry of a permutation. St001557The number of inversions of the second entry of a permutation. St001637The number of (upper) dissectors of a poset. St001771The number of occurrences of the signed pattern 1-2 in a signed permutation. St001868The number of alignments of type NE of a signed permutation. St001870The number of positive entries followed by a negative entry in a signed permutation. St001895The oddness of a signed permutation. St001960The number of descents of a permutation minus one if its first entry is not one. St001964The interval resolution global dimension of a poset.