St000744The length of the path to the largest entry in a standard Young tableau. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St000924The number of topologically connected components of a perfect matching. St001004The number of indices that are either left-to-right maxima or right-to-left minima. 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. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001480The number of simple summands of the module J^2/J^3. St001523The degree of symmetry of a Dyck path. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St001958The degree of the polynomial interpolating the values of a permutation. St000026The position of the first return of a Dyck path. St000044The number of vertices of the unicellular map given by a perfect matching. St000080The rank of the poset. St000501The size of the first part in the decomposition of a permutation. St000673The number of non-fixed points of a permutation. St000844The size of the largest block in the direct sum decomposition of a permutation. 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. 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. 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. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St001650The order of Ringel's homological bijection associated to the linear Nakayama algebra corresponding to the Dyck path. St000967The value p(1) for the Coxeterpolynomial p of the corresponding LNakayama algebra. St001023Number of simple modules with projective dimension at most 3 in the Nakayama algebra corresponding to the 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. St001468The smallest fixpoint of a permutation. St000018The number of inversions of a permutation. St000028The number of stack-sorts needed to sort a permutation. St000029The depth of a permutation. 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. St000050The depth or height of a binary tree. St000051The size of the left subtree of a binary tree. St000054The first entry of the permutation. St000067The inversion number of the alternating sign matrix. St000081The number of edges of a graph. St000093The cardinality of a maximal independent set of vertices of a graph. St000110The number of permutations less than or equal to a permutation in left weak order. St000135The number of lucky cars of the parking function. St000141The maximum drop size of a permutation. St000147The largest part of an integer partition. St000197The number of entries equal to positive one in 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. St000210Minimum over maximum difference of elements in cycles. St000216The absolute length of a permutation. St000228The size of a partition. St000229Sum of the difference between the maximal and the minimal elements of the blocks plus the number of blocks of a set partition. St000273The domination number of a graph. St000299The number of nonisomorphic vertex-induced subtrees. St000327The number of cover relations in a poset. 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. 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. 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. St000503The maximal difference between two elements in a common block. St000553The number of blocks of a graph. St000653The last descent of a permutation. St000691The number of changes of a binary word. St000703The number of deficiencies of a permutation. St000727The largest label of a leaf in the binary search tree associated with the permutation. St000733The row containing the largest entry of a standard tableau. St000740The last entry of a permutation. St000743The number of entries in a standard Young tableau such that the next integer is a neighbour. St000784The maximum of the length and the largest part of the integer partition. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000797The stat`` of a permutation. St000809The reduced reflection length of the permutation. St000839The largest opener of a set partition. St000863The length of the first row of the shifted shape of a permutation. St000870The product of the hook lengths of the diagonal cells in an integer partition. 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. St000916The packing number of a graph. St000956The maximal displacement of a permutation. St000957The number of Bruhat lower covers of a permutation. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. 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. St001052The length of the exterior of a 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. St001096The size of the overlap set of a permutation. St001170Number of indecomposable injective modules whose socle has projective dimension at most g-1 when g denotes the global dimension in the corresponding Nakayama algebra. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001245The cyclic maximal difference between two consecutive entries of a permutation. St001246The maximal difference between two consecutive entries of a permutation. St001286The annihilation number of a graph. St001300The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset. 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. St001332The number of steps on the non-negative side of the walk associated with the permutation. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001339The irredundance number of a graph. St001348The bounce of the parallelogram polyomino associated with 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. St001430The number of positive entries in a signed permutation. St001439The number of even weak deficiencies and of odd weak exceedences. St001464The number of bases of the positroid corresponding to the permutation, with all fixed points counterclockwise. St001479The number of bridges of a graph. 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). St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001554The number of distinct nonempty subtrees of a binary tree. 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. St001622The number of join-irreducible elements of a lattice. St001746The coalition number of a graph. St001778The largest greatest common divisor of an element and its image in a permutation. St001827The number of two-component spanning forests of a graph. St001829The common independence number of a graph. St001869The maximum cut size of a graph. St001917The order of toric promotion on the set of labellings of a graph. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001925The minimal number of zeros in a row of an alternating sign matrix. St000010The length of the partition. St000017The number of inversions of a standard tableau. St000058The order of a permutation. St000167The number of leaves of an ordered tree. St000235The number of indices that are not cyclical small weak excedances. St000240The number of indices that are not small excedances. St000259The diameter of a connected graph. St000316The number of non-left-to-right-maxima of a permutation. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000380Half of the maximal perimeter of a rectangle fitting into the diagram of an integer partition. St000451The length of the longest pattern of the form k 1 2. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000485The length of the longest cycle of a permutation. St000487The length of the shortest cycle of a permutation. St000505The biggest entry in the block containing the 1. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000549The number of odd partial sums of an integer partition. St000645The sum of the areas of the rectangles formed by two consecutive peaks and the valley in between. St000672The number of minimal elements in Bruhat order not less than the permutation. St000820The number of compositions obtained by rotating the composition. St000840The number of closers smaller than the largest opener in a perfect matching. St000890The number of nonzero entries in an alternating sign matrix. St000896The number of zeros on the main diagonal of an alternating sign matrix. St001005The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both. St001012Number of simple modules with projective dimension at most 2 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. St001032The number of horizontal steps in the bicoloured Motzkin path associated with 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. St001065Number of indecomposable reflexive modules in the corresponding Nakayama algebra. St001132The number of leaves in the subtree whose sister has label 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001179Number of indecomposable injective modules with projective dimension at most 2 in the corresponding Nakayama algebra. St001237The number of simple modules with injective dimension at most one or dominant dimension at least one. St001268The size of the largest ordinal summand in the poset. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001279The sum of the parts of an integer partition that are at least two. St001298The number of repeated entries in the Lehmer code of a permutation. St001340The cardinality of a minimal non-edge isolating set of a graph. St001345The Hamming dimension of a graph. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. St001389The number of partitions of the same length below the given integer partition. St001391The disjunction number of a graph. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. 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. St001527The cyclic permutation representation number of an integer partition. St001641The number of ascent tops in the flattened set partition such that all smaller elements appear before. St001684The reduced word complexity of a permutation. St001955The number of natural descents for set-valued two row standard Young tableaux. St001134The largest label in the subtree rooted at the sister of 1 in the leaf labelled binary unordered tree associated with the perfect matching. St001255The vector space dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001814The number of partitions interlacing the given partition. St000004The major index of a permutation. St000014The number of parking functions supported by a Dyck path. St000021The number of descents of a permutation. St000030The sum of the descent differences of a permutations. St000035The number of left outer peaks of a permutation. St000053The number of valleys of the Dyck path. St000060The greater neighbor of the maximum. St000066The column of the unique '1' in the first row of the alternating sign matrix. St000095The number of triangles of a graph. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000134The size of the orbit of an alternating sign matrix under gyration. St000156The Denert index of a permutation. St000157The number of descents of a standard tableau. St000171The degree of the graph. St000186The sum of the first row in a Gelfand-Tsetlin pattern. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000214The number of adjacencies of a permutation. St000238The number of indices that are not small weak excedances. St000246The number of non-inversions of a permutation. St000293The number of inversions of a binary word. St000306The bounce count of a Dyck path. St000331The number of upper interactions of a Dyck path. St000332The positive inversions of an alternating sign matrix. St000334The maz index, the major index of a permutation after replacing fixed points by zeros. St000339The maf index of a permutation. St000352The Elizalde-Pak rank of a permutation. St000354The number of recoils of a permutation. St000363The number of minimal vertex covers of a graph. St000371The number of mid points of decreasing subsequences of length 3 in a permutation. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St000381The largest part of an integer composition. St000382The first part of an integer composition. St000383The last part of an integer composition. St000393The number of strictly increasing runs in a binary word. St000446The disorder of a permutation. St000450The number of edges minus the number of vertices plus 2 of a graph. St000479The Ramsey number of a graph. St000507The number of ascents of a standard tableau. St000519The largest length of a factor maximising the subword complexity. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000543The size of the conjugacy class of a binary word. St000546The number of global descents of a permutation. St000547The number of even non-empty partial sums of an integer partition. St000548The number of different non-empty partial sums of an integer partition. St000619The number of cyclic descents of a permutation. St000626The minimal period of a binary word. St000632The jump number of the poset. St000636The hull number of a graph. St000657The smallest part of an integer composition. St000662The staircase size of the code of a permutation. St000675The number of centered multitunnels of a Dyck path. St000681The Grundy value of Chomp on Ferrers diagrams. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000696The number of cycles in the breakpoint graph of a permutation. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000702The number of weak deficiencies of a permutation. St000725The smallest label of a leaf of the increasing binary tree associated to a permutation. St000728The dimension of a set partition. St000730The maximal arc length of a set partition. St000742The number of big ascents of a permutation after prepending zero. St000780The size of the orbit under rotation of a perfect matching. St000794The mak of a permutation. St000795The mad of a permutation. St000796The stat' of a permutation. St000808The number of up steps of the associated bargraph. St000822The Hadwiger number of the graph. St000829The Ulam distance of a permutation to the identity permutation. St000831The number of indices that are either descents or recoils. St000832The number of permutations obtained by reversing blocks of three consecutive numbers. St000864The number of circled entries of the shifted recording tableau of a permutation. St000868The aid statistic in the sense of Shareshian-Wachs. St000876The number of factors in the Catalan decomposition of a binary word. St000883The number of longest increasing subsequences of a permutation. St000884The number of isolated descents of a permutation. St000885The number of critical steps in the Catalan decomposition of a binary word. St000907The number of maximal antichains of minimal length in a poset. St000911The number of maximal antichains of maximal size in a poset. St000912The number of maximal antichains in a poset. St000922The minimal number such that all substrings of this length are unique. St000932The number of occurrences of the pattern UDU in a Dyck path. St000945The number of matchings in the dihedral orbit of a perfect matching. St000954Number of times the corresponding LNakayama algebra has $Ext^i(D(A),A)=0$ for $i>0$. St000975The length of the boundary minus the length of the trunk of an ordered tree. St000982The length of the longest constant subword. St000988The orbit size of a permutation under Foata's bijection. St001029The size of the core of a graph. St001061The number of indices that are both descents and recoils of a permutation. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. 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. St001084The number of occurrences of the vincular pattern |1-23 in a permutation. St001090The number of pop-stack-sorts needed to sort a permutation. St001093The detour number of a graph. St001108The 2-dynamic chromatic number of a graph. St001120The length of a longest path in a graph. 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. St001176The size of a partition minus its first part. St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001199The dominant 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. 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. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001252Half the sum of the even parts of a partition. St001267The length of the Lyndon factorization of the binary word. St001288The number of primes obtained by multiplying preimage and image of a permutation and adding one. 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. St001304The number of maximally independent sets of vertices of a graph. St001311The cyclomatic number of a graph. St001316The domatic number of a graph. St001317The minimal number of occurrences of the forest-pattern in a linear ordering of the vertices of the graph. St001328The minimal number of occurrences of the bipartite-pattern in a linear ordering of the vertices of the graph. St001342The number of vertices in the center of a graph. St001371The length of the longest Yamanouchi prefix of a binary word. St001372The length of a longest cyclic run of ones of a binary word. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001397Number of pairs of incomparable elements in a finite poset. St001405The number of bonds in a permutation. St001413Half the length of the longest even length 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. St001427The number of descents of a signed permutation. St001428The number of B-inversions of a signed permutation. St001429The number of negative entries in a signed permutation. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001437The flex of a binary word. St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St001489The maximum of the number of descents and the number of inverse descents. St001494The Alon-Tarsi number of a graph. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001524The degree of symmetry of a binary word. St001533The largest coefficient of the Poincare polynomial of the poset cone. St001580The acyclic chromatic number of a graph. St001615The number of join prime elements of a lattice. St001617The dimension of the space of valuations of a lattice. St001654The monophonic hull number of a graph. St001655The general position number of a graph. St001656The monophonic position number of a graph. St001672The restrained domination number of a graph. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001726The number of visible inversions of a permutation. St001777The number of weak descents in an integer composition. 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. St001817The number of flag weak exceedances of a signed permutation. St001855The number of signed permutations less than or equal to a signed permutation in left weak order. St001861The number of Bruhat lower covers of a permutation. St001892The flag excedance statistic of a signed permutation. St001907The number of Bastidas - Hohlweg - Saliola excedances of a signed permutation. St001963The tree-depth of a graph. St000005The bounce statistic of a Dyck path. St000007The number of saliances of the permutation. St000011The number of touch points (or returns) of a Dyck path. St000015The number of peaks of a Dyck path. St000039The number of crossings of a permutation. St000052The number of valleys of a Dyck path not on the x-axis. St000064The number of one-box pattern of a permutation. St000068The number of minimal elements in a poset. St000071The number of maximal chains in a poset. St000111The sum of the descent tops (or Genocchi descents) of a permutation. St000117The number of centered tunnels of a Dyck path. St000133The "bounce" of a permutation. St000203The number of external nodes of a binary tree. St000215The number of adjacencies of a permutation, zero appended. St000220The number of occurrences of the pattern 132 in a permutation. St000224The sorting index of a permutation. St000242The number of indices that are not cyclical small weak excedances. St000245The number of ascents of a permutation. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000272The treewidth of a graph. St000292The number of ascents of a binary word. St000310The minimal degree of a vertex of a graph. St000312The number of leaves in a graph. St000325The width of the tree associated to a permutation. St000338The number of pixed points of a permutation. St000362The size of a minimal vertex cover of a graph. St000366The number of double descents of a permutation. St000369The dinv deficit of a Dyck path. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St000376The bounce deficit of a Dyck path. St000426The number of occurrences of the pattern 132 or of the pattern 312 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. St000445The number of rises of length 1 of a Dyck path. St000452The number of distinct eigenvalues of a graph. St000453The number of distinct Laplacian eigenvalues of a graph. St000470The number of runs in a permutation. St000491The number of inversions of a set partition. St000496The rcs statistic of a set partition. St000527The width of the poset. St000531The leading coefficient of the rook polynomial of an integer partition. St000536The pathwidth of a graph. St000538The number of even inversions of a permutation. St000542The number of left-to-right-minima of a permutation. St000581The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 2 is maximal. 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. St000610The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal. 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. St000625The sum of the minimal distances to a greater element. St000651The maximal size of a rise in a permutation. St000674The number of hills of a Dyck path. St000676The number of odd rises of a Dyck path. St000678The number of up steps after the last double rise of a Dyck path. St000680The Grundy value for Hackendot on posets. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000685The dominant dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St000717The number of ordinal summands of a poset. 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. St000734The last entry in the first row of a standard tableau. St000738The first entry in the last row of a standard tableau. St000741The Colin de Verdière graph invariant. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000778The metric dimension of a graph. St000800The number of occurrences of the vincular pattern |231 in a permutation. 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. St000906The length of the shortest maximal chain in a poset. St000921The number of internal inversions of a binary word. St000923The minimal number with no two order isomorphic substrings of this length in a permutation. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000947The major index east count of a Dyck path. St000990The first ascent of a permutation. St001021Sum of the differences between projective and codominant dimension of the non-projective indecomposable injective modules in the Nakayama algebra corresponding to the Dyck path. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001040The depth of the decreasing labelled binary unordered tree associated with the perfect matching. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001074The number of inversions of the cyclic embedding of a permutation. 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. St001161The major index north count of a Dyck path. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001167The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive in the corresponding Nakayama algebra. St001180Number of indecomposable injective modules with projective dimension at most 1. 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: St001211The number of simple modules in the corresponding Nakayama algebra that have vanishing second Ext-group with the regular module. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St001228The vector space dimension of the space of module homomorphisms between J and itself when J denotes the Jacobson radical of the corresponding Nakayama algebra. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001249Sum of the odd parts of a partition. St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St001254The 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. 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. St001270The bandwidth of a graph. St001277The degeneracy of a graph. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001358The largest degree of a regular subgraph of a graph. St001360The number of covering relations in Young's lattice below a partition. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001424The number of distinct squares in a binary word. St001434The number of negative sum pairs of a signed permutation. 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. St001530The depth of a Dyck path. St001555The order of a signed permutation. St001557The number of inversions of the second entry of a permutation. St001566The length of the longest arithmetic progression in a permutation. St001584The area statistic between a Dyck path and its bounce path. St001614The cyclic permutation representation number of a skew partition. St001659The number of ways to place as many non-attacking rooks as possible on a Ferrers board. St001668The number of points of the poset minus the width of the poset. St001688The sum of the squares of the heights of the peaks of a Dyck path. 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. St001725The harmonious chromatic number of a graph. St001727The number of invisible inversions of a permutation. St001733The number of weak left to right maxima of a Dyck path. St001742The difference of the maximal and the minimal degree in a graph. St001759The Rajchgot index of a permutation. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001843The Z-index of a set partition. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St001910The height of the middle non-run of a Dyck path. St001960The number of descents of a permutation minus one if its first entry is not one. St001962The proper pathwidth of a graph. St000063The number of linear extensions of a certain poset defined for an integer partition. St000108The number of partitions contained in the given partition. St000456The monochromatic index of a connected graph. St000520The number of patterns in a permutation. St000532The total number of rook placements on a Ferrers board. St000643The size of the largest orbit of antichains under Panyushev complementation. St000806The semiperimeter of the associated bargraph. St000867The sum of the hook lengths in the first row of an integer partition. St000949Gives the number of generalised tilting modules of the corresponding LNakayama algebra. St000968We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n−1}]$ by adding $c_0$ to $c_{n−1}$. 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}$. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001182Number of indecomposable injective modules with codominant dimension at least two 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. St001400The total number of Littlewood-Richardson tableaux of given shape. St001486The number of corners of the ribbon associated with an integer composition. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St001643The Frobenius dimension of the Nakayama algebra corresponding to the Dyck path. St001782The order of rowmotion on the set of order ideals of a poset. St000656The number of cuts of a poset. St001003The number of indecomposable modules with projective dimension at most 1 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. St001706The number of closed sets in a graph. St000250The number of blocks (St000105) plus the number of antisingletons (St000248) of a set partition. St000668The least common multiple of the parts of the partition. St001927Sparre Andersen's number of positives of a signed permutation. St001959The product of the heights of the peaks of a Dyck path. St000385The number of vertices with out-degree 1 in a binary tree. St000414The binary logarithm of the number of binary trees with the same underlying unordered tree. St000458The number of permutations obtained by switching adjacencies or successions. 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)$. St000225Difference between largest and smallest parts in a partition. St000435The number of occurrences of the pattern 213 or of the pattern 231 in a permutation. St000799The number of occurrences of the vincular pattern |213 in a permutation. St000082The number of elements smaller than a binary tree in Tamari order. St000294The number of distinct factors of a binary word. St000420The number of Dyck paths that are weakly above a Dyck path. St000518The number of distinct subsequences in a binary word. St000898The number of maximal entries in the last diagonal of the monotone triangle. St001346The number of parking functions that give the same permutation. St000296The length of the symmetric border of a binary word. St000419The number of Dyck paths that are weakly above the Dyck path, except for the path itself. St000444The length of the maximal rise of a Dyck path. St000494The number of inversions of distance at most 3 of a permutation. St000530The number of permutations with the same descent word as the given permutation. St000627The exponent of a binary word. St000652The maximal difference between successive positions of a permutation. St000874The position of the last double rise in a Dyck path. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St000946The sum of the skew hook positions in a Dyck path. St001380The number of monomer-dimer tilings of a Ferrers diagram. St001415The length of the longest palindromic prefix of a binary word. St001875The number of simple modules with projective dimension at most 1. St001884The number of borders of a binary word. St000295The length of the border of a binary word. St000442The maximal area to the right of an up step of a Dyck path. St000461The rix statistic of a permutation. St000462The major index minus the number of excedences of a permutation. St000539The number of odd inversions 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. St000833The comajor index of a permutation. St000866The number of admissible inversions of a permutation in the sense of Shareshian-Wachs. St000961The shifted major index of a permutation. St000984The number of boxes below precisely one peak. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001078The minimal number of occurrences of (12) in a factorization of a permutation into transpositions (12) and cycles (1,. St001569The maximal modular displacement of a permutation. St001811The Castelnuovo-Mumford regularity of a permutation. St001820The size of the image of the pop stack sorting operator. St001623The number of doubly irreducible elements of a lattice. St001626The number of maximal proper sublattices of a lattice. St001637The number of (upper) dissectors of a poset. St001720The minimal length of a chain of small intervals in a lattice. St000013The height of a Dyck path. St001644The dimension of a graph. St001812The biclique partition number of a graph. St000937The number of positive values of the symmetric group character corresponding to the partition. St000045The number of linear extensions of a binary tree. 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$. St001926Sparre Andersen's position of the maximum of a signed permutation. St000219The number of occurrences of the pattern 231 in a permutation. St000402Half the size of the symmetry class of a permutation. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St001432The order dimension of the partition. St001498The normalised height of a Nakayama algebra with magnitude 1. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001780The order of promotion on the set of standard tableaux of given shape. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000941The number of characters of the symmetric group whose value on the partition is even. St000944The 3-degree of an integer partition. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001388The number of non-attacking neighbors of a permutation. St001587Half of the largest even part of an integer partition. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St001930The weak major index of a binary word. St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001845The number of join irreducibles minus the rank of a lattice. St001330The hat guessing number of a graph. St000454The largest eigenvalue of a graph if it is integral. St000284The Plancherel distribution on integer partitions. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001060The distinguishing index of a graph. 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. St001568The smallest positive integer that does not appear twice in the partition. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St000509The diagonal index (content) of a partition. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000929The constant term of the character polynomial of an integer partition. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000568The hook number of a binary tree. St000919The number of maximal left branches of a binary tree. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001621The number of atoms of a lattice. St000490The intertwining number of a set partition. St001645The pebbling number of a connected graph. St000022The number of fixed points of a permutation. St000119The number of occurrences of the pattern 321 in a permutation. St000123The difference in Coxeter length of a permutation and its image under the Simion-Schmidt map. St000223The number of nestings in the permutation. St000502The number of successions of a set partitions. St000731The number of double exceedences of a permutation. St000455The second largest eigenvalue of a graph if it is integral. St000550The number of modular elements of a lattice. St000551The number of left modular elements of a lattice. St000153The number of adjacent cycles of a permutation. St000237The number of small exceedances. St000845The maximal number of elements covered by an element in a poset. St000356The number of occurrences of the pattern 13-2. St000271The chromatic index of a graph. St000670The reversal length of a permutation. St001050The number of terminal closers of a set partition. St001343The dimension of the reduced incidence algebra of a poset. St000647The number of big descents of a permutation. St000971The smallest closer of a set partition. St001087The number of occurrences of the vincular pattern |12-3 in a permutation. St001115The number of even descents of a permutation. St000062The length of the longest increasing subsequence of the permutation. St000105The number of blocks in the set partition. St000155The number of exceedances (also excedences) of a permutation. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000211The rank of the set partition. St000213The number of weak exceedances (also weak excedences) of a permutation. St000251The number of nonsingleton blocks of a set partition. St000308The height of the tree associated to a permutation. St000314The number of left-to-right-maxima of a permutation. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000488The number of cycles of a permutation of length at most 2. St000489The number of cycles of a permutation of length at most 3. St000493The los statistic of a set partition. St000499The rcb statistic of a set partition. St000504The cardinality of the first block of a set partition. St000558The number of occurrences of the pattern {{1,2}} in a set partition. St000654The first descent of a permutation. St000798The makl of a permutation. St000823The number of unsplittable factors of the set partition. St000925The number of topologically connected components of a set partition. St000991The number of right-to-left minima of a permutation. St001062The maximal size of a block of a set partition. St001075The minimal size of a block of a set partition. St001220The width of a permutation. St001269The sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation. St001461The number of topologically connected components of the chord diagram of a permutation. St001517The length of a longest pair of twins in a permutation. St001665The number of pure excedances of a permutation. St001667The maximal size of a pair of weak twins for a permutation. St001729The number of visible descents of a permutation. St001769The reflection length of a signed permutation. St001801Half the number of preimage-image pairs of different parity in a permutation. St001874Lusztig's a-function for the symmetric group. St000168The number of internal nodes of an ordered tree. St000358The number of occurrences of the pattern 31-2. St000609The number of occurrences of the pattern {{1},{2,3}} such that 1,2 are minimal. St000624The normalized sum of the minimal distances to a greater element. St000989The number of final rises of a permutation. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St000024The number of double up and double down steps of a Dyck path. St000056The decomposition (or block) number of a permutation. St000075The orbit size of a standard tableau under promotion. St000083The number of left oriented leafs of a binary tree except the first one. St000092The number of outer peaks of a permutation. St000099The number of valleys of a permutation, including the boundary. St000305The inverse major index of a permutation. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000387The matching number of a graph. St000443The number of long tunnels of a Dyck path. St000552The number of cut vertices of a graph. St000695The number of blocks in the first part of the atomic decomposition of a set partition. St000785The number of distinct colouring schemes of a graph. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama algebra. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001112The 3-weak dynamic number of a graph. St001114The number of odd descents of a permutation. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. St001642The Prague dimension of a graph. St001671Haglund's hag of a permutation. St001692The number of vertices with higher degree than the average degree in a graph. St001737The number of descents of type 2 in a permutation. St001773The number of minimal elements in Bruhat order not less than the signed permutation. St001873For a Nakayama algebra corresponding to a Dyck path, we define the matrix C with entries the Hom-spaces between $e_i J$ and $e_j J$ (the radical of the indecomposable projective modules). St001894The depth of a signed permutation. St001928The number of non-overlapping descents in a permutation. St000023The number of inner peaks of a permutation. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St000172The Grundy number of a graph. St000204The number of internal nodes of a binary tree. St000222The number of alignments in the permutation. St000234The number of global ascents of a permutation. St000280The size of the preimage of the map 'to labelling permutation' from Parking functions to Permutations. St000317The cycle descent number of a permutation. St000353The number of inner valleys of a permutation. St000497The lcb statistic of a set partition. St000565The major index of a set partition. St000586The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal. St000614The number of occurrences of the pattern {{1},{2,3}} such that 1 is minimal, 3 is maximal, (2,3) are consecutive in a block. St000638The number of up-down runs of a permutation. St000646The number of big ascents of a permutation. St000663The number of right floats of a permutation. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000710The number of big deficiencies of a permutation. St000711The number of big exceedences of a permutation. St000732The number of double deficiencies of a permutation. St000779The tier of a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000848The balance constant multiplied with the number of linear extensions of a poset. St000849The number of 1/3-balanced pairs in a poset. St000872The number of very big descents of a permutation. 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. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. 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. St001116The game chromatic number of a graph. 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. St001184Number of indecomposable injective modules with grade at least 1 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. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001302The number of minimally dominating sets of vertices of a graph. St001307The number of induced stars on four vertices in a graph. St001320The minimal number of occurrences of the path-pattern in a linear ordering of the vertices of the graph. St001331The size of the minimal feedback vertex set. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001366The maximal multiplicity of a degree of a vertex of a graph. St001411The number of patterns 321 or 3412 in a permutation. St001469The holeyness of a permutation. St001520The number of strict 3-descents. St001552The number of inversions between excedances and fixed points of a permutation. St001556The number of inversions of the third entry of a permutation. St001565The number of arithmetic progressions of length 2 in a permutation. St001581The achromatic number of a graph. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001670The connected partition number of a graph. St001674The number of vertices of the largest induced star graph in the graph. 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. St001693The excess length of a longest path consisting of elements and blocks of a set partition. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St001728The number of invisible descents of a permutation. St001810The number of fixed points of a permutation smaller than its largest moved point. St001816Eigenvalues of the top-to-random operator acting on a simple module. St001839The number of excedances of a set partition. St001840The number of descents of a set partition. St001883The mutual visibility number of a graph. St000756The sum of the positions of the left to right maxima of a permutation. St001315The dissociation number of a graph. St001404The number of distinct entries in a Gelfand Tsetlin pattern. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St000243The number of cyclic valleys and cyclic peaks of a permutation. St000873The aix statistic of a permutation. St001731The factorization defect of a permutation. St001805The maximal overlap of a cylindrical tableau associated with a semistandard tableau. St000910The number of maximal chains of minimal length in a poset. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St001510The number of self-evacuating linear extensions of a finite poset. St000307The number of rowmotion orbits of a poset. St001638The book thickness of a graph. St000782The indicator function of whether a given perfect matching is an L & P matching. St000739The first entry in the last row of a semistandard tableau. St001401The number of distinct entries in a semistandard tableau. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001686The order of promotion on a Gelfand-Tsetlin pattern. St000101The cocharge of a semistandard tableau. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001856The number of edges in the reduced word graph of a permutation. St001948The number of augmented double ascents of a permutation. St000116The major index of a semistandard tableau obtained by standardizing. St000173The segment statistic of a semistandard tableau. St000174The flush statistic of a semistandard tableau. St000264The girth of a graph, which is not a tree. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$. St000612The number of occurrences of the pattern {{1},{2,3}} such that 1 is minimal, (2,3) are consecutive in a block. St000736The last entry in the first row of a semistandard tableau. St000880The number of connected components of long braid edges in the graph of braid moves of a permutation. St000942The number of critical left to right maxima of the parking functions. St000958The number of Bruhat factorizations of a permutation. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001487The number of inner corners of a skew partition. St001570The minimal number of edges to add to make a graph Hamiltonian. St001591The number of graphs with the given composition of multiplicities of Laplacian eigenvalues. St001596The number of two-by-two squares inside a skew partition. St001768The number of reduced words of a signed permutation. St001863The number of weak excedances of a signed permutation. St001864The number of excedances of a signed permutation. St001877Number of indecomposable injective modules with projective dimension 2. St001896The number of right descents of a signed permutations. St001904The length of the initial strictly increasing segment of a parking function. St001905The number of preferred parking spots in a parking function less than the index of the car. St001946The number of descents in a parking function. St000002The number of occurrences of the pattern 123 in a permutation. St000102The charge of a semistandard tableau. St000166The depth minus 1 of an ordered tree. St000357The number of occurrences of the pattern 12-3. St000522The number of 1-protected nodes of a rooted tree. St000603The number of occurrences of the pattern {{1},{2},{3}} such that 2,3 are minimal. St000605The number of occurrences of the pattern {{1},{2,3}} such that 3 is maximal, (2,3) are consecutive in a block. St000804The number of occurrences of the vincular pattern |123 in a permutation. St000879The number of long braid edges in the graph of braid moves of a permutation. St000881The number of short braid edges in the graph of braid moves of a permutation. St000963The 2-shifted major index of a permutation. St001117The game chromatic index of a graph. 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)$. 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. 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. St001575The minimal number of edges to add or remove to make a graph edge transitive. St001577The minimal number of edges to add or remove to make a graph a cograph. St001578The minimal number of edges to add or remove to make a graph a line graph. St001649The length of a longest trail in a graph. St001722The number of minimal chains with small intervals between a binary word and the top element. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St001745The number of occurrences of the arrow pattern 13 with an arrow from 1 to 2 in a permutation. St001857The number of edges in the reduced word graph of a signed permutation. St001935The number of ascents in a parking function. St001964The interval resolution global dimension of a poset. St000094The depth of an ordered tree. St000521The number of distinct subtrees of an ordered tree. St000973The length of the boundary of an ordered tree. St001002Number of indecomposable modules with projective and injective dimension at most 1 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. St000422The energy of a graph, if it is integral. St000735The last entry on the main diagonal of a standard tableau.