Your data matches 712 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000142
St000142: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> 0 = 1 - 1
[2]
=> 1 = 2 - 1
[1,1]
=> 0 = 1 - 1
[3]
=> 0 = 1 - 1
[2,1]
=> 1 = 2 - 1
[1,1,1]
=> 0 = 1 - 1
[4]
=> 1 = 2 - 1
[3,1]
=> 0 = 1 - 1
[2,2]
=> 2 = 3 - 1
[2,1,1]
=> 1 = 2 - 1
[1,1,1,1]
=> 0 = 1 - 1
[5]
=> 0 = 1 - 1
[4,1]
=> 1 = 2 - 1
[3,2]
=> 1 = 2 - 1
[3,1,1]
=> 0 = 1 - 1
[2,2,1]
=> 2 = 3 - 1
[2,1,1,1]
=> 1 = 2 - 1
[1,1,1,1,1]
=> 0 = 1 - 1
Description
The number of even parts of a partition.
St000143: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> 0 = 1 - 1
[2]
=> 0 = 1 - 1
[1,1]
=> 1 = 2 - 1
[3]
=> 0 = 1 - 1
[2,1]
=> 0 = 1 - 1
[1,1,1]
=> 1 = 2 - 1
[4]
=> 0 = 1 - 1
[3,1]
=> 0 = 1 - 1
[2,2]
=> 2 = 3 - 1
[2,1,1]
=> 1 = 2 - 1
[1,1,1,1]
=> 1 = 2 - 1
[5]
=> 0 = 1 - 1
[4,1]
=> 0 = 1 - 1
[3,2]
=> 0 = 1 - 1
[3,1,1]
=> 1 = 2 - 1
[2,2,1]
=> 2 = 3 - 1
[2,1,1,1]
=> 1 = 2 - 1
[1,1,1,1,1]
=> 1 = 2 - 1
Description
The largest repeated part of a partition. If the parts of the partition are all distinct, the value of the statistic is defined to be zero.
St000149: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> 0 = 1 - 1
[2]
=> 1 = 2 - 1
[1,1]
=> 0 = 1 - 1
[3]
=> 1 = 2 - 1
[2,1]
=> 0 = 1 - 1
[1,1,1]
=> 0 = 1 - 1
[4]
=> 2 = 3 - 1
[3,1]
=> 1 = 2 - 1
[2,2]
=> 1 = 2 - 1
[2,1,1]
=> 0 = 1 - 1
[1,1,1,1]
=> 0 = 1 - 1
[5]
=> 2 = 3 - 1
[4,1]
=> 1 = 2 - 1
[3,2]
=> 1 = 2 - 1
[3,1,1]
=> 1 = 2 - 1
[2,2,1]
=> 0 = 1 - 1
[2,1,1,1]
=> 0 = 1 - 1
[1,1,1,1,1]
=> 0 = 1 - 1
Description
The number of cells of the partition whose leg is zero and arm is odd. This statistic is equidistributed with [[St000143]], see [1].
Matching statistic: St000150
St000150: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> 0 = 1 - 1
[2]
=> 0 = 1 - 1
[1,1]
=> 1 = 2 - 1
[3]
=> 0 = 1 - 1
[2,1]
=> 0 = 1 - 1
[1,1,1]
=> 1 = 2 - 1
[4]
=> 0 = 1 - 1
[3,1]
=> 0 = 1 - 1
[2,2]
=> 1 = 2 - 1
[2,1,1]
=> 1 = 2 - 1
[1,1,1,1]
=> 2 = 3 - 1
[5]
=> 0 = 1 - 1
[4,1]
=> 0 = 1 - 1
[3,2]
=> 0 = 1 - 1
[3,1,1]
=> 1 = 2 - 1
[2,2,1]
=> 1 = 2 - 1
[2,1,1,1]
=> 1 = 2 - 1
[1,1,1,1,1]
=> 2 = 3 - 1
Description
The floored half-sum of the multiplicities of a partition. This statistic is equidistributed with [[St000143]] and [[St000149]], see [1].
St001587: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> 0 = 1 - 1
[2]
=> 1 = 2 - 1
[1,1]
=> 0 = 1 - 1
[3]
=> 0 = 1 - 1
[2,1]
=> 1 = 2 - 1
[1,1,1]
=> 0 = 1 - 1
[4]
=> 2 = 3 - 1
[3,1]
=> 0 = 1 - 1
[2,2]
=> 1 = 2 - 1
[2,1,1]
=> 1 = 2 - 1
[1,1,1,1]
=> 0 = 1 - 1
[5]
=> 0 = 1 - 1
[4,1]
=> 2 = 3 - 1
[3,2]
=> 1 = 2 - 1
[3,1,1]
=> 0 = 1 - 1
[2,2,1]
=> 1 = 2 - 1
[2,1,1,1]
=> 1 = 2 - 1
[1,1,1,1,1]
=> 0 = 1 - 1
Description
Half of the largest even part of an integer partition. The largest even part is recorded by [[St000995]].
Mp00202: Integer partitions first row removalInteger partitions
St000835: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> []
=> 0 = 1 - 1
[2]
=> []
=> 0 = 1 - 1
[1,1]
=> [1]
=> 1 = 2 - 1
[3]
=> []
=> 0 = 1 - 1
[2,1]
=> [1]
=> 1 = 2 - 1
[1,1,1]
=> [1,1]
=> 0 = 1 - 1
[4]
=> []
=> 0 = 1 - 1
[3,1]
=> [1]
=> 1 = 2 - 1
[2,2]
=> [2]
=> 2 = 3 - 1
[2,1,1]
=> [1,1]
=> 0 = 1 - 1
[1,1,1,1]
=> [1,1,1]
=> 1 = 2 - 1
[5]
=> []
=> 0 = 1 - 1
[4,1]
=> [1]
=> 1 = 2 - 1
[3,2]
=> [2]
=> 2 = 3 - 1
[3,1,1]
=> [1,1]
=> 0 = 1 - 1
[2,2,1]
=> [2,1]
=> 1 = 2 - 1
[2,1,1,1]
=> [1,1,1]
=> 1 = 2 - 1
[1,1,1,1,1]
=> [1,1,1,1]
=> 0 = 1 - 1
Description
The minimal difference in size when partitioning the integer partition into two subpartitions. This is the optimal value of the optimisation version of the partition problem [1].
Mp00202: Integer partitions first row removalInteger partitions
St000992: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> []
=> 0 = 1 - 1
[2]
=> []
=> 0 = 1 - 1
[1,1]
=> [1]
=> 1 = 2 - 1
[3]
=> []
=> 0 = 1 - 1
[2,1]
=> [1]
=> 1 = 2 - 1
[1,1,1]
=> [1,1]
=> 0 = 1 - 1
[4]
=> []
=> 0 = 1 - 1
[3,1]
=> [1]
=> 1 = 2 - 1
[2,2]
=> [2]
=> 2 = 3 - 1
[2,1,1]
=> [1,1]
=> 0 = 1 - 1
[1,1,1,1]
=> [1,1,1]
=> 1 = 2 - 1
[5]
=> []
=> 0 = 1 - 1
[4,1]
=> [1]
=> 1 = 2 - 1
[3,2]
=> [2]
=> 2 = 3 - 1
[3,1,1]
=> [1,1]
=> 0 = 1 - 1
[2,2,1]
=> [2,1]
=> 1 = 2 - 1
[2,1,1,1]
=> [1,1,1]
=> 1 = 2 - 1
[1,1,1,1,1]
=> [1,1,1,1]
=> 0 = 1 - 1
Description
The alternating sum of the parts of an integer partition. For a partition $\lambda = (\lambda_1,\ldots,\lambda_k)$, this is $\lambda_1 - \lambda_2 + \cdots \pm \lambda_k$.
Mp00202: Integer partitions first row removalInteger partitions
St001055: Integer partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> []
=> 0 = 1 - 1
[2]
=> []
=> 0 = 1 - 1
[1,1]
=> [1]
=> 1 = 2 - 1
[3]
=> []
=> 0 = 1 - 1
[2,1]
=> [1]
=> 1 = 2 - 1
[1,1,1]
=> [1,1]
=> 0 = 1 - 1
[4]
=> []
=> 0 = 1 - 1
[3,1]
=> [1]
=> 1 = 2 - 1
[2,2]
=> [2]
=> 2 = 3 - 1
[2,1,1]
=> [1,1]
=> 0 = 1 - 1
[1,1,1,1]
=> [1,1,1]
=> 1 = 2 - 1
[5]
=> []
=> 0 = 1 - 1
[4,1]
=> [1]
=> 1 = 2 - 1
[3,2]
=> [2]
=> 2 = 3 - 1
[3,1,1]
=> [1,1]
=> 0 = 1 - 1
[2,2,1]
=> [2,1]
=> 1 = 2 - 1
[2,1,1,1]
=> [1,1,1]
=> 1 = 2 - 1
[1,1,1,1,1]
=> [1,1,1,1]
=> 0 = 1 - 1
Description
The Grundy value for the game of removing cells of a row in an integer partition. Two players alternately remove any positive number of cells in a row of the Ferrers diagram of an integer partition, such that the result is still a Ferrers diagram. The player facing the empty partition looses.
Mp00230: Integer partitions parallelogram polyominoDyck paths
Mp00129: Dyck paths to 321-avoiding permutation (Billey-Jockusch-Stanley)Permutations
St000031: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [1] => 1
[2]
=> [1,0,1,0]
=> [2,1] => 1
[1,1]
=> [1,1,0,0]
=> [1,2] => 2
[3]
=> [1,0,1,0,1,0]
=> [2,3,1] => 1
[2,1]
=> [1,0,1,1,0,0]
=> [2,1,3] => 2
[1,1,1]
=> [1,1,0,1,0,0]
=> [3,1,2] => 1
[4]
=> [1,0,1,0,1,0,1,0]
=> [2,3,4,1] => 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [2,3,1,4] => 2
[2,2]
=> [1,1,1,0,0,0]
=> [1,2,3] => 3
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [2,4,1,3] => 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [3,4,1,2] => 2
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => 1
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => 2
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [2,1,3,4] => 3
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [2,3,5,1,4] => 1
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,4,2,3] => 2
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [2,4,5,1,3] => 2
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [3,4,5,1,2] => 1
Description
The number of cycles in the cycle decomposition of a permutation.
Mp00317: Integer partitions odd partsBinary words
Mp00224: Binary words runsortBinary words
St000326: Binary words ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1]
=> 1 => 1 => 1
[2]
=> 0 => 0 => 2
[1,1]
=> 11 => 11 => 1
[3]
=> 1 => 1 => 1
[2,1]
=> 01 => 01 => 2
[1,1,1]
=> 111 => 111 => 1
[4]
=> 0 => 0 => 2
[3,1]
=> 11 => 11 => 1
[2,2]
=> 00 => 00 => 3
[2,1,1]
=> 011 => 011 => 2
[1,1,1,1]
=> 1111 => 1111 => 1
[5]
=> 1 => 1 => 1
[4,1]
=> 01 => 01 => 2
[3,2]
=> 10 => 01 => 2
[3,1,1]
=> 111 => 111 => 1
[2,2,1]
=> 001 => 001 => 3
[2,1,1,1]
=> 0111 => 0111 => 2
[1,1,1,1,1]
=> 11111 => 11111 => 1
Description
The position of the first one in a binary word after appending a 1 at the end. Regarding the binary word as a subset of $\{1,\dots,n,n+1\}$ that contains $n+1$, this is the minimal element of the set.
The following 702 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000381The largest part of an integer composition. St000617The number of global maxima of a Dyck path. St000678The number of up steps after the last double rise of a Dyck path. St000759The smallest missing part in an integer partition. St000808The number of up steps of the associated bargraph. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St001733The number of weak left to right maxima of a Dyck path. St000148The number of odd parts of a partition. St000288The number of ones in a binary word. St000355The number of occurrences of the pattern 21-3. St000392The length of the longest run of ones in a binary word. St000445The number of rises of length 1 of a Dyck path. St000462The major index minus the number of excedences of a permutation. St000475The number of parts equal to 1 in a partition. St000597The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, (2,3) are consecutive in a block. St000605The number of occurrences of the pattern {{1},{2,3}} such that 3 is maximal, (2,3) are consecutive in a block. St000665The number of rafts of a permutation. St000753The Grundy value for the game of Kayles on a binary word. St000877The depth of the binary word interpreted as a path. St000932The number of occurrences of the pattern UDU in a Dyck path. 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. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001153The number of blocks with even minimum in a set partition. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001372The length of a longest cyclic run of ones of a binary word. St001394The genus of a permutation. St001413Half the length of the longest even length palindromic prefix of a binary word. St001419The length of the longest palindromic factor beginning with a one of a binary word. St001424The number of distinct squares in a binary word. St001524The degree of symmetry of a binary word. St001584The area statistic between a Dyck path and its bounce path. St001657The number of twos in an integer partition. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St001745The number of occurrences of the arrow pattern 13 with an arrow from 1 to 2 in a permutation. St001816Eigenvalues of the top-to-random operator acting on a simple module. St001504The sum of all indegrees of vertices with indegree at least two in the resolution quiver of a Nakayama algebra corresponding to the Dyck path. St000010The length of the partition. St000011The number of touch points (or returns) of a Dyck path. St000024The number of double up and double down steps of a Dyck path. St000025The number of initial rises of a Dyck path. St000028The number of stack-sorts needed to sort a permutation. St000093The cardinality of a maximal independent set of vertices of a graph. St000105The number of blocks in the set partition. St000120The number of left tunnels of a Dyck path. St000147The largest part of an integer partition. St000153The number of adjacent cycles of a permutation. St000314The number of left-to-right-maxima of a permutation. St000331The number of upper interactions of a Dyck path. St000335The difference of lower and upper interactions. St000340The number of non-final maximal constant sub-paths of length greater than one. St000345The number of refinements of a partition. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000442The maximal area to the right of an up step of a Dyck path. St000651The maximal size of a rise in a permutation. St000652The maximal difference between successive positions of a permutation. St000654The first descent of a permutation. St000668The least common multiple of the parts of the partition. St000708The product of the parts of an integer partition. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000765The number of weak records in an integer composition. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000820The number of compositions obtained by rotating the composition. St000831The number of indices that are either descents or recoils. St000883The number of longest increasing subsequences of a permutation. St000911The number of maximal antichains of maximal size in a poset. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000933The number of multipartitions of sizes given by an integer partition. St000935The number of ordered refinements of an integer partition. St000988The orbit size of a permutation under Foata's bijection. St000990The first ascent of a permutation. St000996The number of exclusive left-to-right maxima of a permutation. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001014Number of indecomposable injective modules with codominant dimension equal to the dominant dimension of the Nakayama algebra corresponding to the Dyck path. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001050The number of terminal closers of a set partition. St001051The depth of the label 1 in the decreasing labelled unordered tree associated with the set partition. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001096The size of the overlap set of a permutation. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001202Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001235The global 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. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001375The pancake length of a permutation. St001389The number of partitions of the same length below the given integer partition. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001461The number of topologically connected components of the chord diagram of a permutation. St001480The number of simple summands of the module J^2/J^3. St001481The minimal height of a peak of a Dyck path. St001498The normalised height of a Nakayama algebra with magnitude 1. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001652The length of a longest interval of consecutive numbers. St001662The length of the longest factor of consecutive numbers in a permutation. 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. St000008The major index of the composition. St000013The height of a Dyck path. St000022The number of fixed points of a permutation. St000039The number of crossings of a permutation. St000052The number of valleys of a Dyck path not on the x-axis. St000065The number of entries equal to -1 in an alternating sign matrix. St000117The number of centered tunnels of a Dyck path. St000123The difference in Coxeter length of a permutation and its image under the Simion-Schmidt map. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000203The number of external nodes of a binary tree. St000223The number of nestings in the permutation. St000237The number of small exceedances. St000241The number of cyclical small excedances. St000247The number of singleton blocks of a set partition. St000290The major index of a binary word. St000291The number of descents of a binary word. St000297The number of leading ones in a binary word. St000317The cycle descent number of a permutation. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000338The number of pixed points of a permutation. St000356The number of occurrences of the pattern 13-2. St000358The number of occurrences of the pattern 31-2. St000359The number of occurrences of the pattern 23-1. St000371The number of mid points of decreasing subsequences of length 3 in a permutation. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St000389The number of runs of ones of odd length in a binary word. St000439The position of the first down step of a Dyck path. St000441The number of successions of a permutation. St000443The number of long tunnels of a Dyck path. St000485The length of the longest cycle of a permutation. St000491The number of inversions of a set partition. St000496The rcs statistic of a set partition. St000497The lcb statistic of a set partition. St000513The number of invariant subsets of size 2 when acting with a permutation of given cycle type. St000538The number of even inversions of a permutation. St000565The major index of a set partition. St000572The dimension exponent of a set partition. St000581The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 2 is maximal. St000601The number of occurrences of the pattern {{1},{2,3}} such that 1,2 are minimal, (2,3) are consecutive in a block. St000602The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal. St000606The number of occurrences of the pattern {{1},{2,3}} such that 1,3 are maximal, (2,3) are consecutive in a block. St000609The number of occurrences of the pattern {{1},{2,3}} such that 1,2 are minimal. St000648The number of 2-excedences of a permutation. St000658The number of rises of length 2 of a Dyck path. St000663The number of right floats of a permutation. St000674The number of hills of a Dyck path. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000691The number of changes of a binary word. St000703The number of deficiencies of a permutation. St000710The number of big deficiencies of a permutation. St000711The number of big exceedences of a permutation. St000740The last entry of a permutation. St000766The number of inversions of an integer composition. St000803The number of occurrences of the vincular pattern |132 in a permutation. St000866The number of admissible inversions of a permutation in the sense of Shareshian-Wachs. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St000884The number of isolated descents of a permutation. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St000931The number of occurrences of the pattern UUU in a Dyck path. St000954Number of times the corresponding LNakayama algebra has $Ext^i(D(A),A)=0$ for $i>0$. St000969We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n-1}]$ by adding $c_0$ to $c_{n-1}$. St000982The length of the longest constant subword. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. 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. St001033The normalized area of the parallelogram polyomino associated with the Dyck path. St001083The number of boxed occurrences of 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. St001104The number of descents of the invariant in a tensor power of the adjoint representation of the rank two general linear group. St001114The number of odd descents of a permutation. St001115The number of even descents of a permutation. St001126Number of simple module that are 1-regular in the corresponding Nakayama algebra. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001172The number of 1-rises at odd height of a Dyck path. St001181Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one 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. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001252Half the sum of the even parts of a partition. St001263The index of the maximal parabolic seaweed algebra associated with the composition. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001269The sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation. St001274The number of indecomposable injective modules with projective dimension equal to two. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. 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. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St001484The number of singletons of an integer partition. St001485The modular major index of a binary word. St001486The number of corners of the ribbon associated with an integer composition. St001530The depth of a Dyck path. St001566The length of the longest arithmetic progression in a permutation. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001665The number of pure excedances of a permutation. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St001695The natural comajor index of a standard Young tableau. St001727The number of invisible inversions of a permutation. St001729The number of visible descents of a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001777The number of weak descents in an integer composition. St001801Half the number of preimage-image pairs of different parity in a permutation. St001810The number of fixed points of a permutation smaller than its largest moved point. St001841The number of inversions of a set partition. St001842The major index of a set partition. St001843The Z-index of a set partition. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001928The number of non-overlapping descents in a permutation. 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. St001182Number of indecomposable injective modules with codominant dimension at least two in the corresponding Nakayama algebra. St000675The number of centered multitunnels of a Dyck path. St000542The number of left-to-right-minima of a permutation. St000888The maximal sum of entries on a diagonal of an alternating sign matrix. St000892The maximal number of nonzero entries on a diagonal of an alternating sign matrix. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000732The number of double deficiencies of a permutation. St000989The number of final rises of a permutation. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St001948The number of augmented double ascents of a permutation. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001557The number of inversions of the second entry of a permutation. St000021The number of descents of a permutation. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000354The number of recoils of a permutation. St000864The number of circled entries of the shifted recording tableau of a permutation. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St001052The length of the exterior of a permutation. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001234The number of indecomposable three dimensional modules with projective dimension one. St001273The projective dimension of the first term in an injective coresolution of the regular module. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001597The Frobenius rank of a skew partition. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St000155The number of exceedances (also excedences) of a permutation. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000213The number of weak exceedances (also weak excedences) of a permutation. St000325The width of the tree associated to a permutation. St000360The number of occurrences of the pattern 32-1. St000470The number of runs in a permutation. St000516The number of stretching pairs of a permutation. St000650The number of 3-rises of a permutation. St000653The last descent of a permutation. St001017Number of indecomposable injective modules with projective dimension equal to the codominant dimension in the Nakayama algebra corresponding to the Dyck path. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001411The number of patterns 321 or 3412 in a permutation. St001439The number of even weak deficiencies and of odd weak exceedences. St001497The position of the largest weak excedence of a permutation. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001589The nesting number of a perfect matching. St001960The number of descents of a permutation minus one if its first entry is not one. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St001872The number of indecomposable injective modules with even projective dimension in the corresponding Nakayama algebra. St001933The largest multiplicity of a part in an integer partition. St001571The Cartan determinant of the integer partition. St000259The diameter of a connected graph. St000760The length of the longest strictly decreasing subsequence of parts of an integer composition. St000764The number of strong records in an integer composition. St000768The number of peaks in an integer composition. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001867The number of alignments of type EN of a signed permutation. St001868The number of alignments of type NE of a signed permutation. St001527The cyclic permutation representation number of an integer partition. St000015The number of peaks of a Dyck path. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000321The number of integer partitions of n that are dominated by an integer partition. St000346The number of coarsenings of a partition. St000378The diagonal inversion number of an integer partition. St000460The hook length of the last cell along the main diagonal of an integer partition. St000531The leading coefficient of the rook polynomial of an integer partition. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000870The product of the hook lengths of the diagonal cells in an integer partition. St000952Gives the number of irreducible factors of the Coxeter polynomial of the Dyck path over the rational numbers. 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}$. St001032The number of horizontal steps in the bicoloured Motzkin path associated with the Dyck path. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001257The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001297The number of indecomposable non-injective projective modules minus the number of indecomposable non-injective projective modules that have reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001380The number of monomer-dimer tilings of a Ferrers diagram. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001614The cyclic permutation representation number of a skew partition. St001659The number of ways to place as many non-attacking rooks as possible on a Ferrers board. St001732The number of peaks visible from the left. St001885The number of binary words with the same proper border set. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001955The number of natural descents for set-valued two row standard Young tableaux. St000005The bounce statistic of a Dyck path. St000006The dinv of a Dyck path. St000026The position of the first return of a Dyck path. St000032The number of elements smaller than the given Dyck path in the Tamari Order. St000038The product of the heights of the descending steps of a Dyck path. St000054The first entry of the permutation. St000056The decomposition (or block) number of a permutation. St000058The order of a permutation. St000062The length of the longest increasing subsequence of the permutation. St000063The number of linear extensions of a certain poset defined for an integer partition. St000066The column of the unique '1' in the first row of the alternating sign matrix. St000092The number of outer peaks of a permutation. St000099The number of valleys of a permutation, including the boundary. St000108The number of partitions contained in the given partition. St000110The number of permutations less than or equal to a permutation in left weak order. St000157The number of descents of a standard tableau. St000164The number of short pairs. St000167The number of leaves of an ordered tree. St000199The column of the unique '1' in the last row 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. St000239The number of small weak excedances. St000240The number of indices that are not small excedances. St000308The height of the tree associated to a permutation. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000328The maximum number of child nodes in a tree. St000382The first part of an integer composition. St000390The number of runs of ones in a binary word. St000393The number of strictly increasing runs in a binary word. St000396The register function (or Horton-Strahler number) of a binary tree. St000414The binary logarithm of the number of binary trees with the same underlying unordered tree. St000444The length of the maximal rise of a Dyck path. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000507The number of ascents of a standard tableau. St000511The number of invariant subsets when acting with a permutation of given cycle type. St000532The total number of rook placements on a Ferrers board. St000543The size of the conjugacy class of a binary word. St000548The number of different non-empty partial sums of an integer partition. St000568The hook number of a binary tree. St000626The minimal period of a binary word. St000630The length of the shortest palindromic decomposition of a binary word. St000638The number of up-down runs of a permutation. St000655The length of the minimal rise of a Dyck path. St000659The number of rises of length at least 2 of a Dyck path. St000667The greatest common divisor of the parts of the partition. St000676The number of odd rises of a Dyck path. St000685The dominant dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St000696The number of cycles in the breakpoint graph of a permutation. St000700The protection number of an ordered tree. St000701The protection number of a binary tree. St000702The number of weak deficiencies of a permutation. St000733The row containing the largest entry of a standard tableau. St000734The last entry in the first row of a standard tableau. St000738The first entry in the last row of a standard tableau. St000745The index of the last row whose first entry is the row number in a standard Young tableau. St000758The length of the longest staircase fitting into an integer composition. 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. St000839The largest opener of a set partition. St000847The number of standard Young tableaux whose descent set is the binary word. St000862The number of parts of the shifted shape of a permutation. St000868The aid statistic in the sense of Shareshian-Wachs. St000873The aix statistic of a permutation. St000874The position of the last double rise in a Dyck path. St000876The number of factors in the Catalan decomposition of a binary word. St000894The trace of an alternating sign matrix. St000895The number of ones on the main diagonal of an alternating sign matrix. St000947The major index east count of a Dyck path. St000971The smallest closer of a set partition. St000983The length of the longest alternating subword. St000991The number of right-to-left minima of a permutation. St001000Number of indecomposable modules with projective 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. St001015Number of indecomposable injective modules with codominant dimension equal to one in the Nakayama algebra corresponding to the Dyck path. St001016Number of indecomposable injective modules with codominant dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001058The breadth of the ordered tree. St001161The major index north count of a Dyck path. St001165Number of simple modules with even projective 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$. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001203We associate to a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n-1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a Dyck path as follows: St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St001267The length of the Lyndon factorization of the binary word. St001299The product of all non-zero projective dimensions of simple modules of the corresponding Nakayama algebra. St001400The total number of Littlewood-Richardson tableaux of given shape. St001432The order dimension of the partition. St001464The number of bases of the positroid corresponding to the permutation, with all fixed points counterclockwise. St001471The magnitude of a Dyck path. St001500The global dimension of magnitude 1 Nakayama algebras. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001523The degree of symmetry of a Dyck path. St001660The number of ways to place as many non-attacking rooks as possible on a skew Ferrers board. St001661Half the permanent of the Identity matrix plus the permutation matrix associated to the permutation. St001778The largest greatest common divisor of an element and its image in a permutation. St001806The upper middle entry of a permutation. St001807The lower middle entry of a permutation. St001809The index of the step at the first peak of maximal height in a Dyck path. St001814The number of partitions interlacing the given partition. 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. 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$. St001423The number of distinct cubes in a binary word. St001487The number of inner corners of a skew partition. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St000647The number of big descents of a permutation. St000682The Grundy value of Welter's game on a binary word. St000706The product of the factorials of the multiplicities of an integer partition. St000761The number of ascents in an integer composition. St000805The number of peaks of the associated bargraph. St000937The number of positive values of the symmetric group character corresponding to the 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)$. St001462The number of factors of a standard tableaux under concatenation. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001568The smallest positive integer that does not appear twice in the partition. St001569The maximal modular displacement of a permutation. St001737The number of descents of type 2 in a permutation. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St000461The rix statistic of a permutation. St000807The sum of the heights of the valleys of the associated bargraph. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001217The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1. St001520The number of strict 3-descents. St001556The number of inversions of the third entry of a permutation. St001964The interval resolution global dimension of a poset. St000735The last entry on the main diagonal of a standard tableau. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000454The largest eigenvalue of a graph if it is integral. St000771The largest multiplicity of a distance Laplacian eigenvalue in 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. St001488The number of corners of a skew partition. St000383The last part of an integer composition. St000456The monochromatic index of a connected graph. St000993The multiplicity of the largest part of an integer partition. St001128The exponens consonantiae of a partition. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St000707The product of the factorials of the parts. St000815The number of semistandard Young tableaux of partition weight of given shape. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000681The Grundy value of Chomp on Ferrers diagrams. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000744The length of the path to the largest entry in a standard Young tableau. St000770The major index of an integer partition when read from bottom to top. St000939The number of characters of the symmetric group whose value on the partition is positive. St000045The number of linear extensions of a binary tree. St000060The greater neighbor of the maximum. St000061The number of nodes on the left branch of a binary tree. St000082The number of elements smaller than a binary tree in Tamari order. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000280The size of the preimage of the map 'to labelling permutation' from Parking functions to Permutations. St000327The number of cover relations in a poset. St000352The Elizalde-Pak rank of a permutation. St000385The number of vertices with out-degree 1 in a binary tree. St000402Half the size of the symmetry class of a permutation. St000418The number of Dyck paths that are weakly below a Dyck path. St000420The number of Dyck paths that are weakly above a Dyck path. St000487The length of the shortest cycle of a permutation. St000489The number of cycles of a permutation of length at most 3. St000504The cardinality of the first block of a set partition. St000530The number of permutations with the same descent word as the given permutation. St000619The number of cyclic descents of a permutation. St000627The exponent of a binary word. St000695The number of blocks in the first part of the atomic decomposition of a set partition. St000727The largest label of a leaf in the binary search tree associated with the permutation. St000729The minimal arc length of a set 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. St000823The number of unsplittable factors of the set partition. St000832The number of permutations obtained by reversing blocks of three consecutive numbers. St000844The size of the largest block in the direct sum decomposition of a permutation. St000885The number of critical steps in the Catalan decomposition of a binary word. St000886The number of permutations with the same antidiagonal sums. St000898The number of maximal entries in the last diagonal of the monotone triangle. St000922The minimal number such that all substrings of this length are unique. St000925The number of topologically connected components of a set partition. St001062The maximal size of a block of a set partition. St001081The number of minimal length factorizations of a permutation into star transpositions. St001246The maximal difference between two consecutive entries of a permutation. St001346The number of parking functions that give the same permutation. St001360The number of covering relations in Young's lattice below a partition. St001365The number of lattice paths of the same length weakly above the path given by a binary word. St001378The product of the cohook lengths of the integer partition. St001415The length of the longest palindromic prefix of a binary word. St001416The length of a longest palindromic factor of a binary word. St001417The length of a longest palindromic subword of a binary word. St001437The flex of a binary word. St001501The dominant dimension of magnitude 1 Nakayama algebras. St001531Number of partial orders contained in the poset determined by the Dyck path. St001607The number of coloured graphs such that the multiplicities of colours are given by a partition. St001611The number of multiset partitions such that the multiplicities of elements are given by a partition. St001637The number of (upper) dissectors of a poset. St001668The number of points of the poset minus the width of the poset. St001808The box weight or horizontal decoration of a Dyck path. St001884The number of borders of a binary word. St001959The product of the heights of the peaks of a Dyck path. St000260The radius of a connected graph. St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St000973The length of the boundary of an ordered tree. St000975The length of the boundary minus the length of the trunk of an ordered tree. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001249Sum of the odd parts of a partition. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St000003The number of standard Young tableaux of the partition. St000014The number of parking functions supported by a Dyck path. St000048The multinomial of the parts of a partition. St000049The number of set partitions whose sorted block sizes correspond to the partition. St000079The number of alternating sign matrices for a given Dyck path. St000088The row sums of the character table of the symmetric group. St000144The pyramid weight of the Dyck path. St000159The number of distinct parts of the integer partition. St000160The multiplicity of the smallest part of a partition. St000179The product of the hook lengths of the integer partition. St000182The number of permutations whose cycle type is the given integer partition. St000184The size of the centralizer of any permutation of given cycle type. St000228The size of a partition. St000278The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. St000285The size of the preimage of the map 'to inverse des composition' from Parking functions to Integer compositions. St000293The number of inversions of a binary word. St000296The length of the symmetric border of a binary word. St000384The maximal part of the shifted composition of an integer partition. St000419The number of Dyck paths that are weakly above the Dyck path, except for the path itself. St000459The hook length of the base cell of a partition. St000492The rob statistic of a set partition. St000517The Kreweras number of an integer partition. St000519The largest length of a factor maximising the subword complexity. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000549The number of odd partial sums of an integer partition. St000644The number of graphs with given frequency partition. St000762The sum of the positions of the weak records of an integer composition. St000783The side length of the largest staircase partition fitting into a partition. St000784The maximum of the length and the largest part of the integer partition. St000792The Grundy value for the game of ruler on a binary word. 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. St000867The sum of the hook lengths in the first row of an integer partition. St000878The number of ones minus the number of zeros of a binary word. St000942The number of critical left to right maxima of the parking functions. St001013Number of indecomposable injective modules with codominant dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001020Sum of the codominant dimensions of the non-projective indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001027Number of simple modules with projective dimension equal to injective dimension in the Nakayama algebra corresponding to the Dyck path. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001060The distinguishing index of a graph. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. St001127The sum of the squares of the parts of a partition. St001151The number of blocks with odd minimum. St001162The minimum jump of a permutation. St001170Number of indecomposable injective modules whose socle has projective dimension at most g-1 when g denotes the global dimension in the corresponding Nakayama algebra. St001180Number of indecomposable injective modules with projective dimension at most 1. 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. St001348The bounce of the parallelogram polyomino associated with the Dyck path. St001387Number of standard Young tableaux of the skew shape tracing the border of the given partition. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. 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. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001608The number of coloured rooted trees such that the multiplicities of colours are given by a partition. St001612The number of coloured multisets of cycles such that the multiplicities of colours are given by a partition. 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. St001643The Frobenius dimension of the Nakayama algebra corresponding to the Dyck path. St001710The number of permutations such that conjugation with a permutation of given cycle type yields the inverse permutation. St001711The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. St001763The Hurwitz number of an integer partition. St001780The order of promotion on the set of standard tableaux of given shape. 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. St001910The height of the middle non-run of a Dyck path. 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. St000613The number of occurrences of the pattern {{1,3},{2}} such that 2 is minimal, 3 is maximal, (1,3) are consecutive in a block. St000649The number of 3-excedences of a permutation. St001784The minimum of the smallest closer and the second element of the block containing 1 in a set partition. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St000230Sum of the minimal elements of the blocks of a set partition. St000515The number of invariant set partitions when acting with a permutation of given cycle type. St000618The number of self-evacuating tableaux of given shape. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000741The Colin de Verdière graph invariant. St000781The number of proper colouring schemes of a Ferrers diagram. St000782The indicator function of whether a given perfect matching is an L & P matching. St001118The acyclic chromatic index of a graph. 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. St001564The value of the forgotten symmetric functions when all variables set to 1. St001602The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on endofunctions. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. 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. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000834The number of right outer peaks of a permutation. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001262The dimension of the maximal parabolic seaweed algebra corresponding to the partition. St001383The BG-rank of an integer partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001525The number of symmetric hooks on the diagonal of a 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. St001593This is the number of standard Young tableaux of the given shifted shape. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001610The number of coloured endofunctions such that the multiplicities of colours are given by a partition. St001939The number of parts that are equal to their multiplicity in the integer partition. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St001943The sum of the squares of the hook lengths of an integer partition. St000007The number of saliances of the permutation. St001087The number of occurrences of the vincular pattern |12-3 in a permutation. St000023The number of inner peaks of a permutation. St000090The variation of a composition. St000091The descent variation of a composition. St000243The number of cyclic valleys and cyclic peaks of a permutation. St000284The Plancherel distribution on integer partitions. St000498The lcs statistic of a set partition. St000514The number of invariant simple graphs when acting with a permutation of given cycle type. St000562The number of internal points of a set partition. St000577The number of occurrences of the pattern {{1},{2}} such that 1 is a maximal element. 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. St000624The normalized sum of the minimal distances to a greater element. St000779The tier of a permutation. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000901The cube of the number of standard Young tableaux with shape given by the partition. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001469The holeyness of a permutation. St001545The second Elser number of a connected graph. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001722The number of minimal chains with small intervals between a binary word and the top element. St001896The number of right descents of a signed permutations. 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. St000075The orbit size of a standard tableau under promotion. St000089The absolute variation of a composition. St000166The depth minus 1 of an ordered tree. St000365The number of double ascents of a permutation. St000455The second largest eigenvalue of a graph if it is integral. St000522The number of 1-protected nodes of a rooted tree. 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. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St000521The number of distinct subtrees of an ordered tree. St001516The number of cyclic bonds of a permutation. St000567The sum of the products of all pairs of parts. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000929The constant term of the character polynomial of an integer partition. 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. 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. St000421The number of Dyck paths that are weakly below a Dyck path, except for the path itself. St000477The weight of a partition according to Alladi. St000478Another weight of a partition according to Alladi. St000509The diagonal index (content) of a partition. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000632The jump number of the poset. St000736The last entry in the first row of a semistandard tableau. St000934The 2-degree of an integer partition. St000946The sum of the skew hook positions in a Dyck path. St000976The sum of the positions of double up-steps of a Dyck path. St000984The number of boxes below precisely one peak. St000997The even-odd crank of an integer partition. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001107The number of times one can erase the first up and the last down step in a Dyck path and still remain a Dyck path. 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)$. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. 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. St000307The number of rowmotion orbits of a poset. St001095The number of non-isomorphic posets with precisely one further covering relation. St001811The Castelnuovo-Mumford regularity of a permutation. St000717The number of ordinal summands of a poset.