Your data matches 695 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000480
(load all 16 compositions to match this statistic)
Mapping
St000480: 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]
 => 1
[2,1]
 => 1
[1,1,1]
 => 0
[4]
 => 1
[3,1]
 => 1
[2,2]
 => 1
[2,1,1]
 => 1
[1,1,1,1]
 => 0
[5]
 => 1
[4,1]
 => 1
[3,2]
 => 1
[3,1,1]
 => 1
[2,2,1]
 => 1
[2,1,1,1]
 => 1
[1,1,1,1,1]
 => 0
Description
The number of lower covers of a partition in dominance order. According to [1], Corollary 2.4, the maximum number of elements one element (apparently for $n\neq 2$) can cover is $$ \frac{1}{2}(\sqrt{1+8n}-3) $$ and an element which covers this number of elements is given by $(c+i,c,c-1,\dots,3,2,1)$, where $1\leq i\leq c+2$.
Matching statistic: St000481
(load all 9 compositions to match this statistic)
Mapping
St000481: 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
[3]
 => 0
[2,1]
 => 1
[1,1,1]
 => 1
[4]
 => 0
[3,1]
 => 1
[2,2]
 => 1
[2,1,1]
 => 1
[1,1,1,1]
 => 1
[5]
 => 0
[4,1]
 => 1
[3,2]
 => 1
[3,1,1]
 => 1
[2,2,1]
 => 1
[2,1,1,1]
 => 1
[1,1,1,1,1]
 => 1
Description
The number of upper covers of a partition in dominance order.
Matching statistic: St000183
(load all 17 compositions to match this statistic)
Mapping
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St000183: 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
[3]
 => []
 => 0
[2,1]
 => [1]
 => 1
[1,1,1]
 => [1,1]
 => 1
[4]
 => []
 => 0
[3,1]
 => [1]
 => 1
[2,2]
 => [2]
 => 1
[2,1,1]
 => [1,1]
 => 1
[1,1,1,1]
 => [1,1,1]
 => 1
[5]
 => []
 => 0
[4,1]
 => [1]
 => 1
[3,2]
 => [2]
 => 1
[3,1,1]
 => [1,1]
 => 1
[2,2,1]
 => [2,1]
 => 1
[2,1,1,1]
 => [1,1,1]
 => 1
[1,1,1,1,1]
 => [1,1,1,1]
 => 1
Description
The side length of the Durfee square of an integer partition. Given a partition $\lambda = (\lambda_1,\ldots,\lambda_n)$, the Durfee square is the largest partition $(s^s)$ whose diagram fits inside the diagram of $\lambda$. In symbols, $s = \max\{ i \mid \lambda_i \geq i \}$. This is also known as the Frobenius rank.
Matching statistic: St000897
(load all 22 compositions to match this statistic)
Mapping
Mp00202: Integer partitions —first row removal⟶ Integer partitions
St000897: 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
[3]
 => []
 => 0
[2,1]
 => [1]
 => 1
[1,1,1]
 => [1,1]
 => 1
[4]
 => []
 => 0
[3,1]
 => [1]
 => 1
[2,2]
 => [2]
 => 1
[2,1,1]
 => [1,1]
 => 1
[1,1,1,1]
 => [1,1,1]
 => 1
[5]
 => []
 => 0
[4,1]
 => [1]
 => 1
[3,2]
 => [2]
 => 1
[3,1,1]
 => [1,1]
 => 1
[2,2,1]
 => [2,1]
 => 1
[2,1,1,1]
 => [1,1,1]
 => 1
[1,1,1,1,1]
 => [1,1,1,1]
 => 1
Description
The number of different multiplicities of parts of an integer partition.
Matching statistic: St000023
(load all 35 compositions to match this statistic)
Mapping
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
St000023: 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
[2]
 => [1,1,0,0,1,0]
 => [1,3,2] => 1
[1,1]
 => [1,0,1,1,0,0]
 => [2,1,3] => 0
[3]
 => [1,1,1,0,0,0,1,0]
 => [1,2,4,3] => 1
[2,1]
 => [1,0,1,0,1,0]
 => [2,3,1] => 1
[1,1,1]
 => [1,0,1,1,1,0,0,0]
 => [2,1,3,4] => 0
[4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [1,2,3,5,4] => 1
[3,1]
 => [1,1,0,1,0,0,1,0]
 => [3,1,4,2] => 1
[2,2]
 => [1,1,0,0,1,1,0,0]
 => [1,3,2,4] => 1
[2,1,1]
 => [1,0,1,1,0,1,0,0]
 => [2,4,1,3] => 1
[1,1,1,1]
 => [1,0,1,1,1,1,0,0,0,0]
 => [2,1,3,4,5] => 0
[5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,2,3,4,6,5] => 1
[4,1]
 => [1,1,1,0,1,0,0,0,1,0]
 => [4,1,2,5,3] => 1
[3,2]
 => [1,1,0,0,1,0,1,0]
 => [1,3,4,2] => 1
[3,1,1]
 => [1,0,1,1,0,0,1,0]
 => [2,1,4,3] => 1
[2,2,1]
 => [1,0,1,0,1,1,0,0]
 => [2,3,1,4] => 1
[2,1,1,1]
 => [1,0,1,1,1,0,1,0,0,0]
 => [2,5,1,3,4] => 1
[1,1,1,1,1]
 => [1,0,1,1,1,1,1,0,0,0,0,0]
 => [2,1,3,4,5,6] => 0
Description
The number of inner peaks of a permutation. The number of peaks including the boundary is [[St000092]].
Matching statistic: St000120
(load all 6 compositions to match this statistic)
Mapping
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St000120: Dyck paths ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
 => [1,0]
 => [1,0]
 => 0
[2]
 => [1,0,1,0]
 => [1,1,0,0]
 => 0
[1,1]
 => [1,1,0,0]
 => [1,0,1,0]
 => 1
[3]
 => [1,0,1,0,1,0]
 => [1,1,1,0,0,0]
 => 0
[2,1]
 => [1,0,1,1,0,0]
 => [1,1,0,1,0,0]
 => 1
[1,1,1]
 => [1,1,0,1,0,0]
 => [1,0,1,1,0,0]
 => 1
[4]
 => [1,0,1,0,1,0,1,0]
 => [1,1,1,1,0,0,0,0]
 => 0
[3,1]
 => [1,0,1,0,1,1,0,0]
 => [1,1,1,0,1,0,0,0]
 => 1
[2,2]
 => [1,1,1,0,0,0]
 => [1,0,1,0,1,0]
 => 1
[2,1,1]
 => [1,0,1,1,0,1,0,0]
 => [1,1,0,1,1,0,0,0]
 => 1
[1,1,1,1]
 => [1,1,0,1,0,1,0,0]
 => [1,0,1,1,1,0,0,0]
 => 1
[5]
 => [1,0,1,0,1,0,1,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => 0
[4,1]
 => [1,0,1,0,1,0,1,1,0,0]
 => [1,1,1,1,0,1,0,0,0,0]
 => 1
[3,2]
 => [1,0,1,1,1,0,0,0]
 => [1,1,0,1,0,1,0,0]
 => 1
[3,1,1]
 => [1,0,1,0,1,1,0,1,0,0]
 => [1,1,1,0,1,1,0,0,0,0]
 => 1
[2,2,1]
 => [1,1,1,0,0,1,0,0]
 => [1,0,1,1,0,0,1,0]
 => 1
[2,1,1,1]
 => [1,0,1,1,0,1,0,1,0,0]
 => [1,1,0,1,1,1,0,0,0,0]
 => 1
[1,1,1,1,1]
 => [1,1,0,1,0,1,0,1,0,0]
 => [1,0,1,1,1,1,0,0,0,0]
 => 1
Description
The number of left tunnels of a Dyck path. A tunnel is a pair (a,b) where a is the position of an open parenthesis and b is the position of the matching close parenthesis. If a+b
Matching statistic: St000162
(load all 48 compositions to match this statistic)
Mapping
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000162: 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] => 1
[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] => 1
[2,1,1]
 => [1,0,1,1,0,1,0,0]
 => [1,3,4,2] => 1
[1,1,1,1]
 => [1,1,0,1,0,1,0,0]
 => [2,3,4,1] => 1
[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] => 1
[3,1,1]
 => [1,0,1,0,1,1,0,1,0,0]
 => [1,2,4,5,3] => 1
[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] => 1
[1,1,1,1,1]
 => [1,1,0,1,0,1,0,1,0,0]
 => [2,3,4,5,1] => 1
Description
The number of nontrivial cycles in the cycle decomposition of a permutation. This statistic is equal to the difference of the number of cycles of $\pi$ (see [[St000031]]) and the number of fixed points of $\pi$ (see [[St000022]]).
Matching statistic: St000292
(load all 10 compositions to match this statistic)
Mapping
Mp00095: Integer partitions —to binary word⟶ Binary words
Mp00316: Binary words —inverse Foata bijection⟶ Binary words
St000292: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
 => 10 => 10 => 0
[2]
 => 100 => 010 => 1
[1,1]
 => 110 => 110 => 0
[3]
 => 1000 => 0010 => 1
[2,1]
 => 1010 => 0110 => 1
[1,1,1]
 => 1110 => 1110 => 0
[4]
 => 10000 => 00010 => 1
[3,1]
 => 10010 => 00110 => 1
[2,2]
 => 1100 => 1010 => 1
[2,1,1]
 => 10110 => 01110 => 1
[1,1,1,1]
 => 11110 => 11110 => 0
[5]
 => 100000 => 000010 => 1
[4,1]
 => 100010 => 000110 => 1
[3,2]
 => 10100 => 10010 => 1
[3,1,1]
 => 100110 => 001110 => 1
[2,2,1]
 => 11010 => 10110 => 1
[2,1,1,1]
 => 101110 => 011110 => 1
[1,1,1,1,1]
 => 111110 => 111110 => 0
Description
The number of ascents of a binary word.
Matching statistic: St000353
(load all 38 compositions to match this statistic)
Mapping
Mp00043: Integer partitions —to Dyck path⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000353: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
 => [1,0,1,0]
 => [1,2] => 0
[2]
 => [1,1,0,0,1,0]
 => [2,1,3] => 1
[1,1]
 => [1,0,1,1,0,0]
 => [1,3,2] => 0
[3]
 => [1,1,1,0,0,0,1,0]
 => [3,1,2,4] => 1
[2,1]
 => [1,0,1,0,1,0]
 => [1,2,3] => 0
[1,1,1]
 => [1,0,1,1,1,0,0,0]
 => [1,4,2,3] => 1
[4]
 => [1,1,1,1,0,0,0,0,1,0]
 => [4,1,2,3,5] => 1
[3,1]
 => [1,1,0,1,0,0,1,0]
 => [2,3,1,4] => 1
[2,2]
 => [1,1,0,0,1,1,0,0]
 => [2,1,4,3] => 1
[2,1,1]
 => [1,0,1,1,0,1,0,0]
 => [1,3,4,2] => 0
[1,1,1,1]
 => [1,0,1,1,1,1,0,0,0,0]
 => [1,5,2,3,4] => 1
[5]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [5,1,2,3,4,6] => 1
[4,1]
 => [1,1,1,0,1,0,0,0,1,0]
 => [3,4,1,2,5] => 1
[3,2]
 => [1,1,0,0,1,0,1,0]
 => [2,1,3,4] => 1
[3,1,1]
 => [1,0,1,1,0,0,1,0]
 => [1,3,2,4] => 1
[2,2,1]
 => [1,0,1,0,1,1,0,0]
 => [1,2,4,3] => 0
[2,1,1,1]
 => [1,0,1,1,1,0,1,0,0,0]
 => [1,4,5,2,3] => 1
[1,1,1,1,1]
 => [1,0,1,1,1,1,1,0,0,0,0,0]
 => [1,6,2,3,4,5] => 1
Description
The number of inner valleys of a permutation. The number of valleys including the boundary is [[St000099]].
Matching statistic: St000374
(load all 19 compositions to match this statistic)
Mapping
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000374: 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] => 1
[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] => 1
[2,1,1]
 => [1,0,1,1,0,1,0,0]
 => [1,3,4,2] => 1
[1,1,1,1]
 => [1,1,0,1,0,1,0,0]
 => [2,3,4,1] => 1
[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] => 1
[3,1,1]
 => [1,0,1,0,1,1,0,1,0,0]
 => [1,2,4,5,3] => 1
[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] => 1
[1,1,1,1,1]
 => [1,1,0,1,0,1,0,1,0,0]
 => [2,3,4,5,1] => 1
Description
The number of exclusive right-to-left minima of a permutation. This is the number of right-to-left minima that are not left-to-right maxima. This is also the number of non weak exceedences of a permutation that are also not mid-points of a decreasing subsequence of length 3. Given a permutation $\pi = [\pi_1,\ldots,\pi_n]$, this statistic counts the number of position $j$ such that $\pi_j < j$ and there do not exist indices $i,k$ with $i < j < k$ and $\pi_i > \pi_j > \pi_k$. See also [[St000213]] and [[St000119]].
The following 685 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000624The normalized sum of the minimal distances to a greater element. St000651The maximal size of a rise in a permutation. St000703The number of deficiencies of a permutation. St000742The number of big ascents of a permutation after prepending zero. St000834The number of right outer peaks of a permutation. St000920The logarithmic height of a Dyck path. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. 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. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001269The sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. 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. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St000007The number of saliances of the permutation. St000013The height of a Dyck path. St000058The order of a permutation. St000092The number of outer peaks of a permutation. St000099The number of valleys of a permutation, including the boundary. St000298The order dimension or Dushnik-Miller dimension of a poset. St000451The length of the longest pattern of the form k 1 2. St000862The number of parts of the shifted shape of a permutation. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001471The magnitude of a Dyck path. St001784The minimum of the smallest closer and the second element of the block containing 1 in a set partition. St001884The number of borders of a binary word. St000021The number of descents of a permutation. St000024The number of double up and double down steps of a Dyck path. St000028The number of stack-sorts needed to sort a permutation. St000035The number of left outer peaks of a permutation. St000141The maximum drop size of a permutation. St000154The sum of the descent bottoms of a permutation. St000155The number of exceedances (also excedences) of a permutation. St000157The number of descents of a standard tableau. St000159The number of distinct parts of the integer partition. St000160The multiplicity of the smallest part of a partition. St000196The number of occurrences of the contiguous pattern [[.,.],[.,. St000238The number of indices that are not small weak excedances. St000256The number of parts from which one can substract 2 and still get an integer partition. St000257The number of distinct parts of a partition that occur at least twice. St000272The treewidth of a graph. St000290The major index of a binary word. St000291The number of descents of a binary word. St000295The length of the border of a binary word. St000306The bounce count of a Dyck path. St000316The number of non-left-to-right-maxima of a permutation. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000340The number of non-final maximal constant sub-paths of length greater than one. St000352The Elizalde-Pak rank of a permutation. St000354The number of recoils of a permutation. St000386The number of factors DDU in a Dyck path. St000390The number of runs of ones in a binary word. St000461The rix statistic of a permutation. St000486The number of cycles of length at least 3 of a permutation. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000535The rank-width of a graph. St000536The pathwidth of a graph. St000546The number of global descents of a permutation. St000632The jump number of the poset. St000646The number of big ascents of a permutation. St000647The number of big descents of a permutation. St000659The number of rises of length at least 2 of a Dyck path. St000660The number of rises of length at least 3 of a Dyck path. St000662The staircase size of the code of a permutation. St000665The number of rafts of a permutation. St000670The reversal length of a permutation. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000691The number of changes of a binary word. St000710The number of big deficiencies of a permutation. St000711The number of big exceedences of a permutation. St000732The number of double deficiencies of a permutation. St000745The index of the last row whose first entry is the row number in a standard Young tableau. St000761The number of ascents in an integer composition. St000779The tier of a permutation. St000783The side length of the largest staircase partition fitting into a partition. St000840The number of closers smaller than the largest opener in a perfect matching. St000845The maximal number of elements covered by an element in a poset. St000846The maximal number of elements covering an element of a poset. St000864The number of circled entries of the shifted recording tableau of a permutation. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St000884The number of isolated descents of a permutation. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama algebra. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St000996The number of exclusive left-to-right maxima of a permutation. 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. St001022Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to the Dyck path. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001037The number of inner corners of the upper path of the parallelogram polyomino associated with the Dyck path. St001046The maximal number of arcs nesting a given arc of a perfect matching. St001078The minimal number of occurrences of (12) in a factorization of a permutation into transpositions (12) and cycles (1,. St001086The number of occurrences of the consecutive pattern 132 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. St001090The number of pop-stack-sorts needed to sort a permutation. St001092The number of distinct even parts of a partition. St001096The size of the overlap set of a permutation. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001153The number of blocks with even minimum in a set partition. 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)$. St001181Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001186Number of simple modules with grade at least 3 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 St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. 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$. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. 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. St001277The degeneracy of a graph. St001280The number of parts of an integer partition that are at least two. 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. St001298The number of repeated entries in the Lehmer code of a permutation. St001333The cardinality of a minimal edge-isolating set of a graph. St001335The cardinality of a minimal cycle-isolating set of a graph. St001354The number of series nodes in the modular decomposition of a graph. St001358The largest degree of a regular subgraph of a graph. St001375The pancake length of a permutation. St001393The induced matching number of a graph. St001394The genus of a permutation. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001469The holeyness of a permutation. St001485The modular major index of a binary word. St001489The maximum of the number of descents and the number of inverse descents. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001587Half of the largest even part of an integer partition. St001673The degree of asymmetry of an integer composition. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001726The number of visible inversions of a permutation. St001728The number of invisible descents of a permutation. St001743The discrepancy of a graph. St001760The number of prefix or suffix reversals needed to sort a permutation. St001792The arboricity of a graph. St001801Half the number of preimage-image pairs of different parity in a permutation. St001839The number of excedances of a set partition. St001840The number of descents of a set partition. St001859The number of factors of the Stanley symmetric function associated with a permutation. 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). St001874Lusztig's a-function for the symmetric group. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001928The number of non-overlapping descents in a permutation. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St000010The length of the partition. St000011The number of touch points (or returns) of a Dyck path. St000062The length of the longest increasing subsequence of the permutation. St000069The number of maximal elements of a poset. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000147The largest part of an integer partition. St000164The number of short pairs. St000166The depth minus 1 of an ordered tree. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000200The row of the unique '1' in the last column of the alternating sign matrix. St000201The number of leaf nodes in a binary tree. St000308The height of the tree associated to a permutation. St000314The number of left-to-right-maxima of a permutation. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000325The width of the tree associated to a permutation. St000335The difference of lower and upper interactions. St000346The number of coarsenings of a partition. St000381The largest part of an integer composition. St000392The length of the longest run of ones in a binary word. St000396The register function (or Horton-Strahler number) of a binary tree. St000397The Strahler number of a rooted tree. St000442The maximal area to the right of an up step of a Dyck path. St000443The number of long tunnels of a Dyck path. St000470The number of runs in a permutation. St000522The number of 1-protected nodes of a rooted tree. St000527The width of the poset. St000542The number of left-to-right-minima of a permutation. St000568The hook number of a binary tree. St000619The number of cyclic descents of a permutation. St000628The balance of a binary word. St000630The length of the shortest palindromic decomposition of a binary word. St000638The number of up-down runs of a permutation. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St000701The protection number of a binary tree. St000702The number of weak deficiencies of a permutation. St000720The size of the largest partition in the oscillating tableau corresponding to the perfect matching. St000740The last entry of a permutation. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000758The length of the longest staircase fitting into an integer composition. St000760The length of the longest strictly decreasing subsequence of parts of an integer composition. St000764The number of strong records in an integer composition. St000767The number of runs in an integer composition. St000793The length of the longest partition in the vacillating tableau corresponding to a set partition. St000808The number of up steps of the associated bargraph. St000822The Hadwiger number of the graph. St000847The number of standard Young tableaux whose descent set is the binary word. St000903The number of different parts of an integer composition. St000905The number of different multiplicities of parts of an integer composition. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St000982The length of the longest constant subword. St000983The length of the longest alternating subword. St000991The number of right-to-left minima of a permutation. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001029The size of the core of a graph. St001111The weak 2-dynamic chromatic number of a graph. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001203We associate to a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n-1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a Dyck path as follows: St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001257The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001261The Castelnuovo-Mumford regularity of a graph. St001330The hat guessing number of a graph. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St001372The length of a longest cyclic run of ones of a binary word. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001464The number of bases of the positroid corresponding to the permutation, with all fixed points counterclockwise. St001481The minimal height of a peak of a Dyck path. St001494The Alon-Tarsi number of a graph. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001530The depth of a Dyck path. St001580The acyclic chromatic number of a graph. St001589The nesting number of a perfect matching. St001642The Prague dimension of a graph. St001716The 1-improper chromatic number of a graph. St001732The number of peaks visible from the left. St001735The number of permutations with the same set of runs. St001741The largest integer such that all patterns of this size are contained in the permutation. St000094The depth of an ordered tree. St000521The number of distinct subtrees of an ordered tree. St000891The number of distinct diagonal sums of a permutation matrix. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001108The 2-dynamic chromatic number of a graph. St001166Number of indecomposable projective non-injective modules with dominant dimension equal to the global dimension plus the number of indecomposable projective injective modules in the corresponding Nakayama algebra. St000967The value p(1) for the Coxeterpolynomial p of the corresponding LNakayama algebra. St000253The crossing number of a set partition. St000254The nesting number of a set partition. St000730The maximal arc length of a set partition. St000871The number of very big ascents of a permutation. St000919The number of maximal left branches of a binary tree. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St000444The length of the maximal rise of a Dyck path. St000485The length of the longest cycle of a permutation. St000216The absolute length of a permutation. St000251The number of nonsingleton blocks of a set partition. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000640The rank of the largest boolean interval in a poset. St000658The number of rises of length 2 of a Dyck path. St000809The reduced reflection length of the permutation. St000829The Ulam distance of a permutation to the identity permutation. St000946The sum of the skew hook positions in a Dyck path. St001080The minimal length of a factorization of a permutation using the transposition (12) and the cycle (1,. St001114The number of odd descents of a permutation. 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. St001569The maximal modular displacement of a permutation. St001592The maximal number of simple paths between any two different vertices of a graph. St001896The number of right descents of a signed permutations. St001948The number of augmented double ascents of a permutation. St000504The cardinality of the first block of a set partition. St000654The first descent of a permutation. St000668The least common multiple of the parts of the partition. St000678The number of up steps after the last double rise of a Dyck path. St000823The number of unsplittable factors of the set partition. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001062The maximal size of a block of a set partition. St001555The order of a signed permutation. St001044The number of pairs whose larger element is at most one more than half the size of the perfect matching. St000872The number of very big descents of a permutation. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001217The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001960The number of descents of a permutation minus one if its first entry is not one. St000243The number of cyclic valleys and cyclic peaks of a permutation. St001043The depth of the leaf closest to the root in the binary unordered tree associated with the perfect matching. 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$. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St000618The number of self-evacuating tableaux of given shape. St000781The number of proper colouring schemes of a Ferrers diagram. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St000003The number of standard Young tableaux of the partition. St000049The number of set partitions whose sorted block sizes correspond to the partition. St000088The row sums of the character table of the symmetric group. St000182The number of permutations whose cycle type is the given integer partition. St000212The number of standard Young tableaux for an integer partition such that no two consecutive entries appear in the same row. St000275Number of permutations whose sorted list of non zero multiplicities of the Lehmer code is the given partition. St000278The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. St000321The number of integer partitions of n that are dominated by an integer partition. St000326The position of the first one in a binary word after appending a 1 at the end. St000345The number of refinements of a partition. St000517The Kreweras number of an integer partition. St000547The number of even non-empty partial sums of an integer partition. St000655The length of the minimal rise of a Dyck path. St000705The number of semistandard tableaux on a given integer partition of n with maximal entry n. St000913The number of ways to refine the partition into singletons. St000935The number of ordered refinements of an integer partition. St000964Gives the dimension of Ext^g(D(A),A) of the corresponding LNakayama algebra, when g denotes the global dimension of that algebra. St000965The sum of the dimension of Ext^i(D(A),A) for i=1,. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001013Number of indecomposable injective modules with codominant dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001063Numbers of 3-torsionfree simple modules in the corresponding Nakayama algebra. St001064Number of simple modules in the corresponding Nakayama algebra that are 3-syzygy modules. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001129The product of the squares of the parts of a partition. St001159Number of simple modules with dominant dimension equal to the global dimension in the corresponding Nakayama algebra. St001191Number of simple modules $S$ with $Ext_A^i(S,A)=0$ for all $i=0,1,...,g-1$ in the corresponding Nakayama algebra $A$ with global dimension $g$. St001196The global dimension of $A$ minus the global dimension of $eAe$ for the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001256Number of simple reflexive modules that are 2-stable reflexive. St001274The number of indecomposable injective modules with projective dimension equal to two. 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. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001385The number of conjugacy classes of subgroups with connected subgroups of sizes prescribed by an 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. St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001593This is the number of standard Young tableaux of the given shifted shape. St001597The Frobenius rank of a skew partition. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001711The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. St001722The number of minimal chains with small intervals between a binary word and the top element. St001780The order of promotion on the set of standard tableaux of given shape. St001786The number of total orderings of the north steps of a Dyck path such that steps after the k-th east step are not among the first k positions in the order. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001924The number of cells in an integer partition whose arm and leg length coincide. St000016The number of attacking pairs of a standard tableau. St000036The evaluation at 1 of the Kazhdan-Lusztig polynomial with parameters given by the identity and the permutation. St000047The number of standard immaculate tableaux of a given shape. St000048The multinomial of the parts of a partition. St000053The number of valleys of the Dyck path. St000056The decomposition (or block) number of a permutation. St000068The number of minimal elements in a poset. St000075The orbit size of a standard tableau under promotion. St000079The number of alternating sign matrices for a given Dyck path. St000115The single entry in the last row. St000124The cardinality of the preimage of the Simion-Schmidt map. St000179The product of the hook lengths of the integer partition. St000181The number of connected components of the Hasse diagram for the poset. St000184The size of the centralizer of any permutation of given cycle type. St000255The number of reduced Kogan faces with the permutation as type. St000277The number of ribbon shaped standard tableaux. St000331The number of upper interactions of a Dyck path. St000409The number of pitchforks in a binary tree. St000487The length of the shortest cycle of a permutation. St000531The leading coefficient of the rook polynomial of an integer partition. St000539The number of odd inversions of a permutation. St000570The Edelman-Greene number of a permutation. St000627The exponent of a binary word. St000644The number of graphs with given frequency partition. St000657The smallest part of an integer composition. St000667The greatest common divisor of the parts of the partition. St000675The number of centered multitunnels of a Dyck path. St000679The pruning number of an ordered tree. 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. St000685The dominant dimension of the LNakayama algebra associated to a Dyck path. St000694The number of affine bounded permutations that project to a given permutation. St000695The number of blocks in the first part of the atomic decomposition of a set partition. St000700The protection number of an ordered tree. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000763The sum of the positions of the strong records of an integer composition. St000765The number of weak records in an integer composition. St000788The number of nesting-similar perfect matchings of a perfect matching. St000805The number of peaks of the associated bargraph. St000810The sum of the entries in the column specified by the partition of the change of basis matrix from powersum symmetric functions to monomial symmetric functions. St000811The sum of the entries in the column specified by the partition of the change of basis matrix from powersum symmetric functions to Schur symmetric functions. St000812The sum of the entries in the column specified by the partition of the change of basis matrix from complete homogeneous symmetric functions to monomial symmetric functions. St000814The sum of the entries in the column specified by the partition of the change of basis matrix from elementary symmetric functions to Schur symmetric functions. St000816The number of standard composition tableaux of the composition. St000820The number of compositions obtained by rotating the composition. St000836The number of descents of distance 2 of a permutation. St000837The number of ascents of distance 2 of a permutation. St000876The number of factors in the Catalan decomposition of a binary word. St000877The depth of the binary word interpreted as a path. St000880The number of connected components of long braid edges in the graph of braid moves of a permutation. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St000886The number of permutations with the same antidiagonal sums. St000889The number of alternating sign matrices with the same antidiagonal sums. St000899The maximal number of repetitions of an integer composition. St000900The minimal number of repetitions of a part in an integer composition. St000902 The minimal number of repetitions of an integer composition. St000904The maximal number of repetitions of an integer composition. St000908The length of the shortest maximal antichain in a poset. St000968We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n−1}]$ by adding $c_0$ to $c_{n−1}$. St000993The multiplicity of the largest part of an integer partition. 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. St001026The maximum of the projective dimensions of the indecomposable non-projective injective modules minus the minimum in the Nakayama algebra corresponding to the Dyck path. St001027Number of simple modules with projective dimension equal to injective dimension in the Nakayama algebra corresponding to the Dyck path. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001052The length of the exterior of a permutation. St001061The number of indices that are both descents and recoils of a permutation. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001075The minimal size of a block of a set partition. St001081The number of minimal length factorizations of a permutation into star transpositions. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. 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. St001121The multiplicity of the irreducible representation indexed by the partition in the Kronecker square corresponding to the partition. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001132The number of leaves in the subtree whose sister has label 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001139The number of occurrences of hills of size 2 in a Dyck path. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001162The minimum jump of a permutation. St001164Number of indecomposable injective modules whose socle has projective dimension at most g-1 (g the global dimension) minus the number of indecomposable projective-injective modules. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. 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)$. St001220The width of a permutation. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. St001260The permanent of an alternating sign matrix. St001267The length of the Lyndon factorization of the binary word. St001273The projective dimension of the first term in an injective coresolution of the regular module. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001312Number of parabolic noncrossing partitions indexed by the composition. St001313The number of Dyck paths above the lattice path given by a binary word. St001344The neighbouring number of a permutation. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001387Number of standard Young tableaux of the skew shape tracing the border of the given partition. St001388The number of non-attacking neighbors of a permutation. St001403The number of vertical separators in a permutation. St001405The number of bonds in a permutation. St001413Half the length of the longest even length palindromic prefix of a binary word. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001420Half the length of a longest factor which is its own reverse-complement of a binary word. St001424The number of distinct squares in a binary word. St001437The flex of a binary word. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001498The normalised height of a Nakayama algebra with magnitude 1. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001501The dominant dimension of magnitude 1 Nakayama algebras. St001502The global dimension minus the dominant dimension of magnitude 1 Nakayama algebras. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001510The number of self-evacuating linear extensions of a finite poset. St001511The minimal number of transpositions needed to sort a permutation in either direction. St001517The length of a longest pair of twins in a permutation. St001532The leading coefficient of the Poincare polynomial of the poset cone. St001533The largest coefficient of the Poincare polynomial of the poset cone. St001534The alternating sum of the coefficients of the Poincare polynomial of the poset cone. St001590The crossing number of a perfect matching. St001591The number of graphs with the given composition of multiplicities of Laplacian eigenvalues. St001595The number of standard Young tableaux of the skew partition. St001612The number of coloured multisets of cycles such that the multiplicities of colours are given by a partition. St001659The number of ways to place as many non-attacking rooks as possible on a Ferrers board. St001667The maximal size of a pair of weak twins for a permutation. St001675The number of parts equal to the part in the reversed composition. St001710The number of permutations such that conjugation with a permutation of given cycle type yields the inverse permutation. St001730The number of times the path corresponding to a binary word crosses the base line. St001800The number of 3-Catalan paths having this Dyck path as first and last coordinate projections. St001830The chord expansion number of a perfect matching. St001832The number of non-crossing perfect matchings in the chord expansion of a perfect matching. St001850The number of Hecke atoms of a permutation. St001905The number of preferred parking spots in a parking function less than the index of the car. St001929The number of meanders with top half given by the noncrossing matching corresponding to the Dyck path. St001933The largest multiplicity of a part in an integer partition. St001941The evaluation at 1 of the modified Kazhdan--Lusztig R polynomial (as in [1, Section 5. St001520The number of strict 3-descents. St000260The radius of a connected graph. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St001423The number of distinct cubes in a binary word. St001571The Cartan determinant of the integer partition. St000259The diameter of a connected graph. St000741The Colin de Verdière graph invariant. St000706The product of the factorials of the multiplicities of an integer partition. St001568The smallest positive integer that does not appear twice in the partition. St000454The largest eigenvalue of a graph if it is integral. St000284The Plancherel distribution on integer partitions. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000735The last entry on the main diagonal of a standard tableau. St000901The cube of the number of standard Young tableaux with shape given by the partition. St001128The exponens consonantiae of a partition. St000083The number of left oriented leafs of a binary tree except the first one. St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. St000285The size of the preimage of the map 'to inverse des composition' from Parking functions to Integer compositions. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000558The number of occurrences of the pattern {{1,2}} in a set partition. St000762The sum of the positions of the weak records of an integer composition. St000832The number of permutations obtained by reversing blocks of three consecutive numbers. St000833The comajor index of a permutation. St000874The position of the last double rise in a Dyck path. St000914The sum of the values of the Möbius function of a poset. St000932The number of occurrences of the pattern UDU in a Dyck path. St000941The number of characters of the symmetric group whose value on the partition is even. St000947The major index east count of a Dyck path. St000976The sum of the positions of double up-steps of a Dyck path. St000988The orbit size of a permutation under Foata's bijection. St000989The number of final rises of a permutation. 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. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001627The number of coloured connected graphs such that the multiplicities of colours are given by a partition. St001763The Hurwitz number of an integer partition. St001890The maximum magnitude of the Möbius function of a poset. 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. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St000973The length of the boundary of an ordered tree. St000975The length of the boundary minus the length of the trunk of an ordered tree. St000046The largest eigenvalue of the random to random operator acting on the simple module corresponding to the given partition. St000137The Grundy value of an integer partition. 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. St001283The number of finite solvable groups that are realised by the given partition over the complex numbers. St001284The number of finite groups that are realised by the given partition over the complex numbers. St001383The BG-rank of an integer partition. St001389The number of partitions of the same length below the given integer partition. St000005The bounce statistic of a Dyck path. St000006The dinv of a Dyck path. St000026The position of the first return of a Dyck path. St000148The number of odd parts of a partition. St000378The diagonal inversion number of an integer partition. St000389The number of runs of ones of odd length in a binary word. St000475The number of parts equal to 1 in a partition. St000529The number of permutations whose descent word is the given binary word. St000543The size of the conjugacy class of a binary word. St000594The number of occurrences of the pattern {{1,3},{2}} such that 1,2 are minimal, (1,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. St000626The minimal period of a binary word. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000734The last entry in the first row of a standard tableau. St000835The minimal difference in size when partitioning the integer partition into two subpartitions. St000873The aix statistic of a permutation. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000992The alternating sum of the parts of an integer partition. St001055The Grundy value for the game of removing cells of a row in an integer partition. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001161The major index north count of a Dyck path. St001202Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. 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. 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. St001365The number of lattice paths of the same length weakly above the path given by a binary word. St001462The number of factors of a standard tableaux under concatenation. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001525The number of symmetric hooks on the diagonal of a partition. St001562The value of the complete homogeneous symmetric function evaluated at 1. St001563The value of the power-sum symmetric function evaluated at 1. St001564The value of the forgotten symmetric functions when all variables set to 1. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. 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. St001721The degree of a binary word. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001816Eigenvalues of the top-to-random operator acting on a simple module. St001838The number of nonempty primitive factors of a binary word. 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. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. 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. St000456The monochromatic index of a connected graph. St000782The indicator function of whether a given perfect matching is an L & P matching. St001527The cyclic permutation representation number of an integer partition. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000455The second largest eigenvalue of a graph if it is integral. St000460The hook length of the last cell along the main diagonal of an integer partition. St000870The product of the hook lengths of the diagonal cells in an integer partition. St001087The number of occurrences of the vincular pattern |12-3 in a permutation. St001262The dimension of the maximal parabolic seaweed algebra corresponding to the partition. St001360The number of covering relations in Young's lattice below a partition. St001378The product of the cohook lengths of the integer partition. St001380The number of monomer-dimer tilings of a Ferrers diagram. 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. St001600The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple graphs. St001602The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on endofunctions. St001607The number of coloured graphs such that the multiplicities of colours are given by a partition. St001608The number of coloured rooted trees such that the multiplicities of colours are given by a partition. St001610The number of coloured endofunctions such that the multiplicities of colours are given by a partition. St001611The number of multiset partitions such that the multiplicities of elements are given by a partition. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001943The sum of the squares of the hook lengths of an integer partition. St000356The number of occurrences of the pattern 13-2. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000054The first entry of the permutation. St000045The number of linear extensions of a binary tree. St000091The descent variation of a composition. St000365The number of double ascents of a permutation. St000478Another weight of a partition according to Alladi. 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. 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. St000801The number of occurrences of the vincular pattern |312 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000934The 2-degree of an integer partition. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. 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. St000090The variation of a composition. St000491The number of inversions of a set partition. St000492The rob statistic of a set partition. St000497The lcb statistic of a set partition. St000498The lcs statistic of a set partition. St000565The major index of a set partition. St000577The number of occurrences of the pattern {{1},{2}} such that 1 is a maximal element. St000581The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 2 is maximal. 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. St001151The number of blocks with odd minimum. 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)$. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St001904The length of the initial strictly increasing segment of a parking function. St001935The number of ascents in a parking function. St001946The number of descents in a parking function. St000089The absolute variation of a composition. St000383The last part of an integer composition. St000839The largest opener of a set partition. St001557The number of inversions of the second entry of a permutation. St000230Sum of the minimal elements of the blocks of a set partition. St001516The number of cyclic bonds of a permutation. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000714The number of semistandard Young tableau of given shape, with entries at most 2. 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. St000929The constant term of the character polynomial of an integer partition. St000933The number of multipartitions of sizes given by an integer 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. St000419The number of Dyck paths that are weakly above the Dyck path, except for the path itself. St000508Eigenvalues of the random-to-random operator acting on a simple module. St000509The diagonal index (content) of a partition. St000693The modular (standard) major index of a standard tableau. St000790The number of pairs of centered tunnels, one strictly containing the other, of a Dyck path. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. 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. St000928The sum of the coefficients of the character polynomial of an integer partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St000940The number of characters of the symmetric group whose value on the partition is zero. St001032The number of horizontal steps in the bicoloured Motzkin path associated with the Dyck path. St001095The number of non-isomorphic posets with precisely one further covering relation. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001176The size of a partition minus its first part. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001811The Castelnuovo-Mumford regularity of a permutation. St001961The sum of the greatest common divisors of all pairs of parts. St000736The last entry in the first row of a semistandard tableau. St000307The number of rowmotion orbits of a poset. St000717The number of ordinal summands of a poset.