searching the database
Your data matches 429 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St001526
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St001526: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00199: Dyck paths —prime Dyck path⟶ Dyck paths
St001526: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> 3
[2]
=> [1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 3
[1,1]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 3
[3]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 4
[2,1]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 3
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 4
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 4
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 3
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 4
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> 3
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 3
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 3
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 3
[]
=> []
=> [1,0]
=> 1
Description
The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path.
Matching statistic: St000079
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
St000079: Dyck paths ⟶ ℤResult quality: 67% ●values known / values provided: 93%●distinct values known / distinct values provided: 67%
St000079: Dyck paths ⟶ ℤResult quality: 67% ●values known / values provided: 93%●distinct values known / distinct values provided: 67%
Values
[1]
=> [1,0,1,0]
=> 1 = 3 - 2
[2]
=> [1,1,0,0,1,0]
=> 1 = 3 - 2
[1,1]
=> [1,0,1,1,0,0]
=> 1 = 3 - 2
[3]
=> [1,1,1,0,0,0,1,0]
=> 2 = 4 - 2
[2,1]
=> [1,0,1,0,1,0]
=> 1 = 3 - 2
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> 2 = 4 - 2
[3,1]
=> [1,1,0,1,0,0,1,0]
=> 2 = 4 - 2
[2,2]
=> [1,1,0,0,1,1,0,0]
=> 1 = 3 - 2
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> 2 = 4 - 2
[3,2]
=> [1,1,0,0,1,0,1,0]
=> 1 = 3 - 2
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> 1 = 3 - 2
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> 1 = 3 - 2
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> 1 = 3 - 2
[]
=> []
=> ? = 1 - 2
Description
The number of alternating sign matrices for a given Dyck path.
The Dyck path is given by the last diagonal of the monotone triangle corresponding to an alternating sign matrix.
Matching statistic: St000886
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000886: Permutations ⟶ ℤResult quality: 67% ●values known / values provided: 93%●distinct values known / distinct values provided: 67%
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000886: Permutations ⟶ ℤResult quality: 67% ●values known / values provided: 93%●distinct values known / distinct values provided: 67%
Values
[1]
=> [1,0,1,0]
=> [1,2] => 1 = 3 - 2
[2]
=> [1,1,0,0,1,0]
=> [2,1,3] => 1 = 3 - 2
[1,1]
=> [1,0,1,1,0,0]
=> [1,3,2] => 1 = 3 - 2
[3]
=> [1,1,1,0,0,0,1,0]
=> [3,1,2,4] => 2 = 4 - 2
[2,1]
=> [1,0,1,0,1,0]
=> [1,2,3] => 1 = 3 - 2
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,4,2,3] => 2 = 4 - 2
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 2 = 4 - 2
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 1 = 3 - 2
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 2 = 4 - 2
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 1 = 3 - 2
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 1 = 3 - 2
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 1 = 3 - 2
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 1 = 3 - 2
[]
=> []
=> [] => ? = 1 - 2
Description
The number of permutations with the same antidiagonal sums.
The X-ray of a permutation $\pi$ is the vector of the sums of the antidiagonals of the permutation matrix of $\pi$, read from left to right. For example, the permutation matrix of $\pi=[3,1,2,5,4]$ is
$$\left(\begin{array}{rrrrr}
0 & 1 & 0 & 0 & 0 \\
0 & 0 & 1 & 0 & 0 \\
1 & 0 & 0 & 0 & 0 \\
0 & 0 & 0 & 0 & 1 \\
0 & 0 & 0 & 1 & 0
\end{array}\right),$$
so its X-ray is $(0, 1, 1, 1, 0, 0, 0, 2, 0)$.
This statistic records the number of permutations having the same X-ray as the given permutation. In [1] this is called the degeneracy of the X-ray of the permutation.
By [prop.1, 1], the number of different X-rays of permutations of size $n$ equals the number of nondecreasing differences of permutations of size $n$, [2].
Matching statistic: St001359
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St001359: Permutations ⟶ ℤResult quality: 67% ●values known / values provided: 93%●distinct values known / distinct values provided: 67%
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St001359: Permutations ⟶ ℤResult quality: 67% ●values known / values provided: 93%●distinct values known / distinct values provided: 67%
Values
[1]
=> [1,0,1,0]
=> [1,2] => 1 = 3 - 2
[2]
=> [1,1,0,0,1,0]
=> [2,1,3] => 1 = 3 - 2
[1,1]
=> [1,0,1,1,0,0]
=> [1,3,2] => 1 = 3 - 2
[3]
=> [1,1,1,0,0,0,1,0]
=> [3,1,2,4] => 2 = 4 - 2
[2,1]
=> [1,0,1,0,1,0]
=> [1,2,3] => 1 = 3 - 2
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,4,2,3] => 2 = 4 - 2
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 2 = 4 - 2
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 1 = 3 - 2
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 2 = 4 - 2
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 1 = 3 - 2
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 1 = 3 - 2
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 1 = 3 - 2
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 1 = 3 - 2
[]
=> []
=> [] => ? = 1 - 2
Description
The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles.
In other words, this is $2^k$ where $k$ is the number of cycles of length at least three ([[St000486]]) in its cycle decomposition.
The generating function for the number of equivalence classes, $f(n)$, is
$$\sum_{n\geq 0} f(n)\frac{x^n}{n!} = \frac{e(\frac{x}{2} + \frac{x^2}{4})}{\sqrt{1-x}}.$$
Matching statistic: St001524
(load all 9 compositions to match this statistic)
(load all 9 compositions to match this statistic)
Mp00095: Integer partitions —to binary word⟶ Binary words
Mp00234: Binary words —valleys-to-peaks⟶ Binary words
St001524: Binary words ⟶ ℤResult quality: 67% ●values known / values provided: 93%●distinct values known / distinct values provided: 67%
Mp00234: Binary words —valleys-to-peaks⟶ Binary words
St001524: Binary words ⟶ ℤResult quality: 67% ●values known / values provided: 93%●distinct values known / distinct values provided: 67%
Values
[1]
=> 10 => 11 => 1 = 3 - 2
[2]
=> 100 => 101 => 1 = 3 - 2
[1,1]
=> 110 => 111 => 1 = 3 - 2
[3]
=> 1000 => 1001 => 2 = 4 - 2
[2,1]
=> 1010 => 1101 => 1 = 3 - 2
[1,1,1]
=> 1110 => 1111 => 2 = 4 - 2
[3,1]
=> 10010 => 10101 => 2 = 4 - 2
[2,2]
=> 1100 => 1101 => 1 = 3 - 2
[2,1,1]
=> 10110 => 11011 => 2 = 4 - 2
[3,2]
=> 10100 => 11001 => 1 = 3 - 2
[3,1,1]
=> 100110 => 101011 => 1 = 3 - 2
[2,2,1]
=> 11010 => 11101 => 1 = 3 - 2
[3,2,1]
=> 101010 => 110101 => 1 = 3 - 2
[]
=> => ? => ? = 1 - 2
Description
The degree of symmetry of a binary word.
For a binary word $w$ of length $n$, this is the number of positions $i\leq n/2$ such that $w_i = w_{n+1-i}$.
Matching statistic: St001532
(load all 8 compositions to match this statistic)
(load all 8 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00242: Dyck paths —Hessenberg poset⟶ Posets
St001532: Posets ⟶ ℤResult quality: 67% ●values known / values provided: 93%●distinct values known / distinct values provided: 67%
Mp00242: Dyck paths —Hessenberg poset⟶ Posets
St001532: Posets ⟶ ℤResult quality: 67% ●values known / values provided: 93%●distinct values known / distinct values provided: 67%
Values
[1]
=> [1,0,1,0]
=> ([(0,1)],2)
=> 1 = 3 - 2
[2]
=> [1,1,0,0,1,0]
=> ([(0,1),(0,2)],3)
=> 1 = 3 - 2
[1,1]
=> [1,0,1,1,0,0]
=> ([(0,2),(1,2)],3)
=> 1 = 3 - 2
[3]
=> [1,1,1,0,0,0,1,0]
=> ([(0,1),(0,2),(0,3)],4)
=> 2 = 4 - 2
[2,1]
=> [1,0,1,0,1,0]
=> ([(0,2),(2,1)],3)
=> 1 = 3 - 2
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> ([(0,3),(1,3),(2,3)],4)
=> 2 = 4 - 2
[3,1]
=> [1,1,0,1,0,0,1,0]
=> ([(0,2),(0,3),(3,1)],4)
=> 2 = 4 - 2
[2,2]
=> [1,1,0,0,1,1,0,0]
=> ([(0,2),(0,3),(1,2),(1,3)],4)
=> 1 = 3 - 2
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> ([(0,3),(1,2),(2,3)],4)
=> 2 = 4 - 2
[3,2]
=> [1,1,0,0,1,0,1,0]
=> ([(0,3),(3,1),(3,2)],4)
=> 1 = 3 - 2
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> ([(0,1),(0,2),(1,3),(2,3)],4)
=> 1 = 3 - 2
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> ([(0,3),(1,3),(3,2)],4)
=> 1 = 3 - 2
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> ([(0,3),(2,1),(3,2)],4)
=> 1 = 3 - 2
[]
=> []
=> ?
=> ? = 1 - 2
Description
The leading coefficient of the Poincare polynomial of the poset cone.
For a poset $P$ on $\{1,\dots,n\}$, let $\mathcal K_P = \{\vec x\in\mathbb R^n| x_i < x_j \text{ for } i < _P j\}$. Furthermore let $\mathcal L(\mathcal A)$ be the intersection lattice of the braid arrangement $A_{n-1}$ and let $\mathcal L^{int} = \{ X \in \mathcal L(\mathcal A) | X \cap \mathcal K_P \neq \emptyset \}$.
Then the Poincare polynomial of the poset cone is $Poin(t) = \sum_{X\in\mathcal L^{int}} |\mu(0, X)| t^{codim X}$.
This statistic records its leading coefficient.
Matching statistic: St000428
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000428: Permutations ⟶ ℤResult quality: 67% ●values known / values provided: 93%●distinct values known / distinct values provided: 67%
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000428: Permutations ⟶ ℤResult quality: 67% ●values known / values provided: 93%●distinct values known / distinct values provided: 67%
Values
[1]
=> [1,0,1,0]
=> [2,1] => 0 = 3 - 3
[2]
=> [1,1,0,0,1,0]
=> [3,1,2] => 0 = 3 - 3
[1,1]
=> [1,0,1,1,0,0]
=> [2,3,1] => 0 = 3 - 3
[3]
=> [1,1,1,0,0,0,1,0]
=> [4,1,2,3] => 1 = 4 - 3
[2,1]
=> [1,0,1,0,1,0]
=> [3,2,1] => 0 = 3 - 3
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [2,3,4,1] => 1 = 4 - 3
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [4,2,1,3] => 1 = 4 - 3
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [3,4,1,2] => 0 = 3 - 3
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [3,2,4,1] => 1 = 4 - 3
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [4,3,1,2] => 0 = 3 - 3
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [4,2,3,1] => 0 = 3 - 3
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [3,4,2,1] => 0 = 3 - 3
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 0 = 3 - 3
[]
=> []
=> [] => ? = 1 - 3
Description
The number of occurrences of the pattern 123 or of the pattern 213 in a permutation.
Matching statistic: St000432
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000432: Permutations ⟶ ℤResult quality: 67% ●values known / values provided: 93%●distinct values known / distinct values provided: 67%
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000432: Permutations ⟶ ℤResult quality: 67% ●values known / values provided: 93%●distinct values known / distinct values provided: 67%
Values
[1]
=> [1,0,1,0]
=> [1,2] => 0 = 3 - 3
[2]
=> [1,1,0,0,1,0]
=> [2,1,3] => 0 = 3 - 3
[1,1]
=> [1,0,1,1,0,0]
=> [1,3,2] => 0 = 3 - 3
[3]
=> [1,1,1,0,0,0,1,0]
=> [3,1,2,4] => 1 = 4 - 3
[2,1]
=> [1,0,1,0,1,0]
=> [1,2,3] => 0 = 3 - 3
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,4,2,3] => 1 = 4 - 3
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 1 = 4 - 3
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 0 = 3 - 3
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 1 = 4 - 3
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 0 = 3 - 3
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 0 = 3 - 3
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 0 = 3 - 3
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0 = 3 - 3
[]
=> []
=> [] => ? = 1 - 3
Description
The number of occurrences of the pattern 231 or of the pattern 312 in a permutation.
Matching statistic: St000436
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000436: Permutations ⟶ ℤResult quality: 67% ●values known / values provided: 93%●distinct values known / distinct values provided: 67%
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000436: Permutations ⟶ ℤResult quality: 67% ●values known / values provided: 93%●distinct values known / distinct values provided: 67%
Values
[1]
=> [1,0,1,0]
=> [1,2] => 0 = 3 - 3
[2]
=> [1,1,0,0,1,0]
=> [2,1,3] => 0 = 3 - 3
[1,1]
=> [1,0,1,1,0,0]
=> [1,3,2] => 0 = 3 - 3
[3]
=> [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 1 = 4 - 3
[2,1]
=> [1,0,1,0,1,0]
=> [1,2,3] => 0 = 3 - 3
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 1 = 4 - 3
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 1 = 4 - 3
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 0 = 3 - 3
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 1 = 4 - 3
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 0 = 3 - 3
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 0 = 3 - 3
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 0 = 3 - 3
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0 = 3 - 3
[]
=> []
=> [] => ? = 1 - 3
Description
The number of occurrences of the pattern 231 or of the pattern 321 in a permutation.
Matching statistic: St000486
(load all 6 compositions to match this statistic)
(load all 6 compositions to match this statistic)
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000486: Permutations ⟶ ℤResult quality: 67% ●values known / values provided: 93%●distinct values known / distinct values provided: 67%
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000486: Permutations ⟶ ℤResult quality: 67% ●values known / values provided: 93%●distinct values known / distinct values provided: 67%
Values
[1]
=> [1,0,1,0]
=> [1,2] => 0 = 3 - 3
[2]
=> [1,1,0,0,1,0]
=> [2,1,3] => 0 = 3 - 3
[1,1]
=> [1,0,1,1,0,0]
=> [1,3,2] => 0 = 3 - 3
[3]
=> [1,1,1,0,0,0,1,0]
=> [3,1,2,4] => 1 = 4 - 3
[2,1]
=> [1,0,1,0,1,0]
=> [1,2,3] => 0 = 3 - 3
[1,1,1]
=> [1,0,1,1,1,0,0,0]
=> [1,4,2,3] => 1 = 4 - 3
[3,1]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 1 = 4 - 3
[2,2]
=> [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 0 = 3 - 3
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,3,4,2] => 1 = 4 - 3
[3,2]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 0 = 3 - 3
[3,1,1]
=> [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 0 = 3 - 3
[2,2,1]
=> [1,0,1,0,1,1,0,0]
=> [1,2,4,3] => 0 = 3 - 3
[3,2,1]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0 = 3 - 3
[]
=> []
=> [] => ? = 1 - 3
Description
The number of cycles of length at least 3 of a permutation.
The following 419 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000538The number of even inversions of a permutation. St000710The number of big deficiencies of a permutation. St000836The number of descents of distance 2 of a permutation. St000837The number of ascents of distance 2 of a permutation. St001174The Gorenstein dimension of the algebra $A/I$ when $I$ is the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St000213The number of weak exceedances (also weak excedences) of a permutation. St000626The minimal period of a binary word. St000630The length of the shortest palindromic decomposition of a binary word. St000702The number of weak deficiencies of a permutation. St001315The dissociation number of a graph. St001566The length of the longest arithmetic progression in a permutation. St000099The number of valleys of a permutation, including the boundary. St000243The number of cyclic valleys and cyclic peaks of a permutation. St000628The balance of a binary word. St000633The size of the automorphism group of a poset. St000862The number of parts of the shifted shape of a permutation. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St000889The number of alternating sign matrices with the same antidiagonal sums. St000982The length of the longest constant subword. St001111The weak 2-dynamic chromatic number of a graph. St001112The 3-weak dynamic number of a graph. 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. St001263The index of the maximal parabolic seaweed algebra associated with the composition. St001385The number of conjugacy classes of subgroups with connected subgroups of sizes prescribed by an integer partition. St001399The distinguishing number of a poset. St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001716The 1-improper chromatic number of a graph. St001735The number of permutations with the same set of runs. 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. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001941The evaluation at 1 of the modified Kazhdan--Lusztig R polynomial (as in [1, Section 5. St000119The number of occurrences of the pattern 321 in a permutation. St000317The cycle descent number of a permutation. St000360The number of occurrences of the pattern 32-1. St000423The number of occurrences of the pattern 123 or of the pattern 132 in a permutation. St000425The number of occurrences of the pattern 132 or of the pattern 213 in a permutation. St000437The number of occurrences of the pattern 312 or of the pattern 321 in a permutation. St000448The number of pairs of vertices of a graph with distance 2. St000552The number of cut vertices of a graph. St000561The number of occurrences of the pattern {{1,2,3}} in a set partition. St000624The normalized sum of the minimal distances to a greater element. St000646The number of big ascents of a permutation. St000647The number of big descents of a permutation. St000648The number of 2-excedences of a permutation. St000649The number of 3-excedences of a permutation. St000663The number of right floats of a permutation. St000711The number of big exceedences of a permutation. St000732The number of double deficiencies of a permutation. St000752The Grundy value for the game 'Couples are forever' on an integer partition. St000779The tier of a permutation. St000850The number of 1/2-balanced pairs in a poset. St000879The number of long braid edges in the graph of braid moves of a permutation. St000954Number of times the corresponding LNakayama algebra has $Ext^i(D(A),A)=0$ for $i>0$. St001022Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to the Dyck path. St001082The number of boxed occurrences of 123 in a permutation. St001095The number of non-isomorphic posets with precisely one further covering relation. St001167The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive in the corresponding Nakayama algebra. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St001308The number of induced paths on three vertices in a graph. St001323The independence gap of a graph. St001350Half of the Albertson index of a graph. St001411The number of patterns 321 or 3412 in a permutation. St001470The cyclic holeyness of a permutation. St001535The number of cyclic alignments of a permutation. St001552The number of inversions between excedances and fixed points of a permutation. St001565The number of arithmetic progressions of length 2 in a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001689The number of celebrities in a graph. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001727The number of invisible inversions of a permutation. St001728The number of invisible descents of a permutation. St001798The difference of the number of edges in a graph and the number of edges in the complement of the Turán graph. St001811The Castelnuovo-Mumford regularity of a permutation. St001964The interval resolution global dimension of a poset. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St001820The size of the image of the pop stack sorting operator. 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$. St001118The acyclic chromatic index of a graph. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. 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$. St000236The number of cyclical small weak excedances. St000241The number of cyclical small excedances. St000248The number of anti-singletons of a set partition. St000249The number of singletons (St000247) plus the number of antisingletons (St000248) of a set partition. St001568The smallest positive integer that does not appear twice in the partition. St000588The number of occurrences of the pattern {{1},{2},{3}} such that 1,3 are minimal, 2 is maximal. St000451The length of the longest pattern of the form k 1 2. St000842The breadth of a permutation. St001624The breadth of a lattice. 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. St000036The evaluation at 1 of the Kazhdan-Lusztig polynomial with parameters given by the identity and the permutation. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St000022The number of fixed points of a permutation. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St000404The number of occurrences of the pattern 3241 or of the pattern 4231 in a permutation. St000408The number of occurrences of the pattern 4231 in a permutation. St000440The number of occurrences of the pattern 4132 or of the pattern 4231 in a permutation. St000534The number of 2-rises of a permutation. St000546The number of global descents of a permutation. St000731The number of double exceedences of a permutation. St000264The girth of a graph, which is not a tree. St000260The radius of a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. 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. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001498The normalised height of a Nakayama algebra with magnitude 1. St001722The number of minimal chains with small intervals between a binary word and the top element. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000681The Grundy value of Chomp on Ferrers diagrams. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St000495The number of inversions of distance at most 2 of a permutation. St000638The number of up-down runs of a permutation. St000762The sum of the positions of the weak records of an integer composition. St000806The semiperimeter of the associated bargraph. St000831The number of indices that are either descents or recoils. St000058The order of a permutation. St000084The number of subtrees. St000092The number of outer peaks of a permutation. St000105The number of blocks in the set partition. St000251The number of nonsingleton blocks of a set partition. St000253The crossing number of a set partition. St000285The size of the preimage of the map 'to inverse des composition' from Parking functions to Integer compositions. St000325The width of the tree associated to a permutation. St000328The maximum number of child nodes in a tree. St000470The number of runs in a permutation. St000485The length of the longest cycle of a permutation. St000487The length of the shortest cycle of a permutation. St000504The cardinality of the first block of a set partition. St000542The number of left-to-right-minima of a permutation. St000574The number of occurrences of the pattern {{1},{2}} such that 1 is a minimal and 2 a maximal element. St000619The number of cyclic descents of a permutation. St000679The pruning number of an ordered tree. St000695The number of blocks in the first part of the atomic decomposition of a set partition. St000793The length of the longest partition in the vacillating tableau corresponding to a set partition. St001051The depth of the label 1 in the decreasing labelled unordered tree associated with the set partition. St001060The distinguishing index of a graph. St001062The maximal size of a block of a set partition. St001075The minimal size of a block of a set partition. 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)$. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001693The excess length of a longest path consisting of elements and blocks of a set partition. St001741The largest integer such that all patterns of this size are contained in the permutation. St000021The number of descents of a permutation. St000023The number of inner peaks of a permutation. St000046The largest eigenvalue of the random to random operator acting on the simple module corresponding to the given partition. St000056The decomposition (or block) number of a permutation. St000137The Grundy value of an integer partition. St000154The sum of the descent bottoms of a permutation. 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. St000210Minimum over maximum difference of elements in cycles. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000353The number of inner valleys of a permutation. St000460The hook length of the last cell along the main diagonal of an integer partition. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000563The number of overlapping pairs of blocks of a set partition. St000570The Edelman-Greene number of a permutation. St000585The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal, (1,3) are consecutive in a block. St000601The number of occurrences of the pattern {{1},{2,3}} such that 1,2 are minimal, (2,3) are consecutive in a block. St000618The number of self-evacuating tableaux of given shape. St000654The first descent of a permutation. St000667The greatest common divisor of the parts of the partition. St000694The number of affine bounded permutations that project to a given permutation. St000729The minimal arc length of a set partition. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000781The number of proper colouring schemes of a Ferrers diagram. St000817The sum of the entries in the column specified by the composition of the change of basis matrix from dual immaculate quasisymmetric functions to monomial quasisymmetric functions. St000818The sum of the entries in the column specified by the composition of the change of basis matrix from quasisymmetric Schur functions to monomial quasisymmetric functions. St000832The number of permutations obtained by reversing blocks of three consecutive numbers. St000864The number of circled entries of the shifted recording tableau of a permutation. St000870The product of the hook lengths of the diagonal cells in an integer partition. St000872The number of very big descents of a permutation. St000908The length of the shortest maximal antichain in a poset. St000914The sum of the values of the Möbius function of a poset. St000925The number of topologically connected components of a set partition. St000990The first ascent of a permutation. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001162The minimum jump of a permutation. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. 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. St001262The dimension of the maximal parabolic seaweed algebra corresponding to the 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. St001344The neighbouring number of a permutation. St001360The number of covering relations in Young's lattice below a partition. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001378The product of the cohook lengths of the integer partition. St001380The number of monomer-dimer tilings of a Ferrers diagram. St001383The BG-rank of an integer partition. St001389The number of partitions of the same length below the given integer partition. St001432The order dimension of the partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001461The number of topologically connected components of the chord diagram of a permutation. St001525The number of symmetric hooks on the diagonal of a partition. St001527The cyclic permutation representation number of an integer partition. St001529The number of monomials in the expansion of the nabla operator applied to the power-sum symmetric function indexed by the partition. St001561The value of the elementary symmetric function evaluated at 1. 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. St001571The Cartan determinant of the integer partition. St001593This is the number of standard Young tableaux of the given shifted shape. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001600The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple graphs. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001602The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on endofunctions. 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. 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. St001610The number of coloured endofunctions such that the multiplicities of colours are given by a partition. St001611The number of multiset partitions such that the multiplicities of elements are given by a partition. St001627The number of coloured connected graphs such that the multiplicities of colours are given by a partition. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001652The length of a longest interval of consecutive numbers. St001662The length of the longest factor of consecutive numbers in a permutation. St001665The number of pure excedances of a permutation. St001729The number of visible descents of a permutation. St001737The number of descents of type 2 in a permutation. St001763The Hurwitz number of an integer partition. 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. St001805The maximal overlap of a cylindrical tableau associated with a semistandard tableau. St001806The upper middle entry of a permutation. St001839The number of excedances of a set partition. St001859The number of factors of the Stanley symmetric function associated with a permutation. 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. St001901The largest multiplicity of an irreducible representation 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. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001924The number of cells in an integer partition whose arm and leg length coincide. St001928The number of non-overlapping descents in a permutation. 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. St001938The number of transitive monotone factorizations of genus zero of a permutation of given cycle type. 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. St001943The sum of the squares of the hook lengths of an integer partition. St000039The number of crossings of a permutation. St000145The Dyson rank of a partition. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000217The number of occurrences of the pattern 312 in a permutation. St000219The number of occurrences of the pattern 231 in a permutation. St000221The number of strong fixed points of a permutation. St000225Difference between largest and smallest parts in a partition. St000234The number of global ascents of a permutation. St000247The number of singleton blocks of a set partition. St000279The size of the preimage of the map 'cycle-as-one-line notation' from Permutations to Permutations. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000338The number of pixed points of a permutation. 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. St000367The number of simsun double descents of a permutation. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$. St000406The number of occurrences of the pattern 3241 in a permutation. St000407The number of occurrences of the pattern 2143 in a permutation. St000455The second largest eigenvalue of a graph if it is integral. St000462The major index minus the number of excedences of a permutation. St000488The number of cycles of a permutation of length at most 2. St000496The rcs statistic of a set partition. St000500Eigenvalues of the random-to-random operator acting on the regular representation. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000516The number of stretching pairs of a permutation. St000557The number of occurrences of the pattern {{1},{2},{3}} in a set partition. St000559The number of occurrences of the pattern {{1,3},{2,4}} in a set partition. St000573The number of occurrences of the pattern {{1},{2}} such that 1 is a singleton and 2 a maximal element. St000575The number of occurrences of the pattern {{1},{2}} such that 1 is a maximal element and 2 a singleton. St000576The number of occurrences of the pattern {{1},{2}} such that 1 is a maximal and 2 a minimal element. St000578The number of occurrences of the pattern {{1},{2}} such that 1 is a singleton. St000580The number of occurrences of the pattern {{1},{2},{3}} such that 2 is minimal, 3 is maximal. St000583The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 1, 2 are maximal. St000584The number of occurrences of the pattern {{1},{2},{3}} such that 1 is minimal, 3 is maximal. St000587The number of occurrences of the pattern {{1},{2},{3}} such that 1 is minimal. St000590The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, 1 is maximal, (2,3) are consecutive in a block. St000591The number of occurrences of the pattern {{1},{2},{3}} such that 2 is maximal. St000592The number of occurrences of the pattern {{1},{2},{3}} such that 1 is maximal. St000593The number of occurrences of the pattern {{1},{2},{3}} such that 1,2 are minimal. St000596The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 1 is maximal. St000603The number of occurrences of the pattern {{1},{2},{3}} such that 2,3 are minimal. St000604The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 2 is maximal. St000608The number of occurrences of the pattern {{1},{2},{3}} such that 1,2 are minimal, 3 is maximal. St000615The number of occurrences of the pattern {{1},{2},{3}} such that 1,3 are maximal. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000622The number of occurrences of the patterns 2143 or 4231 in a permutation. St000623The number of occurrences of the pattern 52341 in a permutation. St000664The number of right ropes of a permutation. St000666The number of right tethers of a permutation. 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. St000693The modular (standard) major index of a standard tableau. St000749The smallest integer d such that the restriction of the representation corresponding to a partition of n to the symmetric group on n-d letters has a constituent of odd degree. St000750The number of occurrences of the pattern 4213 in a permutation. St000751The number of occurrences of either of the pattern 2143 or 2143 in a permutation. St000790The number of pairs of centered tunnels, one strictly containing the other, of a Dyck path. 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. St000944The 3-degree of an integer partition. St000961The shifted major index of a permutation. St000962The 3-shifted major index of a permutation. St000963The 2-shifted major index of a permutation. St000989The number of final rises of a permutation. St001059Number of occurrences of the patterns 41352,42351,51342,52341 in a permutation. St001130The number of two successive successions in a permutation. St001139The number of occurrences of hills of size 2 in a Dyck path. St001175The size of a partition minus the hook length of the base cell. 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. St001248Sum of the even parts of a partition. St001279The sum of the parts of an integer partition that are at least two. St001280The number of parts of an integer partition that are at least two. St001301The first Betti number of the order complex associated with the poset. St001332The number of steps on the non-negative side of the walk associated with the permutation. St001381The fertility of a permutation. 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. St001396Number of triples of incomparable elements in a finite poset. St001402The number of separators in a permutation. St001403The number of vertical separators in a permutation. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St001513The number of nested exceedences of a permutation. St001537The number of cyclic crossings of a permutation. St001541The Gini index of an integer partition. St001549The number of restricted non-inversions between exceedances. St001550The number of inversions between exceedances where the greater exceedance is linked. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. St001586The number of odd parts smaller than the largest even part in an integer partition. St001587Half of the largest even part of an integer partition. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001657The number of twos in an integer partition. St001663The number of occurrences of the Hertzsprung pattern 132 in a permutation. St001705The number of occurrences of the pattern 2413 in a permutation. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001715The number of non-records in a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001781The interlacing number of a set partition. St001810The number of fixed points of a permutation smaller than its largest moved point. St001847The number of occurrences of the pattern 1432 in a permutation. St001850The number of Hecke atoms of a permutation. St001857The number of edges in the reduced word graph of a signed permutation. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001961The sum of the greatest common divisors of all pairs of parts. St000474Dyson's crank of a partition. St001472The permanent of the Coxeter matrix of the poset. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St000524The number of posets with the same order polynomial. St000526The number of posets with combinatorially isomorphic order polytopes. St000717The number of ordinal summands of a poset. St000298The order dimension or Dushnik-Miller dimension of a poset. St000307The number of rowmotion orbits of a poset. St000640The rank of the largest boolean interval in a poset. St000845The maximal number of elements covered by an element in a poset. St000846The maximal number of elements covering an element of a poset. St000907The number of maximal antichains of minimal length in a poset. St000632The jump number of the poset. St000782The indicator function of whether a given perfect matching is an L & P matching. St001635The trace of the square of the Coxeter matrix of the incidence algebra of a poset. St000281The size of the preimage of the map 'to poset' from Binary trees to Posets. St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. St001631The number of simple modules $S$ with $dim Ext^1(S,A)=1$ in the incidence algebra $A$ of the poset. St000284The Plancherel distribution on integer partitions. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000668The least common multiple of the parts of the partition. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000706The product of the factorials of the multiplicities of an integer partition. 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. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. 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. St000929The constant term of the character polynomial of an integer partition. St000933The number of multipartitions of sizes given by an integer partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St000993The multiplicity of the largest part of an integer partition. St001128The exponens consonantiae of a partition. 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)$. St001569The maximal modular displacement of a permutation. St000102The charge of a semistandard tableau. St000478Another weight of a partition according to Alladi. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000567The sum of the products of all pairs of parts. St000934The 2-degree 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. St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001556The number of inversions of the third entry of a permutation. St001948The number of augmented double ascents of a permutation. St001960The number of descents of a permutation minus one if its first entry is not one. St000716The dimension of the irreducible representation of Sp(6) labelled by an integer partition.
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!