Your data matches 552 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
St001657: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> 0
[2]
=> 1
[1,1]
=> 0
[3]
=> 0
[2,1]
=> 1
[1,1,1]
=> 0
[4]
=> 0
[3,1]
=> 0
[2,2]
=> 2
[2,1,1]
=> 1
[1,1,1,1]
=> 0
[5]
=> 0
[4,1]
=> 0
[3,2]
=> 1
[3,1,1]
=> 0
[2,2,1]
=> 2
[2,1,1,1]
=> 1
[1,1,1,1,1]
=> 0
[6]
=> 0
[5,1]
=> 0
[4,2]
=> 1
[4,1,1]
=> 0
[3,3]
=> 0
[3,2,1]
=> 1
[3,1,1,1]
=> 0
[2,2,2]
=> 3
[2,2,1,1]
=> 2
[2,1,1,1,1]
=> 1
[1,1,1,1,1,1]
=> 0
Description
The number of twos in an integer partition. The total number of twos in all partitions of $n$ is equal to the total number of singletons [[St001484]] in all partitions of $n-1$, see [1].
Mp00230: Integer partitions parallelogram polyominoDyck paths
St000335: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> 1 = 0 + 1
[2]
=> [1,0,1,0]
=> 1 = 0 + 1
[1,1]
=> [1,1,0,0]
=> 2 = 1 + 1
[3]
=> [1,0,1,0,1,0]
=> 1 = 0 + 1
[2,1]
=> [1,0,1,1,0,0]
=> 2 = 1 + 1
[1,1,1]
=> [1,1,0,1,0,0]
=> 1 = 0 + 1
[4]
=> [1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[2,2]
=> [1,1,1,0,0,0]
=> 3 = 2 + 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 1 = 0 + 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 1 = 0 + 1
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1 = 0 + 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 2 = 1 + 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1 = 0 + 1
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1 = 0 + 1
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 1 = 0 + 1
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 2 = 1 + 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> 3 = 2 + 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 1 = 0 + 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> 1 = 0 + 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> 2 = 1 + 1
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 1 = 0 + 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> 4 = 3 + 1
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> 2 = 1 + 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 1 = 0 + 1
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 1 = 0 + 1
Description
The difference of lower and upper interactions. An ''upper interaction'' in a Dyck path is the occurrence of a factor $0^k 1^k$ with $k \geq 1$ (see [[St000331]]), and a ''lower interaction'' is the occurrence of a factor $1^k 0^k$ with $k \geq 1$. In both cases, $1$ denotes an up-step $0$ denotes a a down-step.
Mp00230: Integer partitions parallelogram polyominoDyck paths
St001226: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> 2 = 0 + 2
[2]
=> [1,0,1,0]
=> 2 = 0 + 2
[1,1]
=> [1,1,0,0]
=> 3 = 1 + 2
[3]
=> [1,0,1,0,1,0]
=> 2 = 0 + 2
[2,1]
=> [1,0,1,1,0,0]
=> 3 = 1 + 2
[1,1,1]
=> [1,1,0,1,0,0]
=> 2 = 0 + 2
[4]
=> [1,0,1,0,1,0,1,0]
=> 2 = 0 + 2
[3,1]
=> [1,0,1,0,1,1,0,0]
=> 3 = 1 + 2
[2,2]
=> [1,1,1,0,0,0]
=> 4 = 2 + 2
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 2 = 0 + 2
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> 2 = 0 + 2
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> 2 = 0 + 2
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> 3 = 1 + 2
[3,2]
=> [1,0,1,1,1,0,0,0]
=> 4 = 2 + 2
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> 2 = 0 + 2
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> 3 = 1 + 2
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> 2 = 0 + 2
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> 2 = 0 + 2
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 2 = 0 + 2
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 3 = 1 + 2
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> 4 = 2 + 2
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 2 = 0 + 2
[3,3]
=> [1,1,1,0,1,0,0,0]
=> 2 = 0 + 2
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> 3 = 1 + 2
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 2 = 0 + 2
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> 5 = 3 + 2
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> 3 = 1 + 2
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 2 = 0 + 2
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> 2 = 0 + 2
Description
The 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. That is the number of i such that $Ext_A^1(J,e_i J)=0$.
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00023: Dyck paths to non-crossing permutationPermutations
St000214: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [1] => 0
[2]
=> [1,0,1,0]
=> [1,2] => 0
[1,1]
=> [1,1,0,0]
=> [2,1] => 1
[3]
=> [1,0,1,0,1,0]
=> [1,2,3] => 0
[2,1]
=> [1,0,1,1,0,0]
=> [1,3,2] => 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [2,3,1] => 0
[4]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 1
[2,2]
=> [1,1,1,0,0,0]
=> [3,2,1] => 2
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 0
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 0
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 2
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 0
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 0
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 0
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6] => 0
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,4,6,5] => 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => 2
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,2,3,5,6,4] => 0
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [4,2,3,1] => 0
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => 1
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,2,4,5,6,3] => 0
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 3
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,2,4,5,1] => 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,3,4,5,6,2] => 0
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,6,1] => 0
Description
The number of adjacencies of a permutation. An adjacency of a permutation $\pi$ is an index $i$ such that $\pi(i)-1 = \pi(i+1)$. Adjacencies are also known as ''small descents''. This can be also described as an occurrence of the bivincular pattern ([2,1], {((0,1),(1,0),(1,1),(1,2),(2,1)}), i.e., the middle row and the middle column are shaded, see [3].
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00129: Dyck paths to 321-avoiding permutation (Billey-Jockusch-Stanley)Permutations
St000234: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [1] => 0
[2]
=> [1,0,1,0]
=> [2,1] => 0
[1,1]
=> [1,1,0,0]
=> [1,2] => 1
[3]
=> [1,0,1,0,1,0]
=> [2,3,1] => 0
[2,1]
=> [1,0,1,1,0,0]
=> [2,1,3] => 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [3,1,2] => 0
[4]
=> [1,0,1,0,1,0,1,0]
=> [2,3,4,1] => 0
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [2,3,1,4] => 1
[2,2]
=> [1,1,1,0,0,0]
=> [1,2,3] => 2
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [2,4,1,3] => 0
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [3,4,1,2] => 0
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => 0
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [2,1,3,4] => 2
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => 0
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,4,2,3] => 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => 0
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => 0
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,6,1] => 0
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,5,1,6] => 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => 2
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [2,3,4,6,1,5] => 0
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [4,1,2,3] => 0
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => 1
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [2,3,5,6,1,4] => 0
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,2,3,4] => 3
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,4,5,2,3] => 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [2,4,5,6,1,3] => 0
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [3,4,5,6,1,2] => 0
Description
The number of global ascents of a permutation. The global ascents are the integers $i$ such that $$C(\pi)=\{i\in [n-1] \mid \forall 1 \leq j \leq i < k \leq n: \pi(j) < \pi(k)\}.$$ Equivalently, by the pigeonhole principle, $$C(\pi)=\{i\in [n-1] \mid \forall 1 \leq j \leq i: \pi(j) \leq i \}.$$ For $n > 1$ it can also be described as an occurrence of the mesh pattern $$([1,2], \{(0,2),(1,0),(1,1),(2,0),(2,1) \})$$ or equivalently $$([1,2], \{(0,1),(0,2),(1,1),(1,2),(2,0) \}),$$ see [3]. According to [2], this is also the cardinality of the connectivity set of a permutation. The permutation is connected, when the connectivity set is empty. This gives [[oeis:A003319]].
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00024: Dyck paths to 321-avoiding permutationPermutations
St000441: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [1] => 0
[2]
=> [1,0,1,0]
=> [2,1] => 0
[1,1]
=> [1,1,0,0]
=> [1,2] => 1
[3]
=> [1,0,1,0,1,0]
=> [2,1,3] => 0
[2,1]
=> [1,0,1,1,0,0]
=> [2,3,1] => 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,3,2] => 0
[4]
=> [1,0,1,0,1,0,1,0]
=> [2,1,4,3] => 0
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [2,4,1,3] => 0
[2,2]
=> [1,1,1,0,0,0]
=> [1,2,3] => 2
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [2,3,1,4] => 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,3,2,4] => 0
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,1,4,3,5] => 0
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [2,4,1,3,5] => 0
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [2,3,4,1] => 2
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [2,4,1,5,3] => 0
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,4,2,3] => 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [2,3,1,5,4] => 1
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4] => 0
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [2,1,4,3,6,5] => 0
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [2,4,1,3,6,5] => 0
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [2,4,5,1,3] => 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [2,4,1,6,3,5] => 0
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,2,4,3] => 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [2,3,1,4,5] => 2
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [2,4,1,5,3,6] => 0
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,2,3,4] => 3
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,4,2,5,3] => 0
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [2,3,1,5,4,6] => 1
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,3,2,5,4,6] => 0
Description
The number of successions of a permutation. A succession of a permutation $\pi$ is an index $i$ such that $\pi(i)+1 = \pi(i+1)$. Successions are also known as ''small ascents'' or ''1-rises''.
Mp00202: Integer partitions first row removalInteger partitions
Mp00044: Integer partitions conjugateInteger partitions
St000475: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> []
=> []
=> 0
[2]
=> []
=> []
=> 0
[1,1]
=> [1]
=> [1]
=> 1
[3]
=> []
=> []
=> 0
[2,1]
=> [1]
=> [1]
=> 1
[1,1,1]
=> [1,1]
=> [2]
=> 0
[4]
=> []
=> []
=> 0
[3,1]
=> [1]
=> [1]
=> 1
[2,2]
=> [2]
=> [1,1]
=> 2
[2,1,1]
=> [1,1]
=> [2]
=> 0
[1,1,1,1]
=> [1,1,1]
=> [3]
=> 0
[5]
=> []
=> []
=> 0
[4,1]
=> [1]
=> [1]
=> 1
[3,2]
=> [2]
=> [1,1]
=> 2
[3,1,1]
=> [1,1]
=> [2]
=> 0
[2,2,1]
=> [2,1]
=> [2,1]
=> 1
[2,1,1,1]
=> [1,1,1]
=> [3]
=> 0
[1,1,1,1,1]
=> [1,1,1,1]
=> [4]
=> 0
[6]
=> []
=> []
=> 0
[5,1]
=> [1]
=> [1]
=> 1
[4,2]
=> [2]
=> [1,1]
=> 2
[4,1,1]
=> [1,1]
=> [2]
=> 0
[3,3]
=> [3]
=> [1,1,1]
=> 3
[3,2,1]
=> [2,1]
=> [2,1]
=> 1
[3,1,1,1]
=> [1,1,1]
=> [3]
=> 0
[2,2,2]
=> [2,2]
=> [2,2]
=> 0
[2,2,1,1]
=> [2,1,1]
=> [3,1]
=> 1
[2,1,1,1,1]
=> [1,1,1,1]
=> [4]
=> 0
[1,1,1,1,1,1]
=> [1,1,1,1,1]
=> [5]
=> 0
Description
The number of parts equal to 1 in a partition.
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00120: Dyck paths Lalanne-Kreweras involutionDyck paths
St000011: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
[2]
=> [1,0,1,0]
=> [1,1,0,0]
=> 1 = 0 + 1
[1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 2 = 1 + 1
[3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 2 = 1 + 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,1,0,1,0,0]
=> 1 = 0 + 1
[4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 2 = 1 + 1
[2,2]
=> [1,1,1,0,0,0]
=> [1,0,1,0,1,0]
=> 3 = 2 + 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0]
=> 1 = 0 + 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 1 = 0 + 1
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 1 = 0 + 1
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 2 = 1 + 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 3 = 2 + 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1 = 0 + 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 1 = 0 + 1
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 1 = 0 + 1
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 1 = 0 + 1
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 2 = 1 + 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 3 = 2 + 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 1 = 0 + 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> 1 = 0 + 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2 = 1 + 1
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> 1 = 0 + 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 4 = 3 + 1
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> 2 = 1 + 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> 1 = 0 + 1
Description
The number of touch points (or returns) of a Dyck path. This is the number of points, excluding the origin, where the Dyck path has height 0.
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00129: Dyck paths to 321-avoiding permutation (Billey-Jockusch-Stanley)Permutations
St000056: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [1] => 1 = 0 + 1
[2]
=> [1,0,1,0]
=> [2,1] => 1 = 0 + 1
[1,1]
=> [1,1,0,0]
=> [1,2] => 2 = 1 + 1
[3]
=> [1,0,1,0,1,0]
=> [2,3,1] => 1 = 0 + 1
[2,1]
=> [1,0,1,1,0,0]
=> [2,1,3] => 2 = 1 + 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [3,1,2] => 1 = 0 + 1
[4]
=> [1,0,1,0,1,0,1,0]
=> [2,3,4,1] => 1 = 0 + 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [2,3,1,4] => 2 = 1 + 1
[2,2]
=> [1,1,1,0,0,0]
=> [1,2,3] => 3 = 2 + 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [2,4,1,3] => 1 = 0 + 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [3,4,1,2] => 1 = 0 + 1
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => 1 = 0 + 1
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => 2 = 1 + 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [2,1,3,4] => 3 = 2 + 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => 1 = 0 + 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,4,2,3] => 2 = 1 + 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => 1 = 0 + 1
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => 1 = 0 + 1
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,6,1] => 1 = 0 + 1
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,5,1,6] => 2 = 1 + 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => 3 = 2 + 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [2,3,4,6,1,5] => 1 = 0 + 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [4,1,2,3] => 1 = 0 + 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => 2 = 1 + 1
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [2,3,5,6,1,4] => 1 = 0 + 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,2,3,4] => 4 = 3 + 1
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,4,5,2,3] => 2 = 1 + 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [2,4,5,6,1,3] => 1 = 0 + 1
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [3,4,5,6,1,2] => 1 = 0 + 1
Description
The decomposition (or block) number of a permutation. For $\pi \in \mathcal{S}_n$, this is given by $$\#\big\{ 1 \leq k \leq n : \{\pi_1,\ldots,\pi_k\} = \{1,\ldots,k\} \big\}.$$ This is also known as the number of connected components [1] or the number of blocks [2] of the permutation, considering it as a direct sum. This is one plus [[St000234]].
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00023: Dyck paths to non-crossing permutationPermutations
St000883: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [1] => 1 = 0 + 1
[2]
=> [1,0,1,0]
=> [1,2] => 1 = 0 + 1
[1,1]
=> [1,1,0,0]
=> [2,1] => 2 = 1 + 1
[3]
=> [1,0,1,0,1,0]
=> [1,2,3] => 1 = 0 + 1
[2,1]
=> [1,0,1,1,0,0]
=> [1,3,2] => 2 = 1 + 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [2,3,1] => 1 = 0 + 1
[4]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 1 = 0 + 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 2 = 1 + 1
[2,2]
=> [1,1,1,0,0,0]
=> [3,2,1] => 3 = 2 + 1
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 1 = 0 + 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 1 = 0 + 1
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 1 = 0 + 1
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,5,4] => 2 = 1 + 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 3 = 2 + 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,2,4,5,3] => 1 = 0 + 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 2 = 1 + 1
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,3,4,5,2] => 1 = 0 + 1
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,1] => 1 = 0 + 1
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6] => 1 = 0 + 1
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,2,3,4,6,5] => 2 = 1 + 1
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => 3 = 2 + 1
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,2,3,5,6,4] => 1 = 0 + 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [4,2,3,1] => 1 = 0 + 1
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,4,3,5,2] => 2 = 1 + 1
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,2,4,5,6,3] => 1 = 0 + 1
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 4 = 3 + 1
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,2,4,5,1] => 2 = 1 + 1
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,3,4,5,6,2] => 1 = 0 + 1
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [2,3,4,5,6,1] => 1 = 0 + 1
Description
The number of longest increasing subsequences of a permutation.
The following 542 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001461The number of topologically connected components of the chord diagram of a permutation. St001481The minimal height of a peak of a Dyck path. St000022The number of fixed points of a permutation. St000091The descent variation of a composition. St000150The floored half-sum of the multiplicities of a partition. St000237The number of small exceedances. St000546The number of global descents of a permutation. St000665The number of rafts of a permutation. St000884The number of isolated descents of a permutation. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. 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. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. St001413Half the length of the longest even length palindromic prefix of a binary word. St000007The number of saliances of the permutation. St000025The number of initial rises of a Dyck path. St000026The position of the first return of a Dyck path. St000084The number of subtrees. St000287The number of connected components of a graph. St000314The number of left-to-right-maxima of a permutation. St000363The number of minimal vertex covers of a graph. St000678The number of up steps after the last double rise of a Dyck path. St000700The protection number of an ordered tree. St000759The smallest missing part in an integer partition. St000843The decomposition number of a perfect matching. St000909The number of maximal chains of maximal size in a poset. St000911The number of maximal antichains of maximal size in a poset. St000971The smallest closer of a set partition. St000991The number of right-to-left minima of a permutation. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001050The number of terminal closers of a set partition. St001051The depth of the label 1 in the decreasing labelled unordered tree associated with the set partition. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. 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. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001652The length of a longest interval of consecutive numbers. St001662The length of the longest factor of consecutive numbers in a permutation. St001733The number of weak left to right maxima of a Dyck path. St000439The position of the first down step of a Dyck path. St000504The cardinality of the first block of a set partition. 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}$. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St000288The number of ones in a binary word. St000392The length of the longest run of ones in a binary word. St000502The number of successions of a set partitions. St000731The number of double exceedences of a permutation. St000753The Grundy value for the game of Kayles on a binary word. St000877The depth of the binary word interpreted as a path. St000932The number of occurrences of the pattern UDU in a Dyck path. St000989The number of final rises of a permutation. St001061The number of indices that are both descents and recoils of a permutation. St001372The length of a longest cyclic run of ones of a binary word. St001419The length of the longest palindromic factor beginning with a one of a binary word. St000061The number of nodes on the left branch of a binary tree. St000654The first descent of a permutation. St000675The number of centered multitunnels of a Dyck path. St000717The number of ordinal summands of a poset. St000823The number of unsplittable factors of the set partition. St000925The number of topologically connected components of a set partition. St000990The first ascent of a permutation. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St000117The number of centered tunnels of a Dyck path. St000873The aix statistic of a permutation. St001008Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001728The number of invisible descents of a permutation. St001052The length of the exterior of a permutation. St000996The number of exclusive left-to-right maxima of a permutation. St001498The normalised height of a Nakayama algebra with magnitude 1. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St000028The number of stack-sorts needed to sort a permutation. St000366The number of double descents of a permutation. St001552The number of inversions between excedances and fixed points of a permutation. St000149The number of cells of the partition whose leg is zero and arm is odd. St000377The dinv defect of an integer partition. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000931The number of occurrences of the pattern UUU in a Dyck path. St001091The number of parts in an integer partition whose next smaller part has the same size. St001172The number of 1-rises at odd height of a Dyck path. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001252Half the sum of the even parts of a partition. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001524The degree of symmetry of a binary word. St001584The area statistic between a Dyck path and its bounce path. St001587Half of the largest even part of an integer partition. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001939The number of parts that are equal to their multiplicity in the integer partition. St001961The sum of the greatest common divisors of all pairs of parts. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St000008The major index of the composition. St000012The area of a Dyck path. St000024The number of double up and double down steps of a Dyck path. St000051The size of the left subtree of a binary tree. St000057The Shynar inversion number of a standard tableau. St000065The number of entries equal to -1 in an alternating sign matrix. St000118The number of occurrences of the contiguous pattern [.,[.,[.,.]]] in a binary tree. St000143The largest repeated part of a partition. St000148The number of odd parts of a partition. St000157The number of descents of a standard tableau. St000196The number of occurrences of the contiguous pattern [[.,.],[.,. St000204The number of internal nodes of a binary tree. St000221The number of strong fixed points of a permutation. St000225Difference between largest and smallest parts in a partition. St000241The number of cyclical small excedances. St000242The number of indices that are not cyclical small weak excedances. St000293The number of inversions of a binary word. St000295The length of the border of a binary word. St000297The number of leading ones in a binary word. St000317The cycle descent number of a permutation. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000355The number of occurrences of the pattern 21-3. St000358The number of occurrences of the pattern 31-2. St000365The number of double ascents of a permutation. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St000376The bounce deficit of a Dyck path. St000391The sum of the positions of the ones in a binary word. St000428The number of occurrences of the pattern 123 or of the pattern 213 in a permutation. St000437The number of occurrences of the pattern 312 or of the pattern 321 in a permutation. St000496The rcs statistic of a set partition. St000651The maximal size of a rise in a permutation. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000711The number of big exceedences of a permutation. St000732The number of double deficiencies of a permutation. St000743The number of entries in a standard Young tableau such that the next integer is a neighbour. 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. St000766The number of inversions of an integer composition. St000792The Grundy value for the game of ruler on a binary word. St000835The minimal difference in size when partitioning the integer partition into two subpartitions. St000836The number of descents of distance 2 of a permutation. St000837The number of ascents of distance 2 of a permutation. St000867The sum of the hook lengths in the first row of an integer partition. St000895The number of ones on the main diagonal of an alternating sign matrix. St000921The number of internal inversions of a binary word. 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. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St000992The alternating sum of the parts of an integer partition. 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. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001055The Grundy value for the game of removing cells of a row in an integer 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. St001130The number of two successive successions in a permutation. St001137Number of simple modules that are 3-regular in the corresponding Nakayama algebra. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. 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. St001167The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive in the corresponding Nakayama algebra. 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$. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module 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. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001234The number of indecomposable three dimensional modules with projective dimension one. St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St001263The index of the maximal parabolic seaweed algebra associated with the composition. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001274The number of indecomposable injective modules with projective dimension equal to two. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001394The genus of a permutation. St001403The number of vertical separators in a permutation. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. 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. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St001697The shifted natural comajor index of a standard Young tableau. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001721The degree of a binary word. St001727The number of invisible inversions of a permutation. St001781The interlacing number of a set partition. St001801Half the number of preimage-image pairs of different parity in a permutation. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001810The number of fixed points of a permutation smaller than its largest moved point. St001841The number of inversions of a set partition. St001842The major index of a set partition. St001843The Z-index of a set partition. St001910The height of the middle non-run of a Dyck path. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001948The number of augmented double ascents of a permutation. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000647The number of big descents of a permutation. 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$. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. 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. 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. St000542The number of left-to-right-minima of a permutation. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001530The depth of a Dyck path. St001556The number of inversions of the third entry of a permutation. St001557The number of inversions of the second entry of a permutation. St001596The number of two-by-two squares inside a skew partition. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St000066The column of the unique '1' in the first row of the alternating sign matrix. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000934The 2-degree of an integer partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St000674The number of hills 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. St000790The number of pairs of centered tunnels, one strictly containing the other, of a Dyck path. St000929The constant term of the character polynomial of an integer partition. St000940The number of characters of the symmetric group whose value on the partition is zero. 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. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St000291The number of descents of a binary word. St000292The number of ascents of a binary word. St000347The inversion sum of a binary word. St000348The non-inversion sum of a binary word. St000353The number of inner valleys of a permutation. St000369The dinv deficit of a Dyck path. St000434The number of occurrences of the pattern 213 or of the pattern 312 in a permutation. St000435The number of occurrences of the pattern 213 or of the pattern 231 in a permutation. St000462The major index minus the number of excedences of a permutation. St000478Another weight of a partition according to Alladi. St000491The number of inversions of a set partition. St000497The lcb statistic of a set partition. St000555The number of occurrences of the pattern {{1,3},{2}} in a set partition. St000558The number of occurrences of the pattern {{1,2}} in a set partition. St000565The major index of a set partition. St000572The dimension exponent of a set partition. St000581The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 2 is maximal. St000582The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 3 is maximal, (1,3) are consecutive in a block. St000585The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal, (1,3) are consecutive in a block. St000594The number of occurrences of the pattern {{1,3},{2}} such that 1,2 are minimal, (1,3) are consecutive in a block. St000600The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, (1,3) are consecutive in a block. St000602The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal. St000610The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal. St000613The number of occurrences of the pattern {{1,3},{2}} such that 2 is minimal, 3 is maximal, (1,3) are consecutive in a block. St000624The normalized sum of the minimal distances to a greater element. St000628The balance of a binary word. St000658The number of rises of length 2 of a Dyck path. St000661The number of rises of length 3 of a Dyck path. St000682The Grundy value of Welter's game on a binary word. St000691The number of changes of a binary word. St000693The modular (standard) major index of a standard tableau. St000730The maximal arc length of a set partition. St000747A variant of the major index of a set partition. St000791The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. 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. St000848The balance constant multiplied with the number of linear extensions of a poset. St000849The number of 1/3-balanced pairs in a poset. St000866The number of admissible inversions of a permutation in the sense of Shareshian-Wachs. St000872The number of very big descents of a permutation. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St000946The sum of the skew hook positions in a Dyck path. St000984The number of boxes below precisely one peak. St001078The minimal number of occurrences of (12) in a factorization of a permutation into transpositions (12) and cycles (1,. 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. St001139The number of occurrences of hills of size 2 in a Dyck path. 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)$. 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. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001371The length of the longest Yamanouchi prefix of a binary word. St001388The number of non-attacking neighbors of a permutation. St001420Half the length of a longest factor which is its own reverse-complement of a binary word. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001502The global dimension minus the dominant dimension of magnitude 1 Nakayama algebras. St001520The number of strict 3-descents. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St001731The factorization defect of a permutation. St001960The number of descents of a permutation minus one if its first entry is not one. St000454The largest eigenvalue of a graph if it is integral. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000944The 3-degree of an integer partition. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001176The size of a partition minus its first part. 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. St001525The number of symmetric hooks on the diagonal of a partition. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St001889The size of the connectivity set of a signed permutation. St001280The number of parts of an integer partition that are at least two. St001811The Castelnuovo-Mumford regularity of a permutation. St000260The radius of a connected graph. St000657The smallest part of an integer composition. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001462The number of factors of a standard tableaux under concatenation. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St001904The length of the initial strictly increasing segment of a parking function. St001937The size of the center of a parking function. St001248Sum of the even parts of a partition. St001279The sum of the 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. St001541The Gini index of an integer partition. St001593This is the number of standard Young tableaux of the given shifted shape. 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. St000005The bounce statistic of a Dyck path. St000006The dinv of a Dyck path. St000010The length of the partition. St000016The number of attacking pairs of a standard tableau. St000053The number of valleys of the Dyck path. St000120The number of left tunnels of a Dyck path. St000142The number of even parts of a partition. St000160The multiplicity of the smallest part of a partition. St000185The weighted size of a partition. St000228The size of 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. St000384The maximal part of the shifted composition of an integer partition. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000442The maximal area to the right of an up step of a Dyck path. St000455The second largest eigenvalue of a graph if it is integral. St000459The hook length of the base cell of a partition. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000480The number of lower covers of a partition in dominance order. St000481The number of upper covers of a partition in dominance order. St000513The number of invariant subsets of size 2 when acting with a permutation of given cycle type. St000519The largest length of a factor maximising the subword complexity. St000547The number of even non-empty partial sums of an integer partition. St000548The number of different non-empty partial sums of an integer partition. St000549The number of odd partial sums of an integer partition. St000644The number of graphs with given frequency partition. St000697The number of 3-rim hooks removed from an integer partition to obtain its associated 3-core. St000752The Grundy value for the game 'Couples are forever' on an integer partition. 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. St000885The number of critical steps in the Catalan decomposition of a binary word. St000995The largest even part of an integer partition. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of 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. St001022Number of simple modules with projective dimension 3 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. St001092The number of distinct even parts of a partition. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001121The multiplicity of the irreducible representation indexed by the partition in the Kronecker square corresponding to the 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. St001127The sum of the squares of the parts of a partition. St001141The number of occurrences of hills of size 3 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. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001175The size of a partition minus the hook length of the base cell. St001181Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra. St001186Number of simple modules with grade at least 3 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. 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. St001197The global dimension of $eAe$ for 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. St001214The aft of an integer partition. St001217The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. 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. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. 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. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001276The number of 2-regular indecomposable modules in the corresponding Nakayama algebra. 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. St001423The number of distinct cubes in a binary word. St001424The number of distinct squares in a binary word. St001480The number of simple summands of the module J^2/J^3. St001484The number of singletons of an integer partition. 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. St001588The number of distinct odd parts smaller than the largest even part in an integer partition. 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. St001816Eigenvalues of the top-to-random operator acting on a simple module. 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. St001955The number of natural descents for set-valued two row standard Young tableaux. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000761The number of ascents in an integer composition. St000765The number of weak records in an integer composition. St001207The Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. 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)$. St001487The number of inner corners of a skew partition. St001737The number of descents of type 2 in a permutation. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001964The interval resolution global dimension of a poset. 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$. St000219The number of occurrences of the pattern 231 in a permutation. St000259The diameter of a connected graph. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St000383The last part of an integer composition. St000741The Colin de Verdière graph invariant. 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. St000352The Elizalde-Pak rank of a permutation. St000054The first entry of the permutation. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000567The sum of the products of all pairs of parts. St000936The number of even values of the symmetric group character corresponding to the partition. 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. 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. St000456The monochromatic index of a connected graph. St000973The length of the boundary of an ordered tree. St000975The length of the boundary minus the length of the trunk of an ordered tree. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000681The Grundy value of Chomp on Ferrers diagrams. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St000137The Grundy value of an integer partition. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000744The length of the path to the largest entry in a standard Young tableau. St000939The number of characters of the symmetric group whose value on the partition is positive. St000947The major index east count of a Dyck path. 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. St001128The exponens consonantiae of a partition. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001249Sum of the odd parts of a partition. St001383The BG-rank of an integer partition. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St000046The largest eigenvalue of the random to random operator acting on the simple module corresponding to the given partition. St000460The hook length of the last cell along the main diagonal of an integer partition. St000461The rix statistic of a permutation. St000649The number of 3-excedences of a permutation. St000870The product of the hook lengths of the diagonal cells in an integer partition. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001360The number of covering relations in Young's lattice below a partition. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001380The number of monomer-dimer tilings of a Ferrers diagram. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001527The cyclic permutation representation number of an integer partition. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001609The number of coloured trees 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. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001933The largest multiplicity of a part in an integer partition. 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. St000492The rob statistic of a set partition. St000942The number of critical left to right maxima of the parking functions. St001151The number of blocks with odd minimum. St001162The minimum jump of a permutation. St000839The largest opener of a set partition. St001784The minimum of the smallest closer and the second element of the block containing 1 in a set partition. St000230Sum of the minimal elements of the blocks of a set partition. St000284The Plancherel distribution on integer partitions. St000668The least common multiple of the parts of the partition. 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. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000933The number of multipartitions of sizes given by an integer partition. St000937The number of positive values of the symmetric group character corresponding to the partition. St001087The number of occurrences of the vincular pattern |12-3 in a permutation. St001651The Frankl number of a lattice. St000356The number of occurrences of the pattern 13-2. St000834The number of right outer peaks of a permutation. St000562The number of internal points of a set partition. St000589The number of occurrences of the pattern {{1},{2,3}} such that 1 is maximal, (2,3) are consecutive in a block. St000606The number of occurrences of the pattern {{1},{2,3}} such that 1,3 are maximal, (2,3) are consecutive in a block. St000611The number of occurrences of the pattern {{1},{2,3}} such that 1 is maximal. St000709The number of occurrences of 14-2-3 or 14-3-2. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001867The number of alignments of type EN of a signed permutation. St001868The number of alignments of type NE of a signed permutation. St000023The number of inner peaks of a permutation. St000090The variation of a composition. St000243The number of cyclic valleys and cyclic peaks of a permutation. St000498The lcs statistic of a set partition. St000577The number of occurrences of the pattern {{1},{2}} such that 1 is a maximal element. St000597The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, (2,3) are consecutive in a block. St000614The number of occurrences of the pattern {{1},{2,3}} such that 1 is minimal, 3 is maximal, (2,3) are consecutive in a block. St000695The number of blocks in the first part of the atomic decomposition of a set partition. St000779The tier of a permutation. St001469The holeyness of a permutation. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001722The number of minimal chains with small intervals between a binary word and the top element. St001896The number of right descents of a signed permutations. St001935The number of ascents in a parking function. St001946The number of descents in a parking function. St000075The orbit size of a standard tableau under promotion. St000089The absolute variation of a composition. St000099The number of valleys of a permutation, including the boundary. St000166The depth minus 1 of an ordered tree. St000308The height of the tree associated to a permutation. St000522The number of 1-protected nodes of a rooted tree. St000521The number of distinct subtrees of an ordered tree. St001516The number of cyclic bonds of a permutation. St000735The last entry on the main diagonal of a standard tableau. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St000112The sum of the entries reduced by the index of their row in a semistandard tableau. St000177The number of free tiles in the pattern. St000178Number of free entries. St000706The product of the factorials of the multiplicities of an integer partition. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000993The multiplicity of the largest part of an integer partition. St001060The distinguishing index of a graph. St001095The number of non-isomorphic posets with precisely one further covering relation. St001568The smallest positive integer that does not appear twice in the partition. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St000632The jump number of the poset. St000736The last entry in the first row of a semistandard tableau. St001569The maximal modular displacement of a permutation. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St000307The number of rowmotion orbits of a poset. St000718The largest Laplacian eigenvalue of a graph if it is integral.