Your data matches 665 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000146
Mp00307: Posets promotion cycle typeInteger partitions
St000146: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> [1]
=> -1 = 0 - 1
([],2)
=> [2]
=> 1 = 2 - 1
([(0,1)],2)
=> [1]
=> -1 = 0 - 1
([(0,1),(0,2)],3)
=> [2]
=> 1 = 2 - 1
([(0,2),(2,1)],3)
=> [1]
=> -1 = 0 - 1
([(0,2),(1,2)],3)
=> [2]
=> 1 = 2 - 1
([(0,1),(0,2),(1,3),(2,3)],4)
=> [2]
=> 1 = 2 - 1
([(0,3),(3,1),(3,2)],4)
=> [2]
=> 1 = 2 - 1
([(0,3),(1,3),(3,2)],4)
=> [2]
=> 1 = 2 - 1
([(0,3),(1,2),(1,3)],4)
=> [3,2]
=> 2 = 3 - 1
([(0,3),(2,1),(3,2)],4)
=> [1]
=> -1 = 0 - 1
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [2]
=> 1 = 2 - 1
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> [3,2]
=> 2 = 3 - 1
([(0,4),(1,4),(2,3),(4,2)],5)
=> [2]
=> 1 = 2 - 1
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> [3,2]
=> 2 = 3 - 1
([(0,3),(3,4),(4,1),(4,2)],5)
=> [2]
=> 1 = 2 - 1
([(0,4),(2,3),(3,1),(4,2)],5)
=> [1]
=> -1 = 0 - 1
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [2]
=> 1 = 2 - 1
([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [2]
=> 1 = 2 - 1
([(0,4),(1,2),(1,4),(2,5),(4,5),(5,3)],6)
=> [3,2]
=> 2 = 3 - 1
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> [3,2]
=> 2 = 3 - 1
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> [2]
=> 1 = 2 - 1
([(0,4),(3,5),(4,3),(5,1),(5,2)],6)
=> [2]
=> 1 = 2 - 1
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [2]
=> 1 = 2 - 1
([(0,4),(2,5),(3,1),(3,5),(4,2),(4,3)],6)
=> [3,2]
=> 2 = 3 - 1
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> [1]
=> -1 = 0 - 1
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [2]
=> 1 = 2 - 1
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
=> [2]
=> 1 = 2 - 1
([(0,6),(1,6),(3,4),(4,2),(5,3),(6,5)],7)
=> [2]
=> 1 = 2 - 1
([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> [3,2]
=> 2 = 3 - 1
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
=> [2]
=> 1 = 2 - 1
([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [3,2]
=> 2 = 3 - 1
([(0,6),(1,3),(1,6),(3,5),(4,2),(5,4),(6,5)],7)
=> [3,2]
=> 2 = 3 - 1
([(0,4),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3)],7)
=> [3,2]
=> 2 = 3 - 1
([(0,5),(3,4),(4,6),(5,3),(6,1),(6,2)],7)
=> [2]
=> 1 = 2 - 1
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> [1]
=> -1 = 0 - 1
([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
=> [2]
=> 1 = 2 - 1
([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7)
=> [2]
=> 1 = 2 - 1
([(0,4),(1,7),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3),(6,7)],8)
=> [3,2]
=> 2 = 3 - 1
Description
The Andrews-Garvan crank of a partition. If $\pi$ is a partition, let $l(\pi)$ be its length (number of parts), $\omega(\pi)$ be the number of parts equal to 1, and $\mu(\pi)$ be the number of parts larger than $\omega(\pi)$. The crank is then defined by $$ c(\pi) = \begin{cases} l(\pi) &\text{if \(\omega(\pi)=0\)}\\ \mu(\pi) - \omega(\pi) &\text{otherwise}. \end{cases} $$ This statistic was defined in [1] to explain Ramanujan's partition congruence $$p(11n+6) \equiv 0 \pmod{11}$$ in the same way as the Dyson rank ([[St000145]]) explains the congruences $$p(5n+4) \equiv 0 \pmod{5}$$ and $$p(7n+5) \equiv 0 \pmod{7}.$$
Mp00110: Posets Greene-Kleitman invariantInteger partitions
Mp00202: Integer partitions first row removalInteger partitions
St000380: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> [1]
=> []
=> 0
([],2)
=> [1,1]
=> [1]
=> 2
([(0,1)],2)
=> [2]
=> []
=> 0
([(0,1),(0,2)],3)
=> [2,1]
=> [1]
=> 2
([(0,2),(2,1)],3)
=> [3]
=> []
=> 0
([(0,2),(1,2)],3)
=> [2,1]
=> [1]
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> [3,1]
=> [1]
=> 2
([(0,3),(3,1),(3,2)],4)
=> [3,1]
=> [1]
=> 2
([(0,3),(1,3),(3,2)],4)
=> [3,1]
=> [1]
=> 2
([(0,3),(1,2),(1,3)],4)
=> [2,2]
=> [2]
=> 3
([(0,3),(2,1),(3,2)],4)
=> [4]
=> []
=> 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [4,1]
=> [1]
=> 2
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> [3,2]
=> [2]
=> 3
([(0,4),(1,4),(2,3),(4,2)],5)
=> [4,1]
=> [1]
=> 2
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> [3,2]
=> [2]
=> 3
([(0,3),(3,4),(4,1),(4,2)],5)
=> [4,1]
=> [1]
=> 2
([(0,4),(2,3),(3,1),(4,2)],5)
=> [5]
=> []
=> 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [4,1]
=> [1]
=> 2
([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [5,1]
=> [1]
=> 2
([(0,4),(1,2),(1,4),(2,5),(4,5),(5,3)],6)
=> [4,2]
=> [2]
=> 3
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> [4,2]
=> [2]
=> 3
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> [5,1]
=> [1]
=> 2
([(0,4),(3,5),(4,3),(5,1),(5,2)],6)
=> [5,1]
=> [1]
=> 2
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [5,1]
=> [1]
=> 2
([(0,4),(2,5),(3,1),(3,5),(4,2),(4,3)],6)
=> [4,2]
=> [2]
=> 3
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> [6]
=> []
=> 0
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [5,1]
=> [1]
=> 2
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
=> [6,1]
=> [1]
=> 2
([(0,6),(1,6),(3,4),(4,2),(5,3),(6,5)],7)
=> [6,1]
=> [1]
=> 2
([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> [5,2]
=> [2]
=> 3
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
=> [6,1]
=> [1]
=> 2
([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [5,2]
=> [2]
=> 3
([(0,6),(1,3),(1,6),(3,5),(4,2),(5,4),(6,5)],7)
=> [5,2]
=> [2]
=> 3
([(0,4),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3)],7)
=> [5,2]
=> [2]
=> 3
([(0,5),(3,4),(4,6),(5,3),(6,1),(6,2)],7)
=> [6,1]
=> [1]
=> 2
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> [7]
=> []
=> 0
([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
=> [6,1]
=> [1]
=> 2
([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7)
=> [6,1]
=> [1]
=> 2
([(0,4),(1,7),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3),(6,7)],8)
=> [6,2]
=> [2]
=> 3
Description
Half of the maximal perimeter of a rectangle fitting into the diagram of an integer partition. Put differently, this is the smallest number $n$ such that the partition fits into the triangular partition $(n-1,n-2,\dots,1)$.
Matching statistic: St001194
Mp00307: Posets promotion cycle typeInteger partitions
Mp00043: Integer partitions to Dyck pathDyck paths
St001194: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> [1]
=> [1,0,1,0]
=> 0
([],2)
=> [2]
=> [1,1,0,0,1,0]
=> 2
([(0,1)],2)
=> [1]
=> [1,0,1,0]
=> 0
([(0,1),(0,2)],3)
=> [2]
=> [1,1,0,0,1,0]
=> 2
([(0,2),(2,1)],3)
=> [1]
=> [1,0,1,0]
=> 0
([(0,2),(1,2)],3)
=> [2]
=> [1,1,0,0,1,0]
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> [2]
=> [1,1,0,0,1,0]
=> 2
([(0,3),(3,1),(3,2)],4)
=> [2]
=> [1,1,0,0,1,0]
=> 2
([(0,3),(1,3),(3,2)],4)
=> [2]
=> [1,1,0,0,1,0]
=> 2
([(0,3),(1,2),(1,3)],4)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 3
([(0,3),(2,1),(3,2)],4)
=> [1]
=> [1,0,1,0]
=> 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [2]
=> [1,1,0,0,1,0]
=> 2
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 3
([(0,4),(1,4),(2,3),(4,2)],5)
=> [2]
=> [1,1,0,0,1,0]
=> 2
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 3
([(0,3),(3,4),(4,1),(4,2)],5)
=> [2]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(2,3),(3,1),(4,2)],5)
=> [1]
=> [1,0,1,0]
=> 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [2]
=> [1,1,0,0,1,0]
=> 2
([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [2]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(1,2),(1,4),(2,5),(4,5),(5,3)],6)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 3
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 3
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> [2]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(3,5),(4,3),(5,1),(5,2)],6)
=> [2]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [2]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(2,5),(3,1),(3,5),(4,2),(4,3)],6)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 3
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> [1]
=> [1,0,1,0]
=> 0
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [2]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
=> [2]
=> [1,1,0,0,1,0]
=> 2
([(0,6),(1,6),(3,4),(4,2),(5,3),(6,5)],7)
=> [2]
=> [1,1,0,0,1,0]
=> 2
([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 3
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
=> [2]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 3
([(0,6),(1,3),(1,6),(3,5),(4,2),(5,4),(6,5)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 3
([(0,4),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 3
([(0,5),(3,4),(4,6),(5,3),(6,1),(6,2)],7)
=> [2]
=> [1,1,0,0,1,0]
=> 2
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> [1]
=> [1,0,1,0]
=> 0
([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
=> [2]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7)
=> [2]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(1,7),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3),(6,7)],8)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 3
Description
The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module
Mp00307: Posets promotion cycle typeInteger partitions
Mp00043: Integer partitions to Dyck pathDyck paths
St001228: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> [1]
=> [1,0,1,0]
=> 2 = 0 + 2
([],2)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,1)],2)
=> [1]
=> [1,0,1,0]
=> 2 = 0 + 2
([(0,1),(0,2)],3)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,2),(2,1)],3)
=> [1]
=> [1,0,1,0]
=> 2 = 0 + 2
([(0,2),(1,2)],3)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,3),(3,1),(3,2)],4)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,3),(1,3),(3,2)],4)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,3),(1,2),(1,3)],4)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 5 = 3 + 2
([(0,3),(2,1),(3,2)],4)
=> [1]
=> [1,0,1,0]
=> 2 = 0 + 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 5 = 3 + 2
([(0,4),(1,4),(2,3),(4,2)],5)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 5 = 3 + 2
([(0,3),(3,4),(4,1),(4,2)],5)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,4),(2,3),(3,1),(4,2)],5)
=> [1]
=> [1,0,1,0]
=> 2 = 0 + 2
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,4),(1,2),(1,4),(2,5),(4,5),(5,3)],6)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 5 = 3 + 2
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 5 = 3 + 2
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,4),(3,5),(4,3),(5,1),(5,2)],6)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,4),(2,5),(3,1),(3,5),(4,2),(4,3)],6)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 5 = 3 + 2
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> [1]
=> [1,0,1,0]
=> 2 = 0 + 2
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,6),(1,6),(3,4),(4,2),(5,3),(6,5)],7)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 5 = 3 + 2
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 5 = 3 + 2
([(0,6),(1,3),(1,6),(3,5),(4,2),(5,4),(6,5)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 5 = 3 + 2
([(0,4),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 5 = 3 + 2
([(0,5),(3,4),(4,6),(5,3),(6,1),(6,2)],7)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> [1]
=> [1,0,1,0]
=> 2 = 0 + 2
([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,4),(1,7),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3),(6,7)],8)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 5 = 3 + 2
Description
The vector space dimension of the space of module homomorphisms between J and itself when J denotes the Jacobson radical of the corresponding Nakayama algebra.
Mp00307: Posets promotion cycle typeInteger partitions
Mp00043: Integer partitions to Dyck pathDyck paths
St001254: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> [1]
=> [1,0,1,0]
=> 2 = 0 + 2
([],2)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,1)],2)
=> [1]
=> [1,0,1,0]
=> 2 = 0 + 2
([(0,1),(0,2)],3)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,2),(2,1)],3)
=> [1]
=> [1,0,1,0]
=> 2 = 0 + 2
([(0,2),(1,2)],3)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,3),(3,1),(3,2)],4)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,3),(1,3),(3,2)],4)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,3),(1,2),(1,3)],4)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 5 = 3 + 2
([(0,3),(2,1),(3,2)],4)
=> [1]
=> [1,0,1,0]
=> 2 = 0 + 2
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 5 = 3 + 2
([(0,4),(1,4),(2,3),(4,2)],5)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 5 = 3 + 2
([(0,3),(3,4),(4,1),(4,2)],5)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,4),(2,3),(3,1),(4,2)],5)
=> [1]
=> [1,0,1,0]
=> 2 = 0 + 2
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,4),(1,2),(1,4),(2,5),(4,5),(5,3)],6)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 5 = 3 + 2
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 5 = 3 + 2
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,4),(3,5),(4,3),(5,1),(5,2)],6)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,4),(2,5),(3,1),(3,5),(4,2),(4,3)],6)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 5 = 3 + 2
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> [1]
=> [1,0,1,0]
=> 2 = 0 + 2
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,6),(1,6),(3,4),(4,2),(5,3),(6,5)],7)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 5 = 3 + 2
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 5 = 3 + 2
([(0,6),(1,3),(1,6),(3,5),(4,2),(5,4),(6,5)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 5 = 3 + 2
([(0,4),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 5 = 3 + 2
([(0,5),(3,4),(4,6),(5,3),(6,1),(6,2)],7)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> [1]
=> [1,0,1,0]
=> 2 = 0 + 2
([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7)
=> [2]
=> [1,1,0,0,1,0]
=> 4 = 2 + 2
([(0,4),(1,7),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3),(6,7)],8)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> 5 = 3 + 2
Description
The vector space dimension of the first extension-group between A/soc(A) and J when A is the corresponding Nakayama algebra with Jacobson radical J.
Mp00307: Posets promotion cycle typeInteger partitions
Mp00043: Integer partitions to Dyck pathDyck paths
Mp00101: Dyck paths decomposition reverseDyck paths
St000005: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([],2)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,1)],2)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,1),(0,2)],3)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,2),(2,1)],3)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,2),(1,2)],3)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,3),(3,1),(3,2)],4)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,3),(1,3),(3,2)],4)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,3),(1,2),(1,3)],4)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,3),(2,1),(3,2)],4)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,4),(1,4),(2,3),(4,2)],5)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,3),(3,4),(4,1),(4,2)],5)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(2,3),(3,1),(4,2)],5)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(1,2),(1,4),(2,5),(4,5),(5,3)],6)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(3,5),(4,3),(5,1),(5,2)],6)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(2,5),(3,1),(3,5),(4,2),(4,3)],6)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,6),(1,6),(3,4),(4,2),(5,3),(6,5)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,6),(1,3),(1,6),(3,5),(4,2),(5,4),(6,5)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,4),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,5),(3,4),(4,6),(5,3),(6,1),(6,2)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(1,7),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3),(6,7)],8)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
Description
The bounce statistic of a Dyck path. The '''bounce path''' $D'$ of a Dyck path $D$ is the Dyck path obtained from $D$ by starting at the end point $(2n,0)$, traveling north-west until hitting $D$, then bouncing back south-west to the $x$-axis, and repeating this procedure until finally reaching the point $(0,0)$. The points where $D'$ touches the $x$-axis are called '''bounce points''', and a bounce path is uniquely determined by its bounce points. This statistic is given by the sum of all $i$ for which the bounce path $D'$ of $D$ touches the $x$-axis at $(2i,0)$. In particular, the bounce statistics of $D$ and $D'$ coincide.
Mp00307: Posets promotion cycle typeInteger partitions
Mp00043: Integer partitions to Dyck pathDyck paths
Mp00101: Dyck paths decomposition reverseDyck paths
St000120: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([],2)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,1)],2)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,1),(0,2)],3)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,2),(2,1)],3)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,2),(1,2)],3)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,3),(3,1),(3,2)],4)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,3),(1,3),(3,2)],4)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,3),(1,2),(1,3)],4)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,3),(2,1),(3,2)],4)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,4),(1,4),(2,3),(4,2)],5)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,3),(3,4),(4,1),(4,2)],5)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(2,3),(3,1),(4,2)],5)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(1,2),(1,4),(2,5),(4,5),(5,3)],6)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(3,5),(4,3),(5,1),(5,2)],6)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(2,5),(3,1),(3,5),(4,2),(4,3)],6)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,6),(1,6),(3,4),(4,2),(5,3),(6,5)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,6),(1,3),(1,6),(3,5),(4,2),(5,4),(6,5)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,4),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,5),(3,4),(4,6),(5,3),(6,1),(6,2)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(1,7),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3),(6,7)],8)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
Description
The number of left tunnels of a Dyck path. A tunnel is a pair (a,b) where a is the position of an open parenthesis and b is the position of the matching close parenthesis. If a+b
Mp00307: Posets promotion cycle typeInteger partitions
Mp00043: Integer partitions to Dyck pathDyck paths
Mp00120: Dyck paths Lalanne-Kreweras involutionDyck paths
St000419: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([],2)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,1)],2)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,1),(0,2)],3)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,2),(2,1)],3)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,2),(1,2)],3)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,3),(3,1),(3,2)],4)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,3),(1,3),(3,2)],4)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,3),(1,2),(1,3)],4)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 3
([(0,3),(2,1),(3,2)],4)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 3
([(0,4),(1,4),(2,3),(4,2)],5)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 3
([(0,3),(3,4),(4,1),(4,2)],5)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,4),(2,3),(3,1),(4,2)],5)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,4),(1,2),(1,4),(2,5),(4,5),(5,3)],6)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 3
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 3
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,4),(3,5),(4,3),(5,1),(5,2)],6)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,4),(2,5),(3,1),(3,5),(4,2),(4,3)],6)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 3
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,6),(1,6),(3,4),(4,2),(5,3),(6,5)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 3
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 3
([(0,6),(1,3),(1,6),(3,5),(4,2),(5,4),(6,5)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 3
([(0,4),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 3
([(0,5),(3,4),(4,6),(5,3),(6,1),(6,2)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,4),(1,7),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3),(6,7)],8)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,1,0,0,0]
=> 3
Description
The number of Dyck paths that are weakly above the Dyck path, except for the path itself.
Mp00307: Posets promotion cycle typeInteger partitions
Mp00043: Integer partitions to Dyck pathDyck paths
Mp00101: Dyck paths decomposition reverseDyck paths
St000476: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([],2)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,1)],2)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,1),(0,2)],3)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,2),(2,1)],3)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,2),(1,2)],3)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,3),(3,1),(3,2)],4)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,3),(1,3),(3,2)],4)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,3),(1,2),(1,3)],4)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,3),(2,1),(3,2)],4)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,4),(1,4),(2,3),(4,2)],5)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,3),(3,4),(4,1),(4,2)],5)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(2,3),(3,1),(4,2)],5)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(1,2),(1,4),(2,5),(4,5),(5,3)],6)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(3,5),(4,3),(5,1),(5,2)],6)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(2,5),(3,1),(3,5),(4,2),(4,3)],6)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,6),(1,6),(3,4),(4,2),(5,3),(6,5)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,6),(1,3),(1,6),(3,5),(4,2),(5,4),(6,5)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,4),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
([(0,5),(3,4),(4,6),(5,3),(6,1),(6,2)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 2
([(0,4),(1,7),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3),(6,7)],8)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> 3
Description
The sum of the semi-lengths of tunnels before a valley of a Dyck path. For each valley $v$ in a Dyck path $D$ there is a corresponding tunnel, which is the factor $T_v = s_i\dots s_j$ of $D$ where $s_i$ is the step after the first intersection of $D$ with the line $y = ht(v)$ to the left of $s_j$. This statistic is $$ \sum_v (j_v-i_v)/2. $$
Mp00307: Posets promotion cycle typeInteger partitions
Mp00043: Integer partitions to Dyck pathDyck paths
Mp00229: Dyck paths Delest-ViennotDyck paths
St000645: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
([],1)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([],2)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,1)],2)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,1),(0,2)],3)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,2),(2,1)],3)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,2),(1,2)],3)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,1),(0,2),(1,3),(2,3)],4)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,3),(3,1),(3,2)],4)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,3),(1,3),(3,2)],4)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,3),(1,2),(1,3)],4)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 3
([(0,3),(2,1),(3,2)],4)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,2),(0,3),(2,4),(3,4),(4,1)],5)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,2),(0,3),(2,4),(3,1),(3,4)],5)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 3
([(0,4),(1,4),(2,3),(4,2)],5)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,3),(1,2),(1,3),(2,4),(3,4)],5)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 3
([(0,3),(3,4),(4,1),(4,2)],5)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,4),(2,3),(3,1),(4,2)],5)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,3),(1,4),(2,4),(3,1),(3,2)],5)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,5),(1,5),(3,2),(4,3),(5,4)],6)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,4),(1,2),(1,4),(2,5),(4,5),(5,3)],6)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 3
([(0,2),(0,3),(1,5),(2,4),(3,1),(3,4),(4,5)],6)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 3
([(0,2),(0,3),(2,5),(3,5),(4,1),(5,4)],6)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,4),(3,5),(4,3),(5,1),(5,2)],6)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,4),(1,5),(2,5),(4,1),(4,2),(5,3)],6)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,4),(2,5),(3,1),(3,5),(4,2),(4,3)],6)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 3
([(0,5),(2,4),(3,2),(4,1),(5,3)],6)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,3),(1,5),(2,5),(3,4),(4,1),(4,2)],6)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,4),(1,6),(2,6),(4,5),(5,1),(5,2),(6,3)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,6),(1,6),(3,4),(4,2),(5,3),(6,5)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,3),(0,4),(2,6),(3,5),(4,2),(4,5),(5,6),(6,1)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 3
([(0,2),(0,3),(2,6),(3,6),(4,1),(5,4),(6,5)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,4),(1,6),(2,5),(3,1),(3,5),(4,2),(4,3),(5,6)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 3
([(0,6),(1,3),(1,6),(3,5),(4,2),(5,4),(6,5)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 3
([(0,4),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3)],7)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 3
([(0,5),(3,4),(4,6),(5,3),(6,1),(6,2)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,6),(2,3),(3,5),(4,2),(5,1),(6,4)],7)
=> [1]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
([(0,5),(2,6),(3,6),(4,1),(5,2),(5,3),(6,4)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,4),(1,6),(2,6),(3,5),(4,3),(5,1),(5,2)],7)
=> [2]
=> [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 2
([(0,4),(1,7),(2,6),(3,1),(3,6),(4,5),(5,2),(5,3),(6,7)],8)
=> [3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 3
Description
The sum of the areas of the rectangles formed by two consecutive peaks and the valley in between. For a Dyck path $D = D_1 \cdots D_{2n}$ with peaks in positions $i_1 < \ldots < i_k$ and valleys in positions $j_1 < \ldots < j_{k-1}$, this statistic is given by $$ \sum_{a=1}^{k-1} (j_a-i_a)(i_{a+1}-j_a) $$
The following 655 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000946The sum of the skew hook positions in a Dyck path. St000947The major index east count of a Dyck path. St001034The area of the parallelogram polyomino associated with the Dyck path. St001161The major index north count of a Dyck path. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. 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. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001274The number of indecomposable injective modules with projective dimension equal to two. St001275The projective dimension of the second term in a minimal injective coresolution of the regular module. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St000014The number of parking functions supported by a Dyck path. St000420The number of Dyck paths that are weakly above a Dyck path. St000874The position of the last double rise in a Dyck path. 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. St001182Number of indecomposable injective modules with codominant dimension at least two in the corresponding Nakayama algebra. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. 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. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. 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. St001473The absolute value of the sum of all entries of the Coxeter matrix of the corresponding LNakayama algebra. St001643The Frobenius dimension of the Nakayama algebra corresponding to the Dyck path. St001800The number of 3-Catalan paths having this Dyck path as first and last coordinate projections. St001808The box weight or horizontal decoration of a Dyck path. St000395The sum of the heights of the peaks of a Dyck path. St000438The position of the last up step in a Dyck path. St000950Number of tilting modules of the corresponding LNakayama algebra, where a tilting module is a generalised tilting module of projective dimension 1. St000979Half of MacMahon's equal index of a Dyck path. St001018Sum of projective dimension of the indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001019Sum of the projective dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001348The bounce of the parallelogram polyomino associated with the Dyck path. St001809The index of the step at the first peak of maximal height in a Dyck path. St001213The number of indecomposable modules in the corresponding Nakayama algebra that have vanishing first Ext-group with the regular module. St001259The vector space dimension of the double dual of D(A) in the corresponding Nakayama algebra. St001003The number of indecomposable modules with projective dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001458The rank of the adjacency matrix of a graph. St000463The number of admissible inversions of a permutation. St000673The number of non-fixed points of a permutation. St001005The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both. St001391The disjunction number of a graph. St000509The diagonal index (content) of a partition. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000928The sum of the coefficients of the character polynomial of an integer partition. 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. St000940The number of characters of the symmetric group whose value on the partition is zero. St000941The number of characters of the symmetric group whose value on the partition is even. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St000937The number of positive values of the symmetric group character corresponding to the partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St000997The even-odd crank of an integer partition. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. 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. St000460The hook length of the last cell along the main diagonal of an integer partition. St000667The greatest common divisor of the parts of the partition. St000668The least common multiple of the parts of the partition. St000681The Grundy value of Chomp on Ferrers diagrams. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000744The length of the path to the largest entry in a standard Young tableau. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000870The product of the hook lengths of the diagonal cells in an integer partition. St001128The exponens consonantiae of a partition. St001360The number of covering relations in Young's lattice below a partition. St001378The product of the cohook lengths of the integer partition. St001380The number of monomer-dimer tilings of a Ferrers diagram. St001389The number of partitions of the same length below the given integer partition. St001527The cyclic permutation representation number of an integer partition. St001571The Cartan determinant of the integer partition. St001600The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple graphs. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001607The number of coloured graphs 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. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St000145The Dyson rank of a partition. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000508Eigenvalues of the random-to-random operator acting on a simple module. St000659The number of rises of length at least 2 of a Dyck path. St000661The number of rises of length 3 of a Dyck path. St000931The number of occurrences of the pattern UUU in a Dyck path. St000934The 2-degree of an integer partition. St000944The 3-degree of an integer partition. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. 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. St001141The number of occurrences of hills of size 3 in a Dyck path. 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. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001502The global dimension minus the dominant dimension of magnitude 1 Nakayama algebras. St001541The Gini index of an integer partition. St001587Half of the largest even part of an integer partition. St001657The number of twos in an integer partition. 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. St000477The weight of a partition according to Alladi. St000063The number of linear extensions of a certain poset defined for an integer partition. St000108The number of partitions contained in the given partition. St000144The pyramid weight of the Dyck path. St000393The number of strictly increasing runs in a binary word. St000439The position of the first down step of a Dyck path. St000444The length of the maximal rise of a Dyck path. St000529The number of permutations whose descent word is the given binary word. St000532The total number of rook placements on a Ferrers board. St000543The size of the conjugacy class of a binary word. St000626The minimal period of a binary word. St000675The number of centered multitunnels of a Dyck path. St000949Gives the number of generalised tilting modules of the corresponding LNakayama algebra. 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}$. 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}$. St000981The length of the longest zigzag subpath. St000998Number of indecomposable projective modules with injective dimension smaller than or equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. St001020Sum of the codominant dimensions of the non-projective indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001023Number of simple modules with projective dimension at most 3 in the Nakayama algebra corresponding to the Dyck path. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001065Number of indecomposable reflexive modules in the corresponding Nakayama algebra. St001166Number of indecomposable projective non-injective modules with dominant dimension equal to the global dimension plus the number of indecomposable projective injective modules in the corresponding Nakayama algebra. St001179Number of indecomposable injective modules with projective dimension at most 2 in the corresponding Nakayama algebra. St001180Number of indecomposable injective modules with projective dimension at most 1. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001190Number of simple modules with projective dimension at most 4 in the corresponding Nakayama algebra. 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$. St001211The number of simple modules in the corresponding Nakayama algebra that have vanishing second Ext-group with the regular module. 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. St001237The number of simple modules with injective dimension at most one or dominant dimension at least one. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001267The length of the Lyndon factorization of the binary word. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001400The total number of Littlewood-Richardson tableaux of given shape. St001437The flex of a binary word. St001492The number of simple modules that do not appear in the socle of the regular module or have no nontrivial selfextensions with the regular module in the corresponding Nakayama algebra. St001498The normalised height of a Nakayama algebra with magnitude 1. St001500The global dimension of magnitude 1 Nakayama algebras. St001504The sum of all indegrees of vertices with indegree at least two in the resolution quiver of a Nakayama algebra corresponding to the Dyck path. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St001650The order of Ringel's homological bijection associated to the linear Nakayama algebra corresponding to the Dyck path. St001658The total number of rook placements on a Ferrers board. St001814The number of partitions interlacing the given partition. St000006The dinv of a Dyck path. St000010The length of the partition. 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. St000038The product of the heights of the descending steps of a Dyck path. St000048The multinomial of the parts of a partition. St000088The row sums of the character table of the symmetric group. St000147The largest part of an integer partition. St000148The number of odd parts of a partition. St000160The multiplicity of the smallest part of a partition. St000179The product of the hook lengths of the integer partition. St000184The size of the centralizer of any permutation of given cycle type. St000228The size of a partition. St000293The number of inversions of a binary word. St000321The number of integer partitions of n that are dominated by an integer partition. St000326The position of the first one in a binary word after appending a 1 at the end. St000335The difference of lower and upper interactions. St000345The number of refinements of a partition. St000346The number of coarsenings of a partition. St000378The diagonal inversion number of an integer partition. St000384The maximal part of the shifted composition of an integer partition. St000418The number of Dyck paths that are weakly below a Dyck path. St000442The maximal area to the right of an up step of a Dyck path. St000443The number of long tunnels of a Dyck path. St000459The hook length of the base cell of a partition. St000475The number of parts equal to 1 in a partition. St000519The largest length of a factor maximising the subword complexity. St000531The leading coefficient of the rook polynomial of an integer partition. St000548The number of different non-empty partial sums of an integer partition. St000631The number of distinct palindromic decompositions of a binary word. St000644The number of graphs with given frequency partition. St000678The number of up steps after the last double rise of a Dyck path. St000683The number of points below the Dyck path such that the diagonal to the north-east hits the path between two down steps, and the diagonal to the north-west hits the path between two up steps. 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. St000693The modular (standard) major index of a standard tableau. St000734The last entry in the first row of a standard tableau. St000784The maximum of the length and the largest part of the integer partition. St000811The sum of the entries in the column specified by the partition of the change of basis matrix from powersum symmetric functions to Schur symmetric functions. 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. St000814The sum of the entries in the column specified by the partition of the change of basis matrix from elementary symmetric functions to Schur symmetric functions. St000835The minimal difference in size when partitioning the integer partition into two subpartitions. St000867The sum of the hook lengths in the first row of an integer partition. St000922The minimal number such that all substrings of this length are unique. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000935The number of ordered refinements of an integer partition. St000952Gives the number of irreducible factors of the Coxeter polynomial of the Dyck path over the rational numbers. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St000967The value p(1) for the Coxeterpolynomial p of the corresponding LNakayama algebra. St000982The length of the longest constant subword. St000992The alternating sum of the parts of an integer partition. St001007Number of simple modules with projective dimension 1 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. St001015Number of indecomposable injective modules with codominant dimension equal to one in the Nakayama algebra corresponding to the Dyck path. St001016Number of indecomposable injective modules with codominant dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001055The Grundy value for the game of removing cells of a row in an integer partition. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. St001127The sum of the squares of the parts of a partition. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. 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. 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: 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. St001218Smallest index k greater than or equal to one such that the Coxeter matrix C of the corresponding Nakayama algebra has C^k=1. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St001242The toal dimension of certain Sn modules determined by LLT polynomials associated with a Dyck path. St001243The sum of coefficients in the Schur basis of certain LLT polynomials associated with a Dyck path. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001249Sum of the odd parts of a partition. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001257The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001297The number of indecomposable non-injective projective modules minus the number of indecomposable non-injective projective modules that have reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001299The product of all non-zero projective dimensions of simple modules of the corresponding Nakayama algebra. St001365The number of lattice paths of the same length weakly above the path given by a binary word. St001387Number of standard Young tableaux of the skew shape tracing the border of the given partition. St001432The order dimension of the partition. 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. St001488The number of corners of a skew partition. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. 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. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001530The depth of a Dyck path. St001531Number of partial orders contained in the poset determined by the Dyck path. St001561The value of the elementary symmetric function evaluated at 1. St001608The number of coloured rooted trees such that the multiplicities of colours are given by a 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. St001688The sum of the squares of the heights of the peaks of a Dyck path. St001710The number of permutations such that conjugation with a permutation of given cycle type yields the inverse permutation. St001733The number of weak left to right maxima of a Dyck path. St001780The order of promotion on the set of standard tableaux of given shape. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001838The number of nonempty primitive factors of a binary word. 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. 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. St001933The largest multiplicity of a part in an integer partition. 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. St001959The product of the heights of the peaks of a Dyck path. St000012The area of a Dyck path. St000016The number of attacking pairs of a standard tableau. St000053The number of valleys of the Dyck path. St000142The number of even parts of a partition. St000143The largest repeated part of a partition. St000149The number of cells of the partition whose leg is zero and arm is odd. St000150The floored half-sum of the multiplicities of a partition. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000185The weighted size of a 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. St000306The bounce count of a Dyck path. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000331The number of upper interactions of a Dyck path. St000369The dinv deficit of a Dyck path. St000376The bounce deficit of a Dyck path. St000377The dinv defect of an integer partition. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000421The number of Dyck paths that are weakly below a Dyck path, except for the path itself. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000480The number of lower covers of a partition in dominance order. St000481The number of upper covers of a partition in dominance order. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000513The number of invariant subsets of size 2 when acting with a permutation of given cycle type. St000547The number of even non-empty partial sums of an integer partition. St000658The number of rises of length 2 of a Dyck path. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. 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. St000790The number of pairs of centered tunnels, one strictly containing the other, of a Dyck path. St000791The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. St000877The depth of the binary word interpreted as a path. St000885The number of critical steps in the Catalan decomposition of a binary word. St000921The number of internal inversions of a binary word. St000932The number of occurrences of the pattern UDU in a Dyck path. St000954Number of times the corresponding LNakayama algebra has $Ext^i(D(A),A)=0$ for $i>0$. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama algebra. St000976The sum of the positions of double up-steps of a Dyck path. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St000984The number of boxes below precisely one peak. St001008Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001010Number of indecomposable injective modules with projective dimension g-1 when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001017Number of indecomposable injective modules with projective dimension equal to the codominant dimension in the Nakayama algebra corresponding to the Dyck path. St001026The maximum of the projective dimensions of the indecomposable non-projective injective modules minus the minimum in the Nakayama algebra corresponding to the Dyck path. St001027Number of simple modules with projective dimension equal to injective dimension in the Nakayama algebra corresponding to the Dyck path. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001091The number of parts in an integer partition whose next smaller part has the same size. St001092The number of distinct even parts of a partition. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001126Number of simple module that are 1-regular in the corresponding Nakayama algebra. St001139The number of occurrences of hills of size 2 in 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. 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. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001176The size of a partition minus its first part. 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. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001197The global dimension of $eAe$ for 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. 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$. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001217The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular 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. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001251The number of parts of a partition that are not congruent 1 modulo 3. St001252Half the sum of the even parts of a partition. St001273The projective dimension of the first term in an injective coresolution of the regular module. St001276The number of 2-regular indecomposable modules in the corresponding Nakayama algebra. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001371The length of the longest Yamanouchi prefix of a binary word. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. St001424The number of distinct squares in a binary word. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001480The number of simple summands of the module J^2/J^3. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001586The number of odd parts smaller than the largest even part in an integer partition. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001721The degree of a binary word. St001730The number of times the path corresponding to a binary word crosses the base line. St001873For a Nakayama algebra corresponding to a Dyck path, we define the matrix C with entries the Hom-spaces between $e_i J$ and $e_j J$ (the radical of the indecomposable projective modules). St001932The number of pairs of singleton blocks in the noncrossing set partition corresponding to a Dyck path, that can be merged to create another noncrossing set partition. St001961The sum of the greatest common divisors of all pairs of parts. St000474Dyson's crank of a partition. St000826The stopping time of the decimal representation of the binary word for the 3x+1 problem. St001118The acyclic chromatic index of a graph. St000642The size of the smallest orbit of antichains under Panyushev complementation. St000172The Grundy number of a graph. St000244The cardinality of the automorphism group of a graph. St000258The burning number of a graph. St000276The size of the preimage of the map 'to graph' from Ordered trees to Graphs. St000286The number of connected components of the complement of a graph. St000364The exponent of the automorphism group of a graph. St000388The number of orbits of vertices of a graph under automorphisms. St000469The distinguishing number of a graph. St000553The number of blocks of a graph. St000636The hull number of a graph. St000722The number of different neighbourhoods in a graph. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000822The Hadwiger number of the graph. St000849The number of 1/3-balanced pairs in a poset. St000850The number of 1/2-balanced pairs in a poset. St000917The open packing number of a graph. St000918The 2-limited packing number of a graph. St001029The size of the core of a graph. St001057The Grundy value of the game of creating an independent set in a graph. St001109The number of proper colourings of a graph with as few colours as possible. St001111The weak 2-dynamic chromatic number of a graph. St001112The 3-weak dynamic number of a graph. St001116The game chromatic number of a graph. St001261The Castelnuovo-Mumford regularity of a graph. St001286The annihilation number of a graph. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001315The dissociation number of a graph. St001316The domatic number of a graph. St001330The hat guessing number of a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001352The number of internal nodes in the modular decomposition of a graph. St001366The maximal multiplicity of a degree of a vertex of a graph. St001494The Alon-Tarsi number of a graph. St001580The acyclic chromatic number of a graph. St001581The achromatic number of a graph. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001627The number of coloured connected graphs such that the multiplicities of colours are given by a partition. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001642The Prague dimension of a graph. St001654The monophonic hull number of a graph. St001655The general position number of a graph. St001656The monophonic position number of a graph. St001670The connected partition number of a graph. St001716The 1-improper chromatic number of a graph. St001734The lettericity of a graph. St001765The number of connected components of the friends and strangers graph. St001774The degree of the minimal polynomial of the smallest eigenvalue of a graph. St001775The degree of the minimal polynomial of the largest eigenvalue of a graph. St001844The maximal degree of a generator of the invariant ring of the automorphism group of a graph. St001883The mutual visibility number of a graph. St001917The order of toric promotion on the set of labellings of a graph. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001938The number of transitive monotone factorizations of genus zero of a permutation of given cycle type. St001951The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. St001963The tree-depth of a graph. St001967The coefficient of the monomial corresponding to the integer partition in a certain power series. St001968The coefficient of the monomial corresponding to the integer partition in a certain power series. St000260The radius of a connected graph. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000272The treewidth of a graph. St000310The minimal degree of a vertex of a graph. St000362The size of a minimal vertex cover of a graph. St000387The matching number of a graph. St000448The number of pairs of vertices of a graph with distance 2. St000535The rank-width of a graph. St000536The pathwidth of a graph. St000537The cutwidth of a graph. St000552The number of cut vertices of a graph. St000778The metric dimension of a graph. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St001270The bandwidth of a graph. St001271The competition number of a graph. St001277The degeneracy of a graph. St001308The number of induced paths on three vertices in a graph. St001323The independence gap of a graph. St001333The cardinality of a minimal edge-isolating set of a graph. St001340The cardinality of a minimal non-edge isolating set of a graph. St001347The number of pairs of vertices of a graph having the same neighbourhood. St001349The number of different graphs obtained from the given graph by removing an edge. St001350Half of the Albertson index of a graph. St001354The number of series nodes in the modular decomposition of a graph. St001358The largest degree of a regular subgraph of a graph. St001393The induced matching number of a graph. St001395The number of strictly unfriendly partitions of a graph. St001459The number of zero columns in the nullspace of a graph. St001521Half the total irregularity of a graph. St001574The minimal number of edges to add or remove to make a graph regular. St001576The minimal number of edges to add or remove to make a graph vertex transitive. St001646The number of edges that can be added without increasing the maximal degree of a graph. St001689The number of celebrities in a graph. St001692The number of vertices with higher degree than the average degree in a graph. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001742The difference of the maximal and the minimal degree in a graph. St001743The discrepancy of a graph. St001764The number of non-convex subsets of vertices in a graph. St001792The arboricity of a graph. St001794Half the number of sets of vertices in a graph which are dominating and non-blocking. St001798The difference of the number of edges in a graph and the number of edges in the complement of the Turán graph. St001799The number of proper separations of a graph. St001812The biclique partition number of a graph. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St001949The rigidity index of a graph. St001962The proper pathwidth of a graph. St001971The number of negative eigenvalues of the adjacency matrix of the graph. St000235The number of indices that are not cyclical small weak excedances. St000086The number of subgraphs. St000269The number of acyclic orientations of a graph. St000270The number of forests contained in a graph. St000273The domination number of a graph. St000287The number of connected components of a graph. St000299The number of nonisomorphic vertex-induced subtrees. St000343The number of spanning subgraphs of a graph. St000363The number of minimal vertex covers of a graph. St000453The number of distinct Laplacian eigenvalues of a graph. St000468The Hosoya index of a graph. St000482The (zero)-forcing number of a graph. St000544The cop number of a graph. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000916The packing number of a graph. St000972The composition number of a graph. St001093The detour number of a graph. St001108The 2-dynamic chromatic number of a graph. St001110The 3-dynamic chromatic number of a graph. St001255The vector space dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001322The size of a minimal independent dominating set in a graph. St001339The irredundance number of a graph. St001363The Euler characteristic of a graph according to Knill. St001367The smallest number which does not occur as degree of a vertex in a graph. St001368The number of vertices of maximal degree in a graph. St001373The logarithm of the number of winning configurations of the lights out game on a graph. St001463The number of distinct columns in the nullspace of a graph. St001474The evaluation of the Tutte polynomial of the graph at (x,y) equal to (2,-1). St001674The number of vertices of the largest induced star graph in the graph. St001725The harmonious chromatic number of a graph. St001757The number of orbits of toric promotion on a graph. St001758The number of orbits of promotion on a graph. St001828The Euler characteristic of a graph. St001829The common independence number of a graph. St001872The number of indecomposable injective modules with even projective dimension in the corresponding Nakayama algebra. St000171The degree of the graph. St000263The Szeged index of a graph. St000265The Wiener index of a graph. St000361The second Zagreb index of a graph. St000454The largest eigenvalue of a graph if it is integral. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001071The beta invariant of the graph. St001117The game chromatic index of a graph. St001120The length of a longest path in a graph. St001341The number of edges in the center of a graph. St001479The number of bridges of a graph. St001512The minimum rank of a graph. St001647The number of edges that can be added without increasing the clique number. St001648The number of edges that can be added without increasing the chromatic number. St001783The number of odd automorphisms of a graph. St001826The maximal number of leaves on a vertex of a graph. St001827The number of two-component spanning forests of a graph. St001869The maximum cut size of a graph. St001902The number of potential covers of a poset. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St000422The energy of a graph, if it is integral. St000718The largest Laplacian eigenvalue of a graph if it is integral. St001626The number of maximal proper sublattices of a lattice. St000230Sum of the minimal elements of the blocks of a set partition. St000896The number of zeros on the main diagonal of an alternating sign matrix. St001697The shifted natural comajor index of a standard Young tableau. St000312The number of leaves in a graph. St001695The natural comajor index of a standard Young tableau. St000456The monochromatic index of a connected graph. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001645The pebbling number of a connected graph. St000259The diameter of a connected graph. St000302The determinant of the distance matrix of a connected graph. St000466The Gutman (or modified Schultz) index of a connected graph. St000467The hyper-Wiener index of a connected graph. St000741The Colin de Verdière graph invariant. St000455The second largest eigenvalue of a graph if it is integral. St000350The sum of the vertex degrees of a graph. St000465The first Zagreb index of a graph. St000571The F-index (or forgotten topological index) of a graph. St000915The Ore degree of a graph. 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$. St001320The minimal number of occurrences of the path-pattern in a linear ordering of the vertices of the graph. St000452The number of distinct eigenvalues of a graph. St000948The chromatic discriminant of a graph. St001072The evaluation of the Tutte polynomial of the graph at x and y equal to 3. St001303The number of dominating sets of vertices of a graph. St001475The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,0). St001618The cardinality of the Frattini sublattice of a lattice. St001472The permanent of the Coxeter matrix of the poset. St001635The trace of the square of the Coxeter matrix of the incidence algebra of a poset. 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. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001602The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on endofunctions. St001610The number of coloured endofunctions such that the multiplicities of colours are given by a partition. St000046The largest eigenvalue of the random to random operator acting on the simple module corresponding to the given partition. St000514The number of invariant simple graphs when acting with a permutation of given cycle type. St000515The number of invariant set partitions when acting with a permutation of given cycle type. 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. St001248Sum of the even parts of a partition. St001262The dimension of the maximal parabolic seaweed algebra corresponding to the partition. St001279The sum of the parts of an integer partition that are at least two. St000284The Plancherel distribution on integer partitions. St000478Another weight of a partition according to Alladi. St000510The number of invariant oriented cycles 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. St000618The number of self-evacuating tableaux of given shape. St000706The product of the factorials of the multiplicities of an integer partition. St000781The number of proper colouring schemes of a Ferrers diagram. 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. St000927The alternating sum of the coefficients of the character polynomial of an integer partition. St000993The multiplicity of the largest part of an integer partition. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001442The number of standard Young tableaux whose major index is divisible by the size of a given 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. St001568The smallest positive integer that does not appear twice in the 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. St001763The Hurwitz number of an integer partition. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001924The number of cells in an integer partition whose arm and leg length coincide. St001943The sum of the squares of the hook lengths of an integer partition. St000137The Grundy value of an integer partition. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000567The sum of the products of all pairs of parts. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000929The constant term of the character polynomial of an integer partition. 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. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001175The size of a partition minus the hook length of the base cell. St001177Twice the mean value of the major index among all standard Young tableaux of a partition. St001178Twelve times the variance of the major index among all standard Young tableaux of a partition. 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. St001383The BG-rank of an integer partition. St001525The number of symmetric hooks on the diagonal of a partition. St001939The number of parts that are equal to their multiplicity in the integer partition. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St000713The dimension of the irreducible representation of Sp(4) labelled by an integer partition. St000716The dimension of the irreducible representation of Sp(6) labelled by an integer partition. St000311The number of vertices of odd degree in a graph. St000674The number of hills of a Dyck path. St001032The number of horizontal steps in the bicoloured Motzkin path associated with the Dyck path. St001501The dominant dimension of magnitude 1 Nakayama algebras. St000735The last entry on the main diagonal of a standard tableau. St000977MacMahon's equal index of a Dyck path. St000978The sum of the positions of double down-steps of a 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. St000264The girth of a graph, which is not a tree. St001060The distinguishing index of a graph. St001545The second Elser number of a connected graph. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St000699The toughness times the least common multiple of 1,. St001281The normalized isoperimetric number of a graph. St001570The minimal number of edges to add to make a graph Hamiltonian. St001592The maximal number of simple paths between any two different vertices of a graph. St000379The number of Hamiltonian cycles in a graph. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St000464The Schultz index of a connected graph. St001703The villainy of a graph. 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.