Loading [MathJax]/jax/output/HTML-CSS/jax.js

Your data matches 965 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
St001019: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> 1 = 0 + 1
[1,0,1,0]
=> 3 = 2 + 1
[1,1,0,0]
=> 2 = 1 + 1
Description
Sum of the projective dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path.
St001228: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> 1 = 0 + 1
[1,0,1,0]
=> 2 = 1 + 1
[1,1,0,0]
=> 3 = 2 + 1
Description
The vector space dimension of the space of module homomorphisms between J and itself when J denotes the Jacobson radical of the corresponding Nakayama algebra.
Matching statistic: St001242
St001242: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> 1 = 0 + 1
[1,0,1,0]
=> 2 = 1 + 1
[1,1,0,0]
=> 3 = 2 + 1
Description
The toal dimension of certain Sn modules determined by LLT polynomials associated with a Dyck path. Given a Dyck path, there is an associated (directed) unit interval graph $\Gamma$. Consider the expansion $$G_\Gamma(x;q) = \sum_{\kappa: V(G) \to \mathbb{N}_+} x_\kappa q^{\mathrm{asc}(\kappa)}$$ using the notation by Alexandersson and Panova. The function $G_\Gamma(x;q)$ is a so called unicellular LLT polynomial, and a symmetric function. Consider the Schur expansion $$G_\Gamma(x;q+1) = \sum_{\lambda} c^\Gamma_\lambda(q) s_\lambda(x).$$ By a result by Haiman and Grojnowski, all $c^\Gamma_\lambda(q)$ have non-negative integer coefficients. Thus, $G_\Gamma(x;q+1)$ is the Frobenius image of some (graded) $S_n$-module. The total dimension of this $S_n$-module is $$D_\Gamma = \sum_{\lambda} c^\Gamma_\lambda(1)f^\lambda$$ where $f^\lambda$ is the number of standard Young tableaux of shape $\lambda$. This statistic is $D_\Gamma$.
Matching statistic: St001243
St001243: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> 1 = 0 + 1
[1,0,1,0]
=> 2 = 1 + 1
[1,1,0,0]
=> 3 = 2 + 1
Description
The sum of coefficients in the Schur basis of certain LLT polynomials associated with a Dyck path. In other words, given a Dyck path, there is an associated (directed) unit interval graph $\Gamma$. Consider the expansion $$G_\Gamma(x;q) = \sum_{\kappa: V(G) \to \mathbb{N}_+} x_\kappa q^{\mathrm{asc}(\kappa)}$$ using the notation by Alexandersson and Panova. The function $G_\Gamma(x;q)$ is a so called unicellular LLT polynomial, and a symmetric function. Consider the Schur expansion $$G_\Gamma(x;q+1) = \sum_{\lambda} c^\Gamma_\lambda(q) s_\lambda(x).$$ By a result by Haiman and Grojnowski, all $c^\Gamma_\lambda(q)$ have non-negative integer coefficients. Consider the sum $$S_\Gamma = \sum_{\lambda} c^\Gamma_\lambda(1).$$ This statistic is $S_\Gamma$. It is still an open problem to find a combinatorial description of the above Schur expansion, a first step would be to find a family of combinatorial objects to sum over.
St001254: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> 1 = 0 + 1
[1,0,1,0]
=> 2 = 1 + 1
[1,1,0,0]
=> 3 = 2 + 1
Description
The vector space dimension of the first extension-group between A/soc(A) and J when A is the corresponding Nakayama algebra with Jacobson radical J.
St001213: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> 2 = 0 + 2
[1,0,1,0]
=> 4 = 2 + 2
[1,1,0,0]
=> 3 = 1 + 2
Description
The number of indecomposable modules in the corresponding Nakayama algebra that have vanishing first Ext-group with the regular module.
St001259: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> 2 = 0 + 2
[1,0,1,0]
=> 4 = 2 + 2
[1,1,0,0]
=> 3 = 1 + 2
Description
The vector space dimension of the double dual of D(A) in the corresponding Nakayama algebra.
Mp00201: Dyck paths RingelPermutations
St000304: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [2,1] => 0
[1,0,1,0]
=> [3,1,2] => 2
[1,1,0,0]
=> [2,3,1] => 1
Description
The load of a permutation. The definition of the load of a finite word in a totally ordered alphabet can be found in [1], for permutations, it is given by the major index [[St000004]] of the reverse [[Mp00064]] of the inverse [[Mp00066]] permutation.
Mp00201: Dyck paths RingelPermutations
St000472: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [2,1] => 0
[1,0,1,0]
=> [3,1,2] => 1
[1,1,0,0]
=> [2,3,1] => 2
Description
The sum of the ascent bottoms of a permutation.
Matching statistic: St000793
Mp00138: Dyck paths to noncrossing partitionSet partitions
St000793: Set partitions ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> {{1}}
=> 0
[1,0,1,0]
=> {{1},{2}}
=> 2
[1,1,0,0]
=> {{1,2}}
=> 1
Description
The length of the longest partition in the vacillating tableau corresponding to a set partition. To a set partition $\pi$ of $\{1,\dots,r\}$ with at most $n$ blocks we associate a vacillating tableau, following [1], as follows: create a triangular growth diagram by labelling the columns of a triangular grid with row lengths $r-1, \dots, 0$ from left to right $1$ to $r$, and the rows from the shortest to the longest $1$ to $r$. For each arc $(i,j)$ in the standard representation of $\pi$, place a cross into the cell in column $i$ and row $j$. Next we label the corners of the first column beginning with the corners of the shortest row. The first corner is labelled with the partition $(n)$. If there is a cross in the row separating this corner from the next, label the next corner with the same partition, otherwise with the partition smaller by one. Do the same with the corners of the first row. Finally, apply Fomin's local rules, to obtain the partitions along the diagonal. These will alternate in size between $n$ and $n-1$. This statistic is the length of the longest partition on the diagonal of the diagram.
The following 955 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000961The shifted major index of a permutation. St001104The number of descents of the invariant in a tensor power of the adjoint representation of the rank two general linear group. St001424The number of distinct squares in a binary word. St000012The area of a Dyck path. St000224The sorting index of a permutation. St000231Sum of the maximal elements of the blocks of a set partition. St000280The size of the preimage of the map 'to labelling permutation' from Parking functions to Permutations. St000400The path length of an ordered tree. St000507The number of ascents of a standard tableau. St000519The largest length of a factor maximising the subword complexity. St000727The largest label of a leaf in the binary search tree associated with the permutation. St000734The last entry in the first row of a standard tableau. St000795The mad of a permutation. St000841The largest opener of a perfect matching. St000922The minimal number such that all substrings of this length are unique. St000984The number of boxes below precisely one peak. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. 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. St001419The length of the longest palindromic factor beginning with a one of a binary word. St001671Haglund's hag of a permutation. St001815The number of order preserving surjections from a poset to a total order. St000070The number of antichains in a poset. St000104The number of facets in the order polytope of this poset. St000151The number of facets in the chain polytope of the poset. St000180The number of chains of a poset. St000393The number of strictly increasing runs in a binary word. St000395The sum of the heights of the peaks of a Dyck path. St000438The position of the last up step in a Dyck path. St000625The sum of the minimal distances to a greater element. St001018Sum of projective dimension of the indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001034The area of the parallelogram polyomino associated with the Dyck path. St001267The length of the Lyndon factorization of the binary word. St001379The number of inversions plus the major index of a permutation. St001959The product of the heights of the peaks of a Dyck path. St001218Smallest index k greater than or equal to one such that the Coxeter matrix C of the corresponding Nakayama algebra has C^k=1. St000004The major index of a permutation. St000009The charge of a standard tableau. St000018The number of inversions of a permutation. St000019The cardinality of the support of a permutation. St000029The depth of a permutation. St000030The sum of the descent differences of a permutations. St000039The number of crossings of a permutation. St000074The number of special entries. St000133The "bounce" of a permutation. St000141The maximum drop size of a permutation. St000154The sum of the descent bottoms of a permutation. St000156The Denert index of a permutation. St000157The number of descents of a standard tableau. St000209Maximum difference of elements in cycles. St000216The absolute length of a permutation. St000217The number of occurrences of the pattern 312 in a permutation. St000222The number of alignments in the permutation. St000246The number of non-inversions of a permutation. St000253The crossing number of a set partition. St000290The major index of a binary word. St000293The number of inversions of a binary word. St000295The length of the border of a binary word. St000305The inverse major index of a permutation. St000316The number of non-left-to-right-maxima of a permutation. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000334The maz index, the major index of a permutation after replacing fixed points by zeros. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000340The number of non-final maximal constant sub-paths of length greater than one. St000359The number of occurrences of the pattern 23-1. St000374The number of exclusive right-to-left minima of a permutation. St000427The number of occurrences of the pattern 123 or of the pattern 231 in a permutation. St000429The number of occurrences of the pattern 123 or of the pattern 321 in a permutation. St000430The number of occurrences of the pattern 123 or of the pattern 312 in a permutation. St000436The number of occurrences of the pattern 231 or of the pattern 321 in a permutation. St000437The number of occurrences of the pattern 312 or of the pattern 321 in a permutation. St000446The disorder of a permutation. St000462The major index minus the number of excedences of a permutation. St000463The number of admissible inversions of a permutation. St000483The number of times a permutation switches from increasing to decreasing or decreasing to increasing. St000484The sum of St000483 over all subsequences of length at least three. St000490The intertwining number of a set partition. St000492The rob statistic of a set partition. St000494The number of inversions of distance at most 3 of a permutation. St000495The number of inversions of distance at most 2 of a permutation. St000499The rcb statistic of a set partition. St000503The maximal difference between two elements in a common block. St000554The number of occurrences of the pattern {{1,2},{3}} in a set partition. St000556The number of occurrences of the pattern {{1},{2,3}} in 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. St000586The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal. St000597The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, (2,3) are consecutive in a block. St000599The number of occurrences of the pattern {{1},{2,3}} such that (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. St000607The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, 3 is maximal, (2,3) are consecutive in a block. St000648The number of 2-excedences of a permutation. St000651The maximal size of a rise in a permutation. St000653The last descent of a permutation. St000670The reversal length of a permutation. St000682The Grundy value of Welter's game on a binary word. St000691The number of changes of a binary word. St000692Babson and Steingrímsson's statistic of a permutation. St000703The number of deficiencies of a permutation. St000710The number of big deficiencies of a permutation. St000711The number of big exceedences of a permutation. St000730The maximal arc length of a set partition. St000742The number of big ascents of a permutation after prepending zero. St000747A variant of the major index of a set partition. St000792The Grundy value for the game of ruler on a binary word. St000794The mak of a permutation. St000796The stat' of a permutation. St000797The stat`` of a permutation. St000798The makl of a permutation. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000809The reduced reflection length of the permutation. St000831The number of indices that are either descents or recoils. St000833The comajor index of a permutation. St000866The number of admissible inversions of a permutation in the sense of Shareshian-Wachs. St000868The aid statistic in the sense of Shareshian-Wachs. St000881The number of short braid edges in the graph of braid moves of a permutation. St000921The number of internal inversions of a binary word. St000956The maximal displacement of a permutation. St000957The number of Bruhat lower covers of a permutation. St001076The minimal length of a factorization of a permutation into transpositions that are cyclic shifts of (12). St001078The minimal number of occurrences of (12) in a factorization of a permutation into transpositions (12) and cycles (1,. St001079The minimal length of a factorization of a permutation using the permutations (12)(34). St001080The minimal length of a factorization of a permutation using the transposition (12) and the cycle (1,. St001090The number of pop-stack-sorts needed to sort a permutation. St001160The number of proper blocks (or intervals) of a permutations. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module 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)$. St001209The pmaj statistic of a parking function. St001298The number of repeated entries in the Lehmer code of a permutation. St001391The disjunction number of a graph. St001402The number of separators in a permutation. St001413Half the length of the longest even length palindromic prefix of a binary word. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001485The modular major index of a binary word. St001511The minimal number of transpositions needed to sort a permutation in either direction. St001524The degree of symmetry of a binary word. St001535The number of cyclic alignments of a permutation. St001558The number of transpositions that are smaller or equal to a permutation in Bruhat order. St001579The number of cyclically simple transpositions decreasing the number of cyclic descents needed to sort a permutation. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. St001623The number of doubly irreducible elements of a lattice. St001684The reduced word complexity of a permutation. St001721The degree of a binary word. St001759The Rajchgot index of a permutation. St001760The number of prefix or suffix reversals needed to sort a permutation. St001930The weak major index of a binary word. St001931The weak major index of an integer composition regarded as a word. St001956The comajor index for set-valued two-row standard Young tableaux. St001960The number of descents of a permutation minus one if its first entry is not one. St000005The bounce statistic of a Dyck path. St000006The dinv of a Dyck path. St000020The rank of the permutation. St000021The number of descents of a permutation. St000041The number of nestings of a perfect matching. St000047The number of standard immaculate tableaux of a given shape. St000057The Shynar inversion number of a standard tableau. St000058The order of a permutation. St000060The greater neighbor of the maximum. St000067The inversion number of the alternating sign matrix. St000076The rank of the alternating sign matrix in the alternating sign matrix poset. St000077The number of boxed and circled entries. St000110The number of permutations less than or equal to a permutation in left weak order. St000161The sum of the sizes of the right subtrees of a binary tree. St000187The determinant of an alternating sign matrix. St000210Minimum over maximum difference of elements in cycles. St000214The number of adjacencies of a permutation. St000238The number of indices that are not small weak excedances. St000240The number of indices that are not small excedances. St000288The number of ones in a binary word. St000289The decimal representation of a binary word. St000326The position of the first one in a binary word after appending a 1 at the end. St000354The number of recoils of a permutation. St000398The sum of the depths of the vertices (or total internal path length) of a binary tree. St000432The number of occurrences of the pattern 231 or of the pattern 312 in a permutation. St000451The length of the longest pattern of the form k 1 2. St000485The length of the longest cycle of a permutation. St000505The biggest entry in the block containing the 1. St000539The number of odd inversions of a permutation. St000579The number of occurrences of the pattern {{1},{2}} such that 2 is a maximal element. St000619The number of cyclic descents of a permutation. St000638The number of up-down runs of a permutation. St000675The number of centered multitunnels of a Dyck path. St000676The number of odd rises of a Dyck path. St000677The standardized bi-alternating inversion number of a permutation. St000690The size of the conjugacy class of a permutation. St000738The first entry in the last row of a standard tableau. St000740The last entry of a permutation. St000744The length of the path to the largest entry in a standard Young tableau. 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. St000816The number of standard composition tableaux of the composition. St000829The Ulam distance of a permutation to the identity permutation. St000839The largest opener of a set partition. St000844The size of the largest block in the direct sum decomposition of a permutation. St000847The number of standard Young tableaux whose descent set is the binary word. St000849The number of 1/3-balanced pairs in a poset. St000867The sum of the hook lengths in the first row of an integer partition. St000874The position of the last double rise in a Dyck path. St000880The number of connected components of long braid edges in the graph of braid moves of a permutation. St000947The major index east count of a Dyck path. St000952Gives the number of irreducible factors of the Coxeter polynomial of the Dyck path over the rational numbers. St000971The smallest closer of a set partition. St000983The length of the longest alternating subword. St001030Half the number of non-boundary horizontal edges in the fully packed loop corresponding to the alternating sign matrix. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001052The length of the exterior of a permutation. St001061The number of indices that are both descents and recoils of a permutation. St001077The prefix exchange distance of a permutation. St001096The size of the overlap set of a permutation. St001161The major index north count of a Dyck path. St001220The width of a permutation. St001245The cyclic maximal difference between two consecutive entries of a permutation. St001246The maximal difference between two consecutive entries of a permutation. St001285The number of primes in the column sums of the two line notation of a permutation. St001300The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset. St001313The number of Dyck paths above the lattice path given by a binary word. St001346The number of parking functions that give the same permutation. St001365The number of lattice paths of the same length weakly above the path given by a binary word. St001372The length of a longest cyclic run of ones of a binary word. St001375The pancake length of a permutation. St001397Number of pairs of incomparable elements in a finite poset. St001405The number of bonds in a permutation. St001437The flex of a binary word. St001439The number of even weak deficiencies and of odd weak exceedences. St001441The number of non-empty connected induced subgraphs of a graph. St001464The number of bases of the positroid corresponding to the permutation, with all fixed points counterclockwise. St001489The maximum of the number of descents and the number of inverse descents. St001497The position of the largest weak excedence of a permutation. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001528The number of permutations such that the product with the permutation has the same number of fixed points. St001533The largest coefficient of the Poincare polynomial of the poset cone. St001625The Möbius invariant of a lattice. St001726The number of visible inversions of a permutation. St001784The minimum of the smallest closer and the second element of the block containing 1 in a set partition. St001806The upper middle entry of a permutation. St001807The lower middle entry of a permutation. St001821The sorting index of a signed permutation. St001874Lusztig's a-function for the symmetric group. St001915The size of the component corresponding to a necklace in Bulgarian solitaire. St000064The number of one-box pattern of a permutation. St000189The number of elements in the poset. St000197The number of entries equal to positive one in the alternating sign matrix. St000229Sum of the difference between the maximal and the minimal elements of the blocks plus the number of blocks of a set partition. St000294The number of distinct factors of a binary word. St000300The number of independent sets of vertices of a graph. St000301The number of facets of the stable set polytope of a graph. St000325The width of the tree associated to a permutation. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000470The number of runs in a permutation. St000518The number of distinct subsequences in a binary word. St000550The number of modular elements of a lattice. St000551The number of left modular elements of a lattice. St000626The minimal period of a binary word. St000631The number of distinct palindromic decompositions of a binary word. St000639The number of relations in a poset. St000641The number of non-empty boolean intervals in a poset. St000656The number of cuts of a poset. St000825The sum of the major and the inverse major index of a permutation. St000863The length of the first row of the shifted shape of a permutation. St000876The number of factors in the Catalan decomposition of a binary word. St000923The minimal number with no two order isomorphic substrings of this length in a permutation. St001004The number of indices that are either left-to-right maxima or right-to-left minima. St001005The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both. St001180Number of indecomposable injective modules with projective dimension at most 1. St001211The number of simple modules in the corresponding Nakayama algebra that have vanishing second Ext-group with the regular module. St001287The number of primes obtained by multiplying preimage and image of a permutation and subtracting one. St001348The bounce of the parallelogram polyomino associated with the Dyck path. St001462The number of factors of a standard tableaux under concatenation. St001486The number of corners of the ribbon associated with an integer composition. 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. St001500The global dimension of magnitude 1 Nakayama algebras. St001501The dominant dimension of magnitude 1 Nakayama algebras. 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. St001614The cyclic permutation representation number of a skew partition. St001616The number of neutral elements in a lattice. St001717The largest size of an interval in a poset. St001800The number of 3-Catalan paths having this Dyck path as first and last coordinate projections. St001808The box weight or horizontal decoration of a Dyck path. St001809The index of the step at the first peak of maximal height in a Dyck path. St001834The number of non-isomorphic minors of a graph. St001929The number of meanders with top half given by the noncrossing matching corresponding to the Dyck path. St000520The number of patterns in a permutation. St000806The semiperimeter of the associated bargraph. St001065Number of indecomposable reflexive modules in the corresponding Nakayama algebra. St001619The number of non-isomorphic sublattices of a lattice. St001643The Frobenius dimension of the Nakayama algebra corresponding to the Dyck path. St001664The number of non-isomorphic subposets of a poset. St001666The number of non-isomorphic subposets of a lattice which are lattices. St001003The number of indecomposable modules with projective dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St000008The major index of the composition. St000022The number of fixed points 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. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St000035The number of left outer peaks of a permutation. St000043The number of crossings plus two-nestings of a perfect matching. St000053The number of valleys of the Dyck path. St000059The inversion number of a standard tableau as defined by Haglund and Stevens. St000081The number of edges of a graph. St000083The number of left oriented leafs of a binary tree except the first one. St000089The absolute variation of a composition. St000091The descent variation of a composition. St000112The sum of the entries reduced by the index of their row in a semistandard tableau. St000119The number of occurrences of the pattern 321 in a permutation. St000120The number of left tunnels of a Dyck path. St000123The difference in Coxeter length of a permutation and its image under the Simion-Schmidt map. St000136The dinv of a parking function. St000137The Grundy value of an integer partition. St000142The number of even parts of a partition. St000143The largest repeated part of a partition. St000155The number of exceedances (also excedences) of a permutation. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000169The cocharge of a standard tableau. St000171The degree of the graph. St000174The flush statistic of a semistandard tableau. St000177The number of free tiles in the pattern. St000185The weighted size of a partition. St000194The number of primary dinversion pairs of a labelled dyck path corresponding to a parking function. St000204The number of internal nodes of a binary tree. St000211The rank of the set partition. St000218The number of occurrences of the pattern 213 in a permutation. St000219The number of occurrences of the pattern 231 in a permutation. St000220The number of occurrences of the pattern 132 in a permutation. St000223The number of nestings in the permutation. St000234The number of global ascents of a permutation. St000237The number of small exceedances. St000241The number of cyclical small excedances. St000242The number of indices that are not cyclical small weak excedances. St000245The number of ascents of a permutation. St000251The number of nonsingleton blocks of a set partition. St000254The nesting number of a set partition. St000271The chromatic index of a graph. St000291The number of descents of a binary word. St000292The number of ascents of a binary word. St000297The number of leading ones in a binary word. St000306The bounce count of a Dyck path. St000313The number of degree 2 vertices of a graph. St000317The cycle descent number of a permutation. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000327The number of cover relations in a poset. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000330The (standard) major index of a standard tableau. St000331The number of upper interactions of a Dyck path. St000332The positive inversions of an alternating sign matrix. St000338The number of pixed points of a permutation. St000339The maf index of a permutation. St000352The Elizalde-Pak rank of a permutation. St000355The number of occurrences of the pattern 21-3. St000356The number of occurrences of the pattern 13-2. St000357The number of occurrences of the pattern 12-3. St000358The number of occurrences of the pattern 31-2. St000360The number of occurrences of the pattern 32-1. St000365The number of double ascents of a permutation. St000366The number of double descents of a permutation. St000367The number of simsun double descents of a permutation. 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. St000376The bounce deficit of a Dyck path. St000377The dinv defect of an integer partition. St000389The number of runs of ones of odd length in a binary word. St000390The number of runs of ones in a binary word. St000391The sum of the positions of the ones in a binary word. St000392The length of the longest run of ones in a binary word. St000419The number of Dyck paths that are weakly above the Dyck path, except for the path itself. St000423The number of occurrences of the pattern 123 or of the pattern 132 in a permutation. St000424The number of occurrences of the pattern 132 or of the pattern 231 in a permutation. St000425The number of occurrences of the pattern 132 or of the pattern 213 in a permutation. St000426The number of occurrences of the pattern 132 or of the pattern 312 in a permutation. St000428The number of occurrences of the pattern 123 or of the pattern 213 in a permutation. St000431The number of occurrences of the pattern 213 or of the pattern 321 in a permutation. St000433The number of occurrences of the pattern 132 or of the pattern 321 in a permutation. St000434The number of occurrences of the pattern 213 or of the pattern 312 in a permutation. St000435The number of occurrences of the pattern 213 or of the pattern 231 in a permutation. St000441The number of successions of a permutation. St000442The maximal area to the right of an up step of a Dyck path. St000448The number of pairs of vertices of a graph with distance 2. St000461The rix statistic of a permutation. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000491The number of inversions of a set partition. St000493The los statistic of a set partition. St000496The rcs statistic of a set partition. St000497The lcb statistic of a set partition. St000498The lcs statistic of a set partition. St000502The number of successions of a set partitions. St000534The number of 2-rises of a permutation. St000537The cutwidth of a graph. St000538The number of even 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. St000546The number of global descents of a permutation. St000549The number of odd partial sums of an integer partition. St000555The number of occurrences of the pattern {{1,3},{2}} in a set partition. St000565The major index of a set partition. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000572The dimension exponent of a set partition. St000578The number of occurrences of the pattern {{1},{2}} such that 1 is a singleton. St000580The number of occurrences of the pattern {{1},{2},{3}} such that 2 is minimal, 3 is maximal. St000581The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 2 is maximal. St000582The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 3 is maximal, (1,3) are consecutive in a block. St000591The number of occurrences of the pattern {{1},{2},{3}} such that 2 is maximal. St000592The number of occurrences of the pattern {{1},{2},{3}} such that 1 is maximal. St000593The number of occurrences of the pattern {{1},{2},{3}} such that 1,2 are minimal. St000600The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, (1,3) are consecutive in a block. St000602The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal. St000608The number of occurrences of the pattern {{1},{2},{3}} such that 1,2 are minimal, 3 is maximal. St000610The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal. St000615The number of occurrences of the pattern {{1},{2},{3}} such that 1,3 are maximal. St000618The number of self-evacuating tableaux of given shape. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000628The balance of a binary word. St000645The sum of the areas of the rectangles formed by two consecutive peaks and the valley in between. St000646The number of big ascents of a permutation. St000647The number of big descents of a permutation. St000658The number of rises of length 2 of a Dyck path. St000659The number of rises of length at least 2 of a Dyck path. St000662The staircase size of the code of a permutation. St000663The number of right floats of a permutation. St000672The number of minimal elements in Bruhat order not less than the permutation. St000680The Grundy value for Hackendot on posets. St000683The number of points below the Dyck path such that the diagonal to the north-east hits the path between two down steps, and the diagonal to the north-west hits the path between two up steps. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000693The modular (standard) major index of a standard tableau. St000728The dimension of a set partition. St000732The number of double deficiencies of a permutation. St000752The Grundy value for the game 'Couples are forever' on an integer partition. St000753The Grundy value for the game of Kayles on a binary word. St000766The number of inversions of an integer composition. St000769The major index of a composition regarded as a word. St000799The number of occurrences of the vincular pattern |213 in a permutation. St000801The number of occurrences of the vincular pattern |312 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000803The number of occurrences of the vincular pattern |132 in a permutation. 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. St000834The number of right outer peaks of a permutation. St000836The number of descents of distance 2 of a permutation. St000837The number of ascents of distance 2 of a permutation. St000845The maximal number of elements covered by an element in a poset. St000846The maximal number of elements covering an element of a poset. St000864The number of circled entries of the shifted recording tableau of a permutation. St000872The number of very big descents of a permutation. St000873The aix statistic of a permutation. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St000877The depth of the binary word interpreted as a path. St000879The number of long braid edges in the graph of braid moves of a permutation. St000884The number of isolated descents of a permutation. St000932The number of occurrences of the pattern UDU in a Dyck path. St000934The 2-degree of an integer partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St000940The number of characters of the symmetric group whose value on the partition is zero. St000941The number of characters of the symmetric group whose value on the partition is even. St000946The sum of the skew hook positions in a Dyck path. St000954Number of times the corresponding LNakayama algebra has $Ext^i(D(A),A)=0$ for $i>0$. St000963The 2-shifted major index of a permutation. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St000989The number of final rises of a permutation. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St000996The number of exclusive left-to-right maxima 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. 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. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001057The Grundy value of the game of creating an independent set in a graph. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001082The number of boxed occurrences of 123 in a permutation. St001083The number of boxed occurrences of 132 in a permutation. St001084The number of occurrences of the vincular pattern |1-23 in a permutation. St001087The number of occurrences of the vincular pattern |12-3 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. St001094The depth index of a set partition. St001114The number of odd descents of a permutation. St001117The game chromatic index of a graph. St001120The length of a longest path in a graph. St001139The number of occurrences of hills of size 2 in a Dyck path. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001152The number of pairs with even minimum in a perfect matching. St001153The number of blocks with even minimum in a set partition. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001176The size of a partition minus its first part. St001185The number of indecomposable injective modules of grade at least 2 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. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. 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$. St001214The aft of an integer partition. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. 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. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical 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. 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. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001251The number of parts of a partition that are not congruent 1 modulo 3. 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. St001270The bandwidth of a graph. St001273The projective dimension of the first term in an injective coresolution of the regular module. St001274The number of indecomposable injective modules with projective dimension equal to two. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001280The number of parts of an integer partition that are at least two. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001308The number of induced paths on three vertices in a graph. St001319The minimal number of occurrences of the star-pattern in a linear ordering of the vertices of the graph. St001320The minimal number of occurrences of the path-pattern in a linear ordering of the vertices of the graph. St001323The independence gap of a graph. St001332The number of steps on the non-negative side of the walk associated with the permutation. St001350Half of the Albertson index of a graph. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001377The major index minus the number of inversions of a permutation. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. St001388The number of non-attacking neighbors of a permutation. St001403The number of vertical separators in a permutation. St001411The number of patterns 321 or 3412 in a permutation. St001414Half the length of the longest odd length 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. 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. St001423The number of distinct cubes in a binary word. St001428The number of B-inversions of a signed permutation. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001459The number of zero columns in the nullspace of a graph. St001479The number of bridges of a graph. St001480The number of simple summands of the module J^2/J^3. St001484The number of singletons of an integer partition. St001502The global dimension minus the dominant dimension of magnitude 1 Nakayama algebras. 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. St001510The number of self-evacuating linear extensions of a finite poset. St001512The minimum rank of a graph. St001541The Gini index of an integer partition. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001557The number of inversions of the second entry of a permutation. St001565The number of arithmetic progressions of length 2 in a permutation. St001569The maximal modular displacement of a permutation. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. 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. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001639The number of alternating subsets such that applying the permutation does not yield an alternating subset. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001644The dimension of a graph. St001647The number of edges that can be added without increasing the clique number. St001648The number of edges that can be added without increasing the chromatic number. St001649The length of a longest trail in a graph. St001651The Frankl number of a lattice. St001657The number of twos in an integer partition. St001665The number of pure excedances of a permutation. St001668The number of points of the poset minus the width of the poset. St001669The number of single rises in a Dyck path. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St001691The number of kings in a graph. St001692The number of vertices with higher degree than the average degree in a graph. St001693The excess length of a longest path consisting of elements and blocks of a set partition. St001695The natural comajor index of a standard Young tableau. St001697The shifted natural comajor index of a standard Young tableau. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001727The number of invisible inversions of a permutation. St001729The number of visible descents of a permutation. St001737The number of descents of type 2 in a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001745The number of occurrences of the arrow pattern 13 with an arrow from 1 to 2 in a permutation. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St001769The reflection length of 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. St001798The difference of the number of edges in a graph and the number of edges in the complement of the Turán graph. 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. St001811The Castelnuovo-Mumford regularity of a permutation. St001822The number of alignments of a signed permutation. St001826The maximal number of leaves on a vertex of a graph. St001836The number of occurrences of a 213 pattern in the restricted growth word of a perfect matching. St001841The number of inversions of a set partition. St001842The major index of a set partition. St001843The Z-index of a set partition. St001845The number of join irreducibles minus the rank of a lattice. St001856The number of edges in the reduced word graph of a permutation. St001859The number of factors of the Stanley symmetric function associated with a permutation. St001860The number of factors of the Stanley symmetric function associated with a signed permutation. St001861The number of Bruhat lower covers of a permutation. St001862The number of crossings of a signed permutation. St001869The maximum cut size of a graph. St001873For a Nakayama algebra corresponding to a Dyck path, we define the matrix C with entries the Hom-spaces between $e_i J$ and $e_j J$ (the radical of the indecomposable projective modules). St001894The depth of a signed permutation. St001905The number of preferred parking spots in a parking function less than the index of the car. St001910The height of the middle non-run of a Dyck path. St001911A descent variant minus the number of inversions. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001928The number of non-overlapping descents in a permutation. St001939The number of parts that are equal to their multiplicity in the integer partition. St001948The number of augmented double ascents of a permutation. St001955The number of natural descents for set-valued two row standard Young tableaux. St001958The degree of the polynomial interpolating the values of a permutation. St001961The sum of the greatest common divisors of all pairs of parts. St001962The proper pathwidth of a graph. St000001The number of reduced words for a permutation. St000003The number of standard Young tableaux of the partition. 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. St000025The number of initial rises of a Dyck path. St000026The position of the first return of a Dyck path. St000031The number of cycles in the cycle decomposition of a permutation. St000032The number of elements smaller than the given Dyck path in the Tamari Order. St000042The number of crossings of a perfect matching. St000048The multinomial of the parts of a partition. St000054The first entry of the permutation. St000055The inversion sum of a permutation. St000056The decomposition (or block) number of a permutation. St000062The length of the longest increasing subsequence of the permutation. St000066The column of the unique '1' in the first row of the alternating sign matrix. St000075The orbit size of a standard tableau under promotion. St000078The number of alternating sign matrices whose left key is the permutation. St000082The number of elements smaller than a binary tree in Tamari order. St000085The number of linear extensions of the tree. St000086The number of subgraphs. St000093The cardinality of a maximal independent set of vertices of a graph. St000100The number of linear extensions of a poset. St000105The number of blocks in the set partition. St000146The Andrews-Garvan crank of a partition. St000147The largest part of an integer partition. St000153The number of adjacent cycles of a permutation. St000173The segment statistic of a semistandard tableau. St000179The product of the hook lengths of the integer partition. St000182The number of permutations whose cycle type is the given integer partition. 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. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000213The number of weak exceedances (also weak excedences) of a permutation. St000228The size of a partition. St000233The number of nestings of a set partition. St000239The number of small weak excedances. St000255The number of reduced Kogan faces with the permutation as type. St000259The diameter of a connected graph. St000299The number of nonisomorphic vertex-induced subtrees. St000308The height of the tree associated to a permutation. St000314The number of left-to-right-maxima of a permutation. St000321The number of integer partitions of n that are dominated by an integer partition. St000335The difference of lower and upper interactions. St000336The leg major index of a standard tableau. St000345The number of refinements of a partition. St000351The determinant of the adjacency matrix of a graph. St000362The size of a minimal vertex cover of a graph. St000378The diagonal inversion number of an integer partition. St000382The first part of an integer composition. St000383The last part of an integer composition. St000388The number of orbits of vertices of a graph under automorphisms. St000414The binary logarithm of the number of binary trees with the same underlying unordered tree. St000420The number of Dyck paths that are weakly above a Dyck path. St000443The number of long tunnels of a Dyck path. St000444The length of the maximal rise of a Dyck path. St000453The number of distinct Laplacian eigenvalues of a graph. St000459The hook length of the base cell of a partition. St000460The hook length of the last cell along the main diagonal of an integer partition. St000468The Hosoya index of a graph. St000477The weight of a partition according to Alladi. St000482The (zero)-forcing number of a graph. St000488The number of cycles of a permutation of length at most 2. St000489The number of cycles of a permutation of length at most 3. St000501The size of the first part in the decomposition of a permutation. St000504The cardinality of the first block of a set partition. St000542The number of left-to-right-minima of a permutation. St000548The number of different non-empty partial sums of an integer partition. St000553The number of blocks of a graph. St000558The number of occurrences of the pattern {{1,2}} in a set partition. St000564The number of occurrences of the pattern {{1},{2}} in a set partition. St000567The sum of the products of all pairs of parts. St000573The number of occurrences of the pattern {{1},{2}} such that 1 is a singleton and 2 a maximal element. St000585The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal, (1,3) are consecutive in a block. St000594The number of occurrences of the pattern {{1,3},{2}} such that 1,2 are minimal, (1,3) are consecutive in a block. 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. St000617The number of global maxima of a Dyck path. St000624The normalized sum of the minimal distances to a greater element. St000630The length of the shortest palindromic decomposition of a binary word. St000632The jump number of the poset. 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. St000678The number of up steps after the last double rise of a Dyck path. St000681The Grundy value of Chomp on Ferrers diagrams. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St000699The toughness times the least common multiple of 1,. St000702The number of weak deficiencies of a permutation. St000708The product of the parts of an integer partition. St000719The number of alignments in a perfect matching. St000722The number of different neighbourhoods in a graph. St000725The smallest label of a leaf of the increasing binary tree associated to a permutation. St000736The last entry in the first row of a semistandard tableau. St000743The number of entries in a standard Young tableau such that the next integer is a neighbour. St000746The number of pairs with odd minimum in a perfect matching. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000767The number of runs in an integer composition. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000776The maximal multiplicity of an eigenvalue in a graph. St000778The metric dimension of a graph. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000804The number of occurrences of the vincular pattern |123 in a permutation. 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. 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. St000820The number of compositions obtained by rotating the composition. St000823The number of unsplittable factors of the set partition. St000848The balance constant multiplied with the number of linear extensions of a poset. St000870The product of the hook lengths of the diagonal cells in an integer partition. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St000883The number of longest increasing subsequences of a permutation. St000886The number of permutations with the same antidiagonal sums. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St000888The maximal sum of entries on a diagonal of an alternating sign matrix. St000891The number of distinct diagonal sums of a permutation 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. St000904The maximal number of repetitions of an integer composition. St000928The sum of the coefficients of the character polynomial of an integer partition. 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. 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. St000982The length of the longest constant subword. St000988The orbit size of a permutation under Foata's bijection. St000990The first ascent of a permutation. St000991The number of right-to-left minima 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. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001007Number of simple modules with projective dimension 1 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. St001014Number of indecomposable injective modules with codominant dimension equal to the dominant 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. St001024Maximum of dominant dimensions of the simple modules 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. St001045The number of leaves in the subtree not containing one in the decreasing labelled binary unordered tree associated with the perfect matching. St001050The number of terminal closers of a set partition. St001062The maximal size of a block of a set partition. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001081The number of minimal length factorizations of a permutation into star transpositions. 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. 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. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. St001108The 2-dynamic chromatic number of a graph. St001110The 3-dynamic chromatic number of a graph. St001111The weak 2-dynamic chromatic number of a graph. St001112The 3-weak dynamic number of a graph. St001118The acyclic chromatic index of a graph. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001136The largest label with larger sister in the leaf labelled binary unordered tree associated with the perfect matching. St001171The vector space dimension of $Ext_A^1(I_o,A)$ when $I_o$ is the tilting module corresponding to the permutation $o$ in the Auslander algebra $A$ of $K[x]/(x^n)$. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. 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: 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. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001235The global dimension of the corresponding Comp-Nakayama algebra. 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. St001268The size of the largest ordinal summand in the poset. St001281The normalized isoperimetric number of a graph. St001286The annihilation number of a graph. St001288The number of primes obtained by multiplying preimage and image of a permutation and adding one. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. 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. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001345The Hamming dimension of a graph. St001352The number of internal nodes in the modular decomposition of a graph. St001362The normalized Knill dimension of a graph. St001371The length of the longest Yamanouchi prefix of a binary word. St001373The logarithm of the number of winning configurations of the lights out game on a graph. St001376The Colless index of a binary tree. St001380The number of monomer-dimer tilings of a Ferrers diagram. 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. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001395The number of strictly unfriendly partitions of a graph. St001412Number of minimal entries in the Bruhat order matrix of a permutation. St001427The number of descents of a signed permutation. St001430The number of positive entries in a signed permutation. St001433The flag major index of a signed permutation. St001461The number of topologically connected components of the chord diagram of a permutation. St001463The number of distinct columns in the nullspace of a graph. St001468The smallest fixpoint of a permutation. St001481The minimal height of a peak of a Dyck path. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001513The number of nested exceedences of a permutation. St001521Half the total irregularity of a graph. St001530The depth of a Dyck path. St001549The number of restricted non-inversions between exceedances. St001555The order of a signed permutation. St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. St001566The length of the longest arithmetic progression in a permutation. St001591The number of graphs with the given composition of multiplicities of Laplacian eigenvalues. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001627The number of coloured connected graphs such that the multiplicities of colours are given by a partition. St001652The length of a longest interval of consecutive numbers. St001662The length of the longest factor of consecutive numbers in a permutation. St001674The number of vertices of the largest induced star graph in the graph. St001675The number of parts equal to the part in the reversed composition. St001718The number of non-empty open intervals in a poset. St001725The harmonious chromatic number of a graph. St001733The number of weak left to right maxima of a Dyck path. St001739The number of graphs with the same edge polytope as the given graph. St001742The difference of the maximal and the minimal degree in a graph. St001770The number of facets of a certain subword complex associated with the signed permutation. St001773The number of minimal elements in Bruhat order not less than the signed 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. St001780The order of promotion on the set of standard tableaux of given shape. St001794Half the number of sets of vertices in a graph which are dominating and non-blocking. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St001812The biclique partition number of a graph. St001813The product of the sizes of the principal order filters in a poset. St001817The number of flag weak exceedances of a signed permutation. St001823The Stasinski-Voll length of a signed permutation. St001827The number of two-component spanning forests of a graph. St001846The number of elements which do not have a complement in the lattice. St001855The number of signed permutations less than or equal to a signed permutation in left weak order. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St001883The mutual visibility number of a graph. St001884The number of borders of a binary word. St001892The flag excedance statistic of a signed permutation. St001896The number of right descents of a signed permutations. 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. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St001917The order of toric promotion on the set of labellings of a graph. St001926Sparre Andersen's position of the maximum of a signed permutation. St001927Sparre Andersen's number of positives of a signed permutation. St001941The evaluation at 1 of the modified Kazhdan--Lusztig R polynomial (as in [1, Section 5. St001946The number of descents in a parking function. St001949The rigidity index of a graph. St001951The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. St000027The major index of a Dyck path. St000050The depth or height of a binary tree. St000071The number of maximal chains in a poset. St000087The number of induced subgraphs. St000144The pyramid weight of the Dyck path. St000184The size of the centralizer of any permutation of given cycle type. St000203The number of external nodes of a binary tree. St000227The osculating paths major index of an alternating sign matrix. St000235The number of indices that are not cyclical small weak excedances. St000236The number of cyclical small weak excedances. St000249The number of singletons (St000247) plus the number of antisingletons (St000248) of a set partition. St000250The number of blocks (St000105) plus the number of antisingletons (St000248) of a set partition. St000381The largest part of an integer composition. St000384The maximal part of the shifted composition of an integer partition. St000439The position of the first down step of a Dyck path. St000452The number of distinct eigenvalues of a graph. St000469The distinguishing number of a graph. St000471The sum of the ascent tops of a permutation. St000636The hull number of a graph. St000644The number of graphs with given frequency partition. St000673The number of non-fixed points of a permutation. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000724The label of the leaf of the path following the smaller label in the increasing binary tree associated to a permutation. St000726The normalized sum of the leaf labels of the increasing binary tree associated to a permutation. St000733The row containing the largest entry of a standard tableau. St000770The major index of an integer partition when read from bottom to top. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000784The maximum of the length and the largest part of the integer partition. St000808The number of up steps of the associated bargraph. St000815The number of semistandard Young tableaux of partition weight of given shape. St000824The sum of the number of descents and the number of recoils of a permutation. St000915The Ore degree of a graph. St000926The clique-coclique number of a graph. 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}$. St000979Half of MacMahon's equal index of a Dyck path. St000981The length of the longest zigzag subpath. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001049The smallest label in the subtree not containing 1 in the decreasing labelled binary unordered tree associated with the perfect matching. 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. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules 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. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001279The sum of the parts of an integer partition that are at least 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. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices 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. St001458The rank of the adjacency matrix of a graph. St001482The product of the prefix sums of a permutation. St001488The number of corners of a skew partition. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001527The cyclic permutation representation number of an integer partition. St001554The number of distinct nonempty subtrees of a binary tree. 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. St001618The cardinality of the Frattini sublattice of a lattice. St001626The number of maximal proper sublattices of 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. St001660The number of ways to place as many non-attacking rooks as possible on a skew Ferrers board. St001708The number of pairs of vertices of different degree in a graph. St001722The number of minimal chains with small intervals between a binary word and the top element. St001746The coalition number of a graph. 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. St001814The number of partitions interlacing the given partition. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St000108The number of partitions contained in the given partition. St000226The convexity of a permutation. St000380Half of the maximal perimeter of a rectangle fitting into the diagram of an integer partition. St000532The total number of rook placements on a Ferrers board. St000827The decimal representation of a binary word with a leading 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. St001002Number of indecomposable modules with projective and injective 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. St001095The number of non-isomorphic posets with precisely one further covering relation. 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. St001182Number of indecomposable injective modules with codominant dimension at least two in the corresponding Nakayama algebra. St001237The number of simple modules with injective dimension at most one or dominant dimension at least one. St001255The vector space dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001404The number of distinct entries in a Gelfand Tsetlin pattern. St001406The number of nonzero entries in a Gelfand Tsetlin pattern. St001473The absolute value of the sum of all entries of the Coxeter matrix of the corresponding LNakayama algebra. St001658The total number of rook placements on a Ferrers board. St001838The number of nonempty primitive factors of a binary word. St001872The number of indecomposable injective modules with even projective dimension in the corresponding Nakayama algebra. St000756The sum of the positions of the left to right maxima of a permutation. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. St001650The order of Ringel's homological bijection associated to the linear Nakayama algebra corresponding to the Dyck path. St000111The sum of the descent tops (or Genocchi descents) of a permutation. St001138The number of indecomposable modules with projective dimension or injective dimension at most one in the corresponding Nakayama algebra.