- FindStat

Your data matches 840 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)

Matching statistic: St000157
(load all 4 compositions to match this statistic)

Mapping

St000157: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[[1]]
 => 0
[[1,2]]
 => 0
[[1],[2]]
 => 1
[[1,2,3]]
 => 0
[[1,3],[2]]
 => 1
[[1,2],[3]]
 => 1
[[1],[2],[3]]
 => 2

Description

The number of descents of a standard tableau. Entry

$i$ of a standard Young tableau is a descent if

$i+1$ appears in a row below the row of

$i$ .

Matching statistic: St000507
(load all 3 compositions to match this statistic)

Mapping

St000507: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[[1]]
 => 1 = 0 + 1
[[1,2]]
 => 2 = 1 + 1
[[1],[2]]
 => 1 = 0 + 1
[[1,2,3]]
 => 3 = 2 + 1
[[1,3],[2]]
 => 2 = 1 + 1
[[1,2],[3]]
 => 2 = 1 + 1
[[1],[2],[3]]
 => 1 = 0 + 1

Description

The number of ascents of a standard tableau. Entry

$i$ of a standard Young tableau is an '''ascent''' if

$i+1$ appears to the right or above

$i$ in the tableau (with respect to the English notation for tableaux).

Matching statistic: St001462
(load all 5 compositions to match this statistic)

Mapping

St001462: Standard tableaux ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[[1]]
 => 1 = 0 + 1
[[1,2]]
 => 2 = 1 + 1
[[1],[2]]
 => 1 = 0 + 1
[[1,2,3]]
 => 3 = 2 + 1
[[1,3],[2]]
 => 2 = 1 + 1
[[1,2],[3]]
 => 2 = 1 + 1
[[1],[2],[3]]
 => 1 = 0 + 1

Description

The number of factors of a standard tableaux under concatenation. The concatenation of two standard Young tableaux

$T_1$ and

$T_2$ is obtained by adding the largest entry of

$T_1$ to each entry of

$T_2$ , and then appending the rows of the result to

$T_1$ , see [1, dfn 2.10]. This statistic returns the maximal number of standard tableaux such that their concatenation is the given tableau.

Matching statistic: St000021
(load all 9 compositions to match this statistic)

Mapping

Mp00081: Standard tableaux —reading word permutation⟶ Permutations
St000021: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[[1]]
 => [1] => 0
[[1,2]]
 => [1,2] => 0
[[1],[2]]
 => [2,1] => 1
[[1,2,3]]
 => [1,2,3] => 0
[[1,3],[2]]
 => [2,1,3] => 1
[[1,2],[3]]
 => [3,1,2] => 1
[[1],[2],[3]]
 => [3,2,1] => 2

Description

The number of descents of a permutation. This can be described as an occurrence of the vincular mesh pattern ([2,1], {(1,0),(1,1),(1,2)}), i.e., the middle column is shaded, see [3].

Matching statistic: St000156
(load all 4 compositions to match this statistic)

Mapping

Mp00081: Standard tableaux —reading word permutation⟶ Permutations
St000156: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[[1]]
 => [1] => 0
[[1,2]]
 => [1,2] => 0
[[1],[2]]
 => [2,1] => 1
[[1,2,3]]
 => [1,2,3] => 0
[[1,3],[2]]
 => [2,1,3] => 1
[[1,2],[3]]
 => [3,1,2] => 1
[[1],[2],[3]]
 => [3,2,1] => 2

Description

The Denert index of a permutation. It is defined as

$\begin{align*} den(\sigma) &= \#\{ 1\leq l < k \leq n : \sigma(k) < \sigma(l) \leq k \} \\ &+ \#\{ 1\leq l < k \leq n : \sigma(l) \leq k < \sigma(k) \} \\ &+ \#\{ 1\leq l < k \leq n : k < \sigma(k) < \sigma(l) \} \end{align*}$ where

$n$ is the size of

$\sigma$ . It was studied by Denert in [1], and it was shown by Foata and Zeilberger in [2] that the bistatistic

$(exc,den)$ is [[Permutations/Descents-Major#Euler-Mahonian_statistics|Euler-Mahonian]]. Here,

$exc$ is the number of weak exceedences, see [[St000155]].

Matching statistic: St000211
(load all 5 compositions to match this statistic)

Mapping

Mp00284: Standard tableaux —rows⟶ Set partitions
St000211: Set partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[[1]]
 => {{1}}
 => 0
[[1,2]]
 => {{1,2}}
 => 1
[[1],[2]]
 => {{1},{2}}
 => 0
[[1,2,3]]
 => {{1,2,3}}
 => 2
[[1,3],[2]]
 => {{1,3},{2}}
 => 1
[[1,2],[3]]
 => {{1,2},{3}}
 => 1
[[1],[2],[3]]
 => {{1},{2},{3}}
 => 0

Description

The rank of the set partition. This is defined as the number of elements in the set partition minus the number of blocks, or, equivalently, the number of arcs in the one-line diagram associated to the set partition.

Matching statistic: St000245
(load all 9 compositions to match this statistic)

Mapping

Mp00081: Standard tableaux —reading word permutation⟶ Permutations
St000245: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[[1]]
 => [1] => 0
[[1,2]]
 => [1,2] => 1
[[1],[2]]
 => [2,1] => 0
[[1,2,3]]
 => [1,2,3] => 2
[[1,3],[2]]
 => [2,1,3] => 1
[[1,2],[3]]
 => [3,1,2] => 1
[[1],[2],[3]]
 => [3,2,1] => 0

Description

The number of ascents of a permutation.

Matching statistic: St000319
(load all 4 compositions to match this statistic)

Mapping

Mp00083: Standard tableaux —shape⟶ Integer partitions
St000319: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[[1]]
 => [1]
 => 0
[[1,2]]
 => [2]
 => 1
[[1],[2]]
 => [1,1]
 => 0
[[1,2,3]]
 => [3]
 => 2
[[1,3],[2]]
 => [2,1]
 => 1
[[1,2],[3]]
 => [2,1]
 => 1
[[1],[2],[3]]
 => [1,1,1]
 => 0

Description

The spin of an integer partition. The Ferrers shape of an integer partition

$\lambda$ can be decomposed into border strips. The spin is then defined to be the total number of crossings of border strips of

$\lambda$ with the vertical lines in the Ferrers shape. The following example is taken from Appendix B in [1]: Let

$\lambda = (5,5,4,4,2,1)$ . Removing the border strips successively yields the sequence of partitions

$(5,5,4,4,2,1), (4,3,3,1), (2,2), (1), ().$ The first strip

$(5,5,4,4,2,1) \setminus (4,3,3,1)$ crosses

$4$ times, the second strip

$(4,3,3,1) \setminus (2,2)$ crosses

$3$ times, the strip

$(2,2) \setminus (1)$ crosses

$1$ time, and the remaining strip

$(1) \setminus ()$ does not cross. This yields the spin of

$(5,5,4,4,2,1)$ to be

$4+3+1 = 8$ .

Matching statistic: St000320
(load all 4 compositions to match this statistic)

Mapping

Mp00083: Standard tableaux —shape⟶ Integer partitions
St000320: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[[1]]
 => [1]
 => 0
[[1,2]]
 => [2]
 => 1
[[1],[2]]
 => [1,1]
 => 0
[[1,2,3]]
 => [3]
 => 2
[[1,3],[2]]
 => [2,1]
 => 1
[[1,2],[3]]
 => [2,1]
 => 1
[[1],[2],[3]]
 => [1,1,1]
 => 0

Description

The dinv adjustment of an integer partition. The Ferrers shape of an integer partition

$\lambda = (\lambda_1,\ldots,\lambda_k)$ can be decomposed into border strips. For

$0 \leq j < \lambda_1$ let

$n_j$ be the length of the border strip starting at

$(\lambda_1-j,0)$ . The dinv adjustment is then defined by

$\sum_{j:n_j > 0}(\lambda_1-1-j).$ The following example is taken from Appendix B in [2]: Let

$\lambda=(5,5,4,4,2,1)$ . Removing the border strips successively yields the sequence of partitions

$(5,5,4,4,2,1),(4,3,3,1),(2,2),(1),(),$ and we obtain

$(n_0,\ldots,n_4) = (10,7,0,3,1)$ . The dinv adjustment is thus

$4+3+1+0 = 8$ .

Matching statistic: St000333
(load all 9 compositions to match this statistic)

Mapping

Mp00081: Standard tableaux —reading word permutation⟶ Permutations
St000333: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%

Values

[[1]]
 => [1] => 0
[[1,2]]
 => [1,2] => 0
[[1],[2]]
 => [2,1] => 1
[[1,2,3]]
 => [1,2,3] => 0
[[1,3],[2]]
 => [2,1,3] => 2
[[1,2],[3]]
 => [3,1,2] => 1
[[1],[2],[3]]
 => [3,2,1] => 1

Description

The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. This descent set is denoted by

$\operatorname{ZDer}(\sigma)$ in [1].

The following 830 statistics, ordered by result quality, also match your data. Click on any of them to see the details.

St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000374The number of exclusive right-to-left minima of a permutation. St000651The maximal size of a rise in a permutation. St000662The staircase size of the code of a permutation. St000670The reversal length of a permutation. St000672The number of minimal elements in Bruhat order not less than the permutation. St000703The number of deficiencies of a permutation. St000742The number of big ascents of a permutation after prepending zero. St000864The number of circled entries of the shifted recording tableau of a permutation. St001090The number of pop-stack-sorts needed to sort a permutation. St001176The size of a partition minus its first part. St001298The number of repeated entries in the Lehmer code of a permutation. St001375The pancake length of a permutation. St001489The maximum of the number of descents and the number of inverse descents. St001579The number of cyclically simple transpositions decreasing the number of cyclic descents needed to sort a permutation. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001671Haglund's hag of a permutation. St001726The number of visible inversions of a permutation. St001760The number of prefix or suffix reversals needed to sort a permutation. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St000010The length of the partition. St000031The number of cycles in the cycle decomposition of a permutation. St000058The order of a permutation. St000062The length of the longest increasing subsequence of the permutation. St000105The number of blocks in the set partition. St000147The largest part of an integer partition. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000213The number of weak exceedances (also weak excedences) of a permutation. St000308The height of the tree associated to a permutation. St000321The number of integer partitions of n that are dominated by an integer partition. St000325The width of the tree associated to a permutation. St000345The number of refinements of a partition. St000346The number of coarsenings of a partition. St000381The largest part of an integer composition. St000451The length of the longest pattern of the form k 1 2. St000470The number of runs in a permutation. St000542The number of left-to-right-minima of a permutation. St000808The number of up steps of the associated bargraph. St000935The number of ordered refinements of an integer partition. St000971The smallest closer of a set partition. St000991The number of right-to-left minima of a permutation. St001050The number of terminal closers of a set partition. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001389The number of partitions of the same length below the given integer partition. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001461The number of topologically connected components of the chord diagram of a permutation. St001464The number of bases of the positroid corresponding to the permutation, with all fixed points counterclockwise. St001784The minimum of the smallest closer and the second element of the block containing 1 in a set partition. St000004The major index of a permutation. St000012The area of a Dyck path. St000018The number of inversions of a permutation. St000019The cardinality of the support 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. St000029The depth of a permutation. St000030The sum of the descent differences of a permutations. St000051The size of the left subtree of a binary tree. St000053The number of valleys of the Dyck path. St000080The rank of the poset. St000120The number of left tunnels of a Dyck path. St000133The "bounce" of a permutation. St000141The maximum drop size of a permutation. St000148The number of odd parts of a partition. St000154The sum of the descent bottoms of a permutation. St000155The number of exceedances (also excedences) of a permutation. St000160The multiplicity of the smallest part of a partition. St000209Maximum difference of elements in cycles. St000214The number of adjacencies of a permutation. St000224The sorting index of a permutation. St000228The size of a partition. St000234The number of global ascents of a permutation. St000237The number of small exceedances. St000238The number of indices that are not small weak excedances. St000246The number of non-inversions of a permutation. St000272The treewidth of a graph. St000290The major index of a binary word. St000305The inverse major index of a permutation. St000306The bounce count of a Dyck path. St000316The number of non-left-to-right-maxima of a permutation. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000331The number of upper interactions of a Dyck path. St000334The maz index, the major index of a permutation after replacing fixed points by zeros. St000339The maf index of a permutation. St000340The number of non-final maximal constant sub-paths of length greater than one. St000362The size of a minimal vertex cover of a graph. St000377The dinv defect of an integer partition. St000384The maximal part of the shifted composition of an integer partition. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000441The number of successions of a permutation. St000459The hook length of the base cell of a partition. St000475The number of parts equal to 1 in a partition. St000519The largest length of a factor maximising the subword complexity. St000536The pathwidth of a graph. St000537The cutwidth of a graph. St000546The number of global descents of a permutation. St000548The number of different non-empty partial sums of an integer partition. St000632The jump number of the poset. St000691The number of changes of a binary word. St000692Babson and Steingrímsson's statistic of a permutation. St000784The maximum of the length and the largest part of the integer partition. St000846The maximal number of elements covering an element of a poset. St000867The sum of the hook lengths in the first row of an integer partition. St000868The aid statistic in the sense of Shareshian-Wachs. St000996The number of exclusive left-to-right maxima of a permutation. St001079The minimal length of a factorization of a permutation using the permutations (12)(34). St001094The depth index of a set partition. St001127The sum of the squares of the parts of a partition. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. 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$ . St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001270The bandwidth of a graph. St001274The number of indecomposable injective modules with projective dimension equal to two. St001277The degeneracy of a graph. St001278The number of indecomposable modules that are fixed by

$\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001358The largest degree of a regular subgraph of a graph. St001427The number of descents of a signed permutation. St001485The modular major index of a binary word. 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. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001512The minimum rank of a graph. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001558The number of transpositions that are smaller or equal to a permutation in Bruhat order. St001644The dimension of a graph. St001684The reduced word complexity of a permutation. St001743The discrepancy of a graph. St001769The reflection length of a signed permutation. St001792The arboricity of a graph. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001812The biclique partition number of a graph. St001823The Stasinski-Voll length of a signed permutation. St001896The number of right descents of a signed permutations. St001905The number of preferred parking spots in a parking function less than the index of the car. St001935The number of ascents in a parking function. St001946The number of descents in a parking function. St001962The proper pathwidth of a graph. St000007The number of saliances of the permutation. St000011The number of touch points (or returns) of a Dyck path. St000013The height of a Dyck path. St000015The number of peaks of a Dyck path. St000032The number of elements smaller than the given Dyck path in the Tamari Order. St000054The first entry of the permutation. St000056The decomposition (or block) number of a 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. St000068The number of minimal elements in a poset. St000071The number of maximal chains in a poset. St000093The cardinality of a maximal independent set of vertices of a graph. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000108The number of partitions contained in the given partition. St000110The number of permutations less than or equal to a permutation in left weak order. St000153The number of adjacent cycles of a permutation. St000172The Grundy number of a graph. St000239The number of small weak excedances. St000240The number of indices that are not small excedances. St000288The number of ones in a binary word. St000299The number of nonisomorphic vertex-induced subtrees. St000314The number of left-to-right-maxima of a permutation. St000335The difference of lower and upper interactions. St000378The diagonal inversion number of an integer partition. St000383The last part of an integer composition. St000443The number of long tunnels of a Dyck path. St000453The number of distinct Laplacian eigenvalues of a graph. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000482The (zero)-forcing number of a graph. St000527The width of the poset. St000528The height of a poset. St000532The total number of rook placements on a Ferrers board. St000553The number of blocks of a graph. St000638The number of up-down runs of a permutation. St000676The number of odd rises of a Dyck path. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. 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. St000740The last entry of a permutation. St000745The index of the last row whose first entry is the row number in a standard Young tableau. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000765The number of weak records in an integer composition. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000822The Hadwiger number of the graph. St000839The largest opener of a set partition. St000876The number of factors in the Catalan decomposition of a binary word. St000883The number of longest increasing subsequences of a permutation. St000885The number of critical steps in the Catalan decomposition of a binary word. St000912The number of maximal antichains in a poset. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000982The length of the longest constant subword. St000983The length of the longest alternating subword. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001014Number of indecomposable injective modules with codominant dimension equal to the dominant dimension of the Nakayama algebra corresponding to the Dyck path. St001029The size of the core of a graph. St001051The depth of the label 1 in the decreasing labelled unordered tree associated with the set partition. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001093The detour number of a graph. St001116The game chromatic number of a graph. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001202Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series

$L=[c_0,c_1,...,c_{n−1}]$ such that

$n=c_0 < c_i$ for all

$i > 0$ a special CNakayama algebra. St001203We associate to a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series

$L=[c_0,c_1,...,c_{n-1}]$ such that

$n=c_0 < c_i$ for all

$i > 0$ a Dyck path as follows: St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St001285The number of primes in the column sums of the two line notation of a permutation. St001286The annihilation number of a graph. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001330The hat guessing number of a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001343The dimension of the reduced incidence algebra of a poset. St001372The length of a longest cyclic run of ones of a binary word. St001400The total number of Littlewood-Richardson tableaux of given shape. St001494The Alon-Tarsi number of a graph. St001497The position of the largest weak excedence of a permutation. St001530The depth of a Dyck path. St001555The order of a signed permutation. St001580The acyclic chromatic number of a graph. St001581The achromatic number of a graph. St001652The length of a longest interval of consecutive numbers. St001662The length of the longest factor of consecutive numbers in a permutation. St001670The connected partition number of a graph. St001674The number of vertices of the largest induced star graph in the graph. St001717The largest size of an interval in a poset. St001773The number of minimal elements in Bruhat order not less than the signed permutation. St001806The upper middle entry of a permutation. St001807The lower middle entry of a permutation. St001863The number of weak excedances of a signed permutation. St001883The mutual visibility number of a graph. St001963The tree-depth of a graph. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. 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. 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. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St000005The bounce statistic of a Dyck path. St000006The dinv of a Dyck path. St000008The major index of the composition. St000009The charge of a standard tableau. St000025The number of initial rises of a Dyck path. St000039The number of crossings of a permutation. St000041The number of nestings of a perfect matching. St000052The number of valleys of a Dyck path not on the x-axis. St000057The Shynar inversion number of a standard tableau. St000059The inversion number of a standard tableau as defined by Haglund and Stevens. St000067The inversion number of the alternating sign matrix. St000074The number of special entries. St000076The rank of the alternating sign matrix in the alternating sign matrix poset. St000091The descent variation of a composition. St000117The number of centered tunnels of a Dyck path. St000136The dinv of a parking function. St000159The number of distinct parts of the integer partition. St000161The sum of the sizes of the right subtrees of a binary tree. St000168The number of internal nodes of an ordered tree. St000171The degree of the graph. St000194The number of primary dinversion pairs of a labelled dyck path corresponding to a parking function. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000292The number of ascents of a binary word. St000293The number of inversions of a binary word. St000295The length of the border of a binary word. St000304The load of a permutation. St000310The minimal degree of a vertex of a graph. St000317The cycle descent number of a permutation. St000330The (standard) major index of a standard tableau. St000332The positive inversions of an alternating sign matrix. St000338The number of pixed points of a permutation. St000358The number of occurrences of the pattern 31-2. St000369The dinv deficit of a Dyck path. St000376The bounce deficit of a Dyck path. St000389The number of runs of ones of odd length in a binary word. St000392The length of the longest run of ones in a binary word. St000424The number of occurrences of the pattern 132 or of the pattern 231 in a permutation. St000435The number of occurrences of the pattern 213 or of the pattern 231 in a permutation. St000436The number of occurrences of the pattern 231 or of the pattern 321 in a permutation. St000446The disorder of a permutation. St000454The largest eigenvalue of a graph if it is integral. St000461The rix statistic of a permutation. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000628The balance of a binary word. St000645The sum of the areas of the rectangles formed by two consecutive peaks and the valley in between. St000682The Grundy value of Welter's game on a binary word. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000710The number of big deficiencies of a permutation. St000731The number of double exceedences of a permutation. St000732The number of double deficiencies of a permutation. St000741The Colin de Verdière graph invariant. St000753The Grundy value for the game of Kayles on a binary word. St000778The metric dimension of a graph. St000783The side length of the largest staircase partition fitting into a partition. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000835The minimal difference in size when partitioning the integer partition into two subpartitions. St000845The maximal number of elements covered by an element in a poset. St000873The aix statistic of a permutation. St000877The depth of the binary word interpreted as a path. St000921The number of internal inversions of a binary word. St000947The major index east count of a Dyck path. St000954Number of times the corresponding LNakayama algebra has

$Ext^i(D(A),A)=0$ for

$i>0$ . St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St000989The number of final rises of a permutation. St000992The alternating sum of the parts of an integer partition. St001017Number of indecomposable injective modules with projective dimension equal to the codominant dimension 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. St001033The normalized area of the parallelogram polyomino associated with the Dyck path. St001034The area of the parallelogram polyomino associated with the Dyck path. St001046The maximal number of arcs nesting a given arc of a perfect matching. 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. St001104The number of descents of the invariant in a tensor power of the adjoint representation of the rank two general linear group. St001119The length of a shortest maximal path in a graph. St001120The length of a longest path in a graph. St001152The number of pairs with even minimum in a perfect matching. St001161The major index north count of a Dyck path. St001164Number of indecomposable injective modules whose socle has projective dimension at most g-1 (g the global dimension) minus the number of indecomposable projective-injective modules. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001188The number of simple modules

$S$ with grade

$\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra

$A$ corresponding to the Dyck path. St001192The maximal dimension of

$Ext_A^2(S,A)$ for a simple module

$S$ over the corresponding Nakayama algebra

$A$ . St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. 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. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001251The number of parts of a partition that are not congruent 1 modulo 3. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. St001280The number of parts of an integer partition that are at least two. St001287The number of primes obtained by multiplying preimage and image of a permutation and subtracting one. St001300The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset. St001323The independence gap of a graph. St001331The size of the minimal feedback vertex set. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001340The cardinality of a minimal non-edge isolating set of a graph. St001345The Hamming dimension of a graph. St001357The maximal degree of a regular spanning subgraph of a graph. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001391The disjunction number of a graph. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001419The length of the longest palindromic factor beginning with a one of a binary word. St001420Half the length of a longest factor which is its own reverse-complement of a binary word. St001428The number of B-inversions of a signed permutation. St001434The number of negative sum pairs of a signed permutation. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001479The number of bridges of a graph. St001557The number of inversions of the second entry of a permutation. St001572The minimal number of edges to remove to make a graph bipartite. St001573The minimal number of edges to remove to make a graph triangle-free. St001584The area statistic between a Dyck path and its bounce path. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St001615The number of join prime elements of a lattice. St001617The dimension of the space of valuations of a lattice. St001622The number of join-irreducible elements of a lattice. St001631The number of simple modules

$S$ with

$dim Ext^1(S,A)=1$ in the incidence algebra

$A$ of the poset. St001675The number of parts equal to the part in the reversed composition. St001689The number of celebrities in a graph. St001692The number of vertices with higher degree than the average degree in a graph. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001712The number of natural descents of a standard Young tableau. St001727The number of invisible inversions of a permutation. St001745The number of occurrences of the arrow pattern 13 with an arrow from 1 to 2 in a permutation. St001771The number of occurrences of the signed pattern 1-2 in a signed permutation. St001772The number of occurrences of the signed pattern 12 in a signed permutation. St001777The number of weak descents in an integer composition. St001821The sorting index of a signed permutation. St001822The number of alignments of a signed permutation. St001826The maximal number of leaves on a vertex of a graph. St001861The number of Bruhat lower covers of a permutation. St001862The number of crossings of a signed permutation. St001864The number of excedances of a signed permutation. St001866The nesting alignments of a signed permutation. St001869The maximum cut size of a graph. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St001894The depth of a signed permutation. St001907The number of Bastidas - Hohlweg - Saliola excedances of a signed permutation. St001910The height of the middle non-run of a Dyck path. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St001948The number of augmented double ascents of a permutation. St001949The rigidity index of a graph. St001956The comajor index for set-valued two-row standard Young tableaux. St000026The position of the first return of a Dyck path. St000060The greater neighbor of the maximum. St000069The number of maximal elements of a poset. St000084The number of subtrees. St000087The number of induced subgraphs. St000144The pyramid weight of the Dyck path. St000164The number of short pairs. St000166The depth minus 1 of an ordered tree. St000167The number of leaves of an ordered tree. St000181The number of connected components of the Hasse diagram for the poset. St000184The size of the centralizer of any permutation of given cycle type. St000193The row of the unique '1' in the first column of the alternating sign matrix. 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. St000258The burning number of a graph. St000273The domination number of a graph. St000286The number of connected components of the complement of a graph. St000287The number of connected components of a graph. St000291The number of descents of a binary word. St000297The number of leading ones in a binary word. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000326The position of the first one in a binary word after appending a 1 at the end. St000328The maximum number of child nodes in a tree. St000363The number of minimal vertex covers of a graph. St000382The first part of an integer composition. St000388The number of orbits of vertices of a graph under automorphisms. St000390The number of runs of ones in a binary word. St000393The number of strictly increasing runs in a binary word. St000395The sum of the heights of the peaks of a Dyck path. St000442The maximal area to the right of an up step of a Dyck path. St000452The number of distinct eigenvalues of a graph. St000460The hook length of the last cell along the main diagonal of an integer partition. St000469The distinguishing number of a graph. St000479The Ramsey number of a graph. St000501The size of the first part in the decomposition of a permutation. St000505The biggest entry in the block containing the 1. St000531The leading coefficient of the rook polynomial of an integer partition. St000544The cop number of a graph. St000550The number of modular elements of a lattice. St000551The number of left modular elements of a lattice. St000617The number of global maxima of a Dyck path. St000626The minimal period of a binary word. St000636The hull number of a graph. St000653The last descent of a permutation. St000654The first descent of a permutation. St000675The number of centered multitunnels of a Dyck path. St000678The number of up steps after the last double rise of a Dyck path. St000702The number of weak deficiencies of a permutation. St000720The size of the largest partition in the oscillating tableau corresponding to the perfect matching. St000722The number of different neighbourhoods in a graph. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000746The number of pairs with odd minimum in a perfect matching. St000767The number of runs in an integer composition. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000776The maximal multiplicity of an eigenvalue in a graph. St000794The mak of a permutation. St000816The number of standard composition tableaux of the composition. St000833The comajor index of a permutation. St000840The number of closers smaller than the largest opener in a perfect matching. St000843The decomposition number of a perfect matching. St000847The number of standard Young tableaux whose descent set is the binary word. St000870The product of the hook lengths of the diagonal cells in an integer partition. St000899The maximal number of repetitions of an integer composition. St000904The maximal number of repetitions of an integer composition. St000907The number of maximal antichains of minimal length in a poset. St000908The length of the shortest maximal antichain in a poset. St000909The number of maximal chains of maximal size in a poset. St000911The number of maximal antichains of maximal size in a poset. St000916The packing number of a graph. St000917The open packing number of a graph. St000918The 2-limited packing number of a graph. St000926The clique-coclique number of a graph. St000942The number of critical left to right maxima of the parking functions. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001000Number of indecomposable modules with projective dimension equal to the global dimension in 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. St001018Sum of projective dimension of the indecomposable injective modules of 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. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001041The depth of the label 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001045The number of leaves in the subtree not containing one in the decreasing labelled binary unordered tree associated with the perfect matching. St001048The number of leaves in the subtree containing 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001058The breadth of the ordered tree. St001108The 2-dynamic chromatic number of a graph. St001110The 3-dynamic chromatic number of a graph. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001201The grade of the simple module

$S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001239The largest vector space dimension of the double dual of a simple module in 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. St001268The size of the largest ordinal summand in the poset. St001313The number of Dyck paths above the lattice path given by a binary word. St001315The dissociation number of a graph. St001316The domatic number of a graph. St001318The number of vertices of the largest induced subforest with the same number of connected components of a graph. St001321The number of vertices of the largest induced subforest of a graph. St001322The size of a minimal independent dominating set in a graph. St001339The irredundance number of a graph. St001342The number of vertices in the center of a graph. St001348The bounce of the parallelogram polyomino associated with the Dyck path. St001352The number of internal nodes in the modular decomposition of a graph. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001360The number of covering relations in Young's lattice below a partition. St001363The Euler characteristic of a graph according to Knill. St001366The maximal multiplicity of a degree of a vertex of a graph. St001368The number of vertices of maximal degree in a graph. St001373The logarithm of the number of winning configurations of the lights out game on a graph. St001380The number of monomer-dimer tilings of a Ferrers diagram. St001399The distinguishing number of a poset. St001415The length of the longest palindromic prefix of a binary word. 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. St001437The flex of a binary word. St001463The number of distinct columns in the nullspace of a graph. St001480The number of simple summands of the module J^2/J^3. St001481The minimal height of a peak of a Dyck path. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001523The degree of symmetry of a Dyck path. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001589The nesting number of a perfect matching. St001611The number of multiset partitions such that the multiplicities of elements are given by a partition. St001612The number of coloured multisets of cycles such that the multiplicities of colours are given by a partition. St001616The number of neutral elements in a lattice. St001645The pebbling number of a connected graph. St001654The monophonic hull number of a graph. St001655The general position number of a graph. St001656The monophonic position number of a graph. St001659The number of ways to place as many non-attacking rooks as possible on a Ferrers board. St001660The number of ways to place as many non-attacking rooks as possible on a skew Ferrers board. St001672The restrained domination number of a graph. St001707The length of a longest path in a graph such that the remaining vertices can be partitioned into two sets of the same size without edges between them. St001720The minimal length of a chain of small intervals in a lattice. St001725The harmonious chromatic number of a graph. St001733The number of weak left to right maxima of a Dyck path. St001746The coalition number of a graph. St001757The number of orbits of toric promotion on a graph. St001759The Rajchgot index of a permutation. St001774The degree of the minimal polynomial of the smallest eigenvalue of a graph. St001775The degree of the minimal polynomial of the largest eigenvalue of a graph. St001778The largest greatest common divisor of an element and its image in a permutation. St001779The order of promotion on the set of linear extensions of a poset. St001800The number of 3-Catalan paths having this Dyck path as first and last coordinate projections. St001809The index of the step at the first peak of maximal height in a Dyck path. St001813The product of the sizes of the principal order filters in a poset. St001814The number of partitions interlacing the given partition. St001820The size of the image of the pop stack sorting operator. St001829The common independence number of a graph. St001844The maximal degree of a generator of the invariant ring of the automorphism group of a graph. St001855The number of signed permutations less than or equal to a signed permutation in left weak order. St001884The number of borders of a binary word. St001889The size of the connectivity set of a signed permutation. St001904The length of the initial strictly increasing segment of a parking function. St001929The number of meanders with top half given by the noncrossing matching corresponding to the Dyck path. St001951The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. St001955The number of natural descents for set-valued two row standard Young tableaux. St000094The depth of an ordered tree. St000111The sum of the descent tops (or Genocchi descents) of a permutation. St000203The number of external nodes of a binary tree. St000300The number of independent sets of vertices of a graph. St000301The number of facets of the stable set polytope of a graph. St000380Half of the maximal perimeter of a rectangle fitting into the diagram of an integer partition. St000439The position of the first down step of a Dyck path. St000521The number of distinct subtrees of an ordered tree. St000724The label of the leaf of the path following the smaller label in the increasing binary tree associated to a permutation. St000725The smallest label of a leaf of the increasing binary tree associated to a permutation. St000727The largest label of a leaf in the binary search tree associated with the permutation. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000820The number of compositions obtained by rotating the composition. St000866The number of admissible inversions of a permutation in the sense of Shareshian-Wachs. 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}$ . St000998Number of indecomposable projective modules with injective dimension smaller than or equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. 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. St001023Number of simple modules with projective dimension at most 3 in the Nakayama algebra corresponding to the Dyck path. St001065Number of indecomposable reflexive modules in the corresponding Nakayama algebra. St001166Number of indecomposable projective non-injective modules with dominant dimension equal to the global dimension plus the number of indecomposable projective injective modules in the corresponding Nakayama algebra. St001179Number of indecomposable injective modules with projective dimension at most 2 in the corresponding Nakayama algebra. St001180Number of indecomposable injective modules with projective dimension at most 1. St001190Number of simple modules with projective dimension at most 4 in the corresponding Nakayama algebra. St001237The number of simple modules with injective dimension at most one or dominant dimension at least one. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St001416The length of a longest palindromic factor of a binary word. St001417The length of a longest palindromic subword of a binary word. St001486The number of corners of the ribbon associated with an integer composition. 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. St001619The number of non-isomorphic sublattices of a lattice. St001650The order of Ringel's homological bijection associated to the linear Nakayama algebra corresponding to the Dyck path. St001658The total number of rook placements on a Ferrers board. St001666The number of non-isomorphic subposets of a lattice which are lattices. St000806The semiperimeter of the associated bargraph. St000967The value p(1) for the Coxeterpolynomial p of the corresponding LNakayama algebra. St001218Smallest index k greater than or equal to one such that the Coxeter matrix C of the corresponding Nakayama algebra has C^k=1. St001255The vector space dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001492The number of simple modules that do not appear in the socle of the regular module or have no nontrivial selfextensions with the regular module in the corresponding Nakayama algebra. St000216The absolute length of a permutation. St000354The number of recoils of a permutation. St000539The number of odd inversions of a permutation. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000730The maximal arc length of a set partition. St000809The reduced reflection length of the permutation. St000829The Ulam distance of a permutation to the identity permutation. St001076The minimal length of a factorization of a permutation into transpositions that are cyclic shifts of (12). St001077The prefix exchange distance of a permutation. St001080The minimal length of a factorization of a permutation using the transposition (12) and the cycle (1,. 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. St000485The length of the longest 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. St000668The least common multiple of the parts of the partition. St000708The product of the parts of an integer partition. St000823The number of unsplittable factors of the set partition. St000925The number of topologically connected components of a set partition. St000933The number of multipartitions of sizes given by an integer partition. St000990The first ascent of a permutation. St001062The maximal size of a block of a set partition. St000083The number of left oriented leafs of a binary tree except the first one. St000472The sum of the ascent bottoms of a permutation. St000494The number of inversions of distance at most 3 of a permutation. St000495The number of inversions of distance at most 2 of a permutation. St000502The number of successions of a set partitions. St000503The maximal difference between two elements in a common block. St000728The dimension of a set partition. St000795The mad of a permutation. St000796The stat' of a permutation. St000797The stat`` of a permutation. St000798The makl of a permutation. St000831The number of indices that are either descents or recoils. St000956The maximal displacement of a permutation. St000957The number of Bruhat lower covers of a permutation. St000984The number of boxes below precisely one peak. St001061The number of indices that are both descents and recoils of a permutation. 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)$ . St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. St001592The maximal number of simple paths between any two different vertices of a graph. St001668The number of points of the poset minus the width of the poset. St001860The number of factors of the Stanley symmetric function associated with a signed permutation. St000061The number of nodes on the left branch of a binary tree. St000280The size of the preimage of the map 'to labelling permutation' from Parking functions to Permutations. St000444The length of the maximal rise of a Dyck path. St000729The minimal arc length of a set partition. St000844The size of the largest block in the direct sum decomposition of a permutation. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St000937The number of positive values of the symmetric group character corresponding to the partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001346The number of parking functions that give the same permutation. St001959The product of the heights of the peaks of a Dyck path. St000259The diameter of a connected graph. St000260The radius of a connected graph. St000289The decimal representation of a binary word. St000327The number of cover relations in a poset. St000391The sum of the positions of the ones in a binary word. St000419The number of Dyck paths that are weakly above the Dyck path, except for the path itself. St000490The intertwining number of a set partition. St000492The rob statistic of a set partition. St000493The los statistic of a set partition. St000499The rcb statistic of a set partition. St000574The number of occurrences of the pattern {{1},{2}} such that 1 is a minimal and 2 a maximal element. St000577The number of occurrences of the pattern {{1},{2}} such that 1 is a maximal element. St000578The number of occurrences of the pattern {{1},{2}} such that 1 is a singleton. St000579The number of occurrences of the pattern {{1},{2}} such that 2 is a maximal element. St000693The modular (standard) major index of a standard tableau. St000792The Grundy value for the game of ruler on a binary word. St000874The position of the last double rise in a Dyck path. St000932The number of occurrences of the pattern UDU in a Dyck path. St000946The sum of the skew hook positions in a Dyck path. St001281The normalized isoperimetric number of a graph. St001721The degree of a binary word. St001926Sparre Andersen's position of the maximum of a signed permutation. St001927Sparre Andersen's number of positives of a signed permutation. St000082The number of elements smaller than a binary tree in Tamari order. St000420The number of Dyck paths that are weakly above a Dyck path. St000455The second largest eigenvalue of a graph if it is integral. St000717The number of ordinal summands of a poset. 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. St000898The number of maximal entries in the last diagonal of the monotone triangle. St000906The length of the shortest maximal chain in a poset. St000910The number of maximal chains of minimal length in a poset. St000914The sum of the values of the Möbius function of a poset. St001365The number of lattice paths of the same length weakly above the path given by a binary word. St001500The global dimension of magnitude 1 Nakayama algebras. St001621The number of atoms of a lattice. St001624The breadth of a lattice. St001808The box weight or horizontal decoration of a Dyck path. St000643The size of the largest orbit of antichains under Panyushev complementation. St001626The number of maximal proper sublattices of a lattice. St000466The Gutman (or modified Schultz) index of a connected graph. St001498The normalised height of a Nakayama algebra with magnitude 1. St001877Number of indecomposable injective modules with projective dimension 2. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. 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. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001199The dominant dimension of

$eAe$ for the corresponding Nakayama algebra

$A$ with minimal faithful projective-injective module

$eA$ . 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. St001378The product of the cohook lengths of the integer 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. St001593This is the number of standard Young tableaux of the given shifted shape. St001600The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple graphs. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001607The number of coloured graphs such that the multiplicities of colours are given by a partition. St001608The number of coloured rooted trees such that the multiplicities of colours are given by a partition. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001933The largest multiplicity of a part in an integer 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. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000038The product of the heights of the descending steps of a Dyck path. St000048The multinomial of the parts of a partition. St000088The row sums of the character table of the symmetric group. St000100The number of linear extensions of a poset. St000179The product of the hook lengths of the integer partition. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000212The number of standard Young tableaux for an integer partition such that no two consecutive entries appear in the same row. St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. St000296The length of the symmetric border of a binary word. St000418The number of Dyck paths that are weakly below a Dyck path. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000511The number of invariant subsets when acting with a permutation of given cycle type. St000549The number of odd partial sums of an integer partition. St000567The sum of the products of all pairs of parts. St000618The number of self-evacuating tableaux of given shape. St000627The exponent of a binary word. St000631The number of distinct palindromic decompositions of a binary word. St000633The size of the automorphism group of a poset. St000640The rank of the largest boolean interval in a poset. St000644The number of graphs with given frequency partition. St000655The length of the minimal rise of a Dyck path. St000667The greatest common divisor of the parts of the partition. St000681The Grundy value of Chomp on Ferrers diagrams. St000699The toughness times the least common multiple of 1,. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000759The smallest missing part in an integer partition. St000811The sum of the entries in the column specified by the partition of the change of basis matrix from powersum symmetric functions to Schur symmetric functions. St000812The sum of the entries in the column specified by the partition of the change of basis matrix from complete homogeneous symmetric functions to monomial symmetric functions. St000814The sum of the entries in the column specified by the partition of the change of basis matrix from elementary symmetric functions to Schur symmetric functions. St000878The number of ones minus the number of zeros of a binary word. St000922The minimal number such that all substrings of this length are unique. St000929The constant term of the character polynomial of an integer partition. St000952Gives the number of irreducible factors of the Coxeter polynomial of the Dyck path over the rational numbers. St000955Number of times one has

$Ext^i(D(A),A)>0$ for

$i>0$ for the corresponding LNakayama algebra. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001008Number of indecomposable injective modules with projective dimension 1 in 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. St001019Sum of the projective dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. 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. St001126Number of simple module that are 1-regular 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. 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$ . 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. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001283The number of finite solvable groups that are realised by the given partition over the complex numbers. St001284The number of finite groups that are realised by the given partition over the complex numbers. 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. St001387Number of standard Young tableaux of the skew shape tracing the border of the given partition. St001432The order dimension of the partition. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001484The number of singletons of an integer partition. St001488The number of corners of a skew partition. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001527The cyclic permutation representation number of an integer partition. St001531Number of partial orders contained in the poset determined by the Dyck path. St001541The Gini index of an integer partition. St001561The value of the elementary symmetric function evaluated at 1. St001570The minimal number of edges to add to make a graph Hamiltonian. St001571The Cartan determinant of the integer partition. St001587Half of the largest even part of an integer partition. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001632The number of indecomposable injective modules

$I$ with

$dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001657The number of twos in an integer partition. St001710The number of permutations such that conjugation with a permutation of given cycle type yields the inverse permutation. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001732The number of peaks visible from the left. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. 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. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001932The number of pairs of singleton blocks in the noncrossing set partition corresponding to a Dyck path, that can be merged to create another noncrossing set partition. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St001961The sum of the greatest common divisors of all pairs of parts. 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$ . St000112The sum of the entries reduced by the index of their row in a semistandard tableau. St000145The Dyson rank of a partition. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000225Difference between largest and smallest parts in a partition. St000456The monochromatic index of a connected graph. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000706The product of the factorials of the multiplicities of an integer partition. St000707The product of the factorials of the parts. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000749The smallest integer d such that the restriction of the representation corresponding to a partition of n to the symmetric group on n-d letters has a constituent of odd degree. St000781The number of proper colouring schemes of a Ferrers diagram. St000944The 3-degree of an integer partition. St000993The multiplicity of the largest part of an integer partition. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St001128The exponens consonantiae of a partition. St001177Twice the mean value of the major index among all standard Young tableaux of a partition. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001568The smallest positive integer that does not appear twice in the partition. St001586The number of odd parts smaller than the largest even part in an integer partition. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001602The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on endofunctions. St001627The number of coloured connected graphs such that the multiplicities of colours are given by a partition. St001651The Frankl number of a lattice. St001763The Hurwitz number of an integer partition. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001924The number of cells in an integer partition whose arm and leg length coincide. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001938The number of transitive monotone factorizations of genus zero of a permutation of given cycle type. St000736The last entry in the first row of a semistandard tableau.