St000395The sum of the heights of the peaks of a Dyck path. 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. St000469The distinguishing number of a graph. St000531The leading coefficient of the rook polynomial of an integer partition. St000636The hull number of a graph. St000784The maximum of the length and the largest part of the integer partition. St000870The product of the hook lengths of the diagonal cells in an integer partition. St000926The clique-coclique number of a graph. St001020Sum of the codominant dimensions of the non-projective indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001267The length of the Lyndon factorization of the binary word. St001348The bounce of the parallelogram polyomino associated with the Dyck path. St001360The number of covering relations in Young's lattice below a partition. St001437The flex of a binary word. St001523The degree of symmetry of a Dyck path. St001654The monophonic hull number of a graph. St001655The general position number of a graph. St001656The monophonic position number of a graph. St001659The number of ways to place as many non-attacking rooks as possible on a Ferrers board. St001660The number of ways to place as many non-attacking rooks as possible on a skew Ferrers board. St000063The number of linear extensions of a certain poset defined for an integer partition. St000108The number of partitions contained in the given partition. 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. 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. St001400The total number of Littlewood-Richardson tableaux of given shape. St001658The total number of rook placements on a Ferrers board. St000245The number of ascents of a permutation. St000385The number of vertices with out-degree 1 in a binary tree. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000414The binary logarithm of the number of binary trees with the same underlying unordered tree. St000441The number of successions of a permutation. St000672The number of minimal elements in Bruhat order not less than the permutation. St000743The number of entries in a standard Young tableau such that the next integer is a neighbour. St000744The length of the path to the largest entry in a standard Young tableau. St000876The number of factors in the Catalan decomposition of a binary word. St000885The number of critical steps in the Catalan decomposition of a binary word. St000921The number of internal inversions of a binary word. St001027Number of simple modules with projective dimension equal to injective dimension in the Nakayama algebra corresponding to the Dyck path. St001052The length of the exterior of a permutation. St001096The size of the overlap set of a permutation. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001631The number of simple modules $S$ with $dim Ext^1(S,A)=1$ in the incidence algebra $A$ of the poset. St001641The number of ascent tops in the flattened set partition such that all smaller elements appear before. 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. St001955The number of natural descents for set-valued two row standard Young tableaux. St000013The height of a Dyck path. St000018The number of inversions of a permutation. St000019The cardinality of the support of a permutation. St000026The position of the first return of a Dyck path. St000203The number of external nodes of a binary tree. St000249The number of singletons (St000247) plus the number of antisingletons (St000248) of a set partition. St000293The number of inversions of a binary word. St000296The length of the symmetric border of a binary word. St000528The height of a poset. St000543The size of the conjugacy class of a binary word. St000645The sum of the areas of the rectangles formed by two consecutive peaks and the valley in between. St000696The number of cycles in the breakpoint graph of a permutation. St000725The smallest label of a leaf of the increasing binary tree associated to a permutation. 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. St000982The length of the longest constant subword. St001004The number of indices that are either left-to-right maxima or right-to-left minima. St001034The area of the parallelogram polyomino associated with the Dyck path. St001090The number of pop-stack-sorts needed to sort a permutation. St001211The number of simple modules in the corresponding Nakayama algebra that have vanishing second Ext-group with the regular module. St001343The dimension of the reduced incidence algebra of a poset. 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. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001554The number of distinct nonempty subtrees of a binary tree. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St000070The number of antichains in a poset. St000110The number of permutations less than or equal to a permutation in left weak order. St000626The minimal period of a binary word. St000825The sum of the major and the inverse major index of a permutation. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. St001643The Frobenius dimension of the Nakayama algebra corresponding to the Dyck path. St001838The number of nonempty primitive factors of a binary word. St000442The maximal area to the right of an up step of a Dyck path. St001245The cyclic maximal difference between two consecutive entries of a permutation. St001405The number of bonds in a permutation. 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. St000625The sum of the minimal distances to a greater element. St000724The label of the leaf of the path following the smaller label in the increasing binary tree associated to a permutation. St000863The length of the first row of the shifted shape of a permutation. St000923The minimal number with no two order isomorphic substrings of this length in a permutation. St000931The number of occurrences of the pattern UUU in a Dyck path. St001074The number of inversions of the cyclic embedding of a permutation. St001342The number of vertices in the center of a graph. St001366The maximal multiplicity of a degree of a vertex of a graph. St001368The number of vertices of maximal degree in a graph. St001566The length of the longest arithmetic progression in a permutation. St001844The maximal degree of a generator of the invariant ring of the automorphism group of a graph. St000420The number of Dyck paths that are weakly above a Dyck path. St000520The number of patterns in a permutation. St000010The length of the partition. St000147The largest part of an integer partition. St000288The number of ones in a binary word. St000378The diagonal inversion number of an integer partition. St000733The row containing the largest entry of a standard tableau. St000157The number of descents of a standard tableau. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001645The pebbling number of a connected graph. St000874The position of the last double rise in a Dyck path. St000993The multiplicity of the largest part of an integer partition. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001249Sum of the odd parts of a partition. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001933The largest multiplicity of a part in an integer partition. St000438The position of the last up step in a Dyck path. St000477The weight of a partition according to Alladi. St000668The least common multiple of the parts of the partition. St000675The number of centered multitunnels of a Dyck path. St000708The product of the parts of an integer partition. St000770The major index of an integer partition when read from bottom to top. St001107The number of times one can erase the first up and the last down step in a Dyck path and still remain a Dyck path. St001176The size of a partition minus its first part. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St001332The number of steps on the non-negative side of the walk associated with the permutation. St000727The largest label of a leaf in the binary search tree associated with the permutation. St000837The number of ascents of distance 2 of a permutation. St001439The number of even weak deficiencies and of odd weak exceedences. St000087The number of induced subgraphs. St000144The pyramid weight of the Dyck path. St001018Sum of projective dimension of the indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001237The number of simple modules with injective dimension at most one or dominant dimension at least one. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra 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. St001218Smallest index k greater than or equal to one such that the Coxeter matrix C of the corresponding Nakayama algebra has C^k=1. St000024The number of double up and double down steps of a Dyck path. St000060The greater neighbor of the maximum. St000080The rank of the poset. St001126Number of simple module that are 1-regular 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. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001300The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset. St001480The number of simple summands of the module J^2/J^3. St001516The number of cyclic bonds of a permutation. St001723The differential of a graph. St001724The 2-packing differential of a graph. St000050The depth or height of a binary tree. St000064The number of one-box pattern of a permutation. St000171The degree of the graph. St000189The number of elements in the poset. St000229Sum of the difference between the maximal and the minimal elements of the blocks plus the number of blocks of a set partition. St000235The number of indices that are not cyclical small weak excedances. St000236The number of cyclical small weak excedances. St000240The number of indices that are not small excedances. St000308The height of the tree associated to a permutation. St000336The leg major index of a standard tableau. St000656The number of cuts of a poset. St000680The Grundy value for Hackendot on posets. St000717The number of ordinal summands of a poset. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St000906The length of the shortest maximal chain in a poset. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001007Number of simple modules with projective dimension 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. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St001717The largest size of an interval in a poset. St000058The order of a permutation. St000104The number of facets in the order polytope of this poset. St000151The number of facets in the chain polytope of the poset. St000529The number of permutations whose descent word is the given binary word. St000642The size of the smallest orbit of antichains under Panyushev complementation. St000643The size of the largest orbit of antichains under Panyushev complementation. St000718The largest Laplacian eigenvalue of a graph if it is integral. St001023Number of simple modules with projective dimension at most 3 in the Nakayama algebra corresponding to the Dyck path. St001179Number of indecomposable injective modules with projective dimension at most 2 in the corresponding Nakayama algebra. St001190Number of simple modules with projective dimension at most 4 in the corresponding Nakayama algebra. St001255The vector space dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001492The number of simple modules that do not appear in the socle of the regular module or have no nontrivial selfextensions with the regular module in the corresponding Nakayama algebra. St001664The number of non-isomorphic subposets of a poset. St001746The coalition number of a graph. St001782The order of rowmotion on the set of order ideals of a poset. St001800The number of 3-Catalan paths having this Dyck path as first and last coordinate projections. St000898The number of maximal entries in the last diagonal of the monotone triangle. St001925The minimal number of zeros in a row of an alternating sign matrix. St000890The number of nonzero entries in an alternating sign matrix. St000924The number of topologically connected components of a perfect matching. 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. St000225Difference between largest and smallest parts in a partition. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001280The number of parts of an integer partition that are at least two. St001570The minimal number of edges to add to make a graph Hamiltonian. St001959The product of the heights of the peaks of a Dyck path. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St001759The Rajchgot index of a permutation. St001725The harmonious chromatic number of a graph. St000327The number of cover relations in a poset. St001008Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001010Number of indecomposable injective modules with projective dimension g-1 when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001017Number of indecomposable injective modules with projective dimension equal to the codominant dimension in the Nakayama algebra corresponding to the Dyck path. St001164Number of indecomposable injective modules whose socle has projective dimension at most g-1 (g the global dimension) minus the number of indecomposable projective-injective modules. St001298The number of repeated entries in the Lehmer code of a permutation. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001637The number of (upper) dissectors of a poset. St001668The number of points of the poset minus the width of the poset. St000029The depth of a permutation. St000030The sum of the descent differences of a permutations. St000062The length of the longest increasing subsequence of the permutation. St000134The size of the orbit of an alternating sign matrix under gyration. St000197The number of entries equal to positive one in the alternating sign matrix. St000209Maximum difference of elements in cycles. St000210Minimum over maximum difference of elements in cycles. St000216The absolute length of a permutation. St000335The difference of lower and upper interactions. St000365The number of double ascents of a permutation. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St000443The number of long tunnels of a Dyck path. St000530The number of permutations with the same descent word as the given permutation. St000809The reduced reflection length of the permutation. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St000956The maximal displacement of a permutation. St000957The number of Bruhat lower covers 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. St001076The minimal length of a factorization of a permutation into transpositions that are cyclic shifts of (12). St001077The prefix exchange distance of a permutation. St001082The number of boxed occurrences of 123 in a permutation. St001130The number of two successive successions in a permutation. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St001246The maximal difference between two consecutive entries of a permutation. 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. St001511The minimal number of transpositions needed to sort a permutation in either direction. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. 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. St001652The length of a longest interval of consecutive numbers. St001662The length of the longest factor of consecutive numbers in a permutation. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St001958The degree of the polynomial interpolating the values of a permutation. St000014The number of parking functions supported by a Dyck path. St000111The sum of the descent tops (or Genocchi descents) of a permutation. St000485The length of the longest cycle of a permutation. St000487The length of the shortest cycle of a permutation. 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. St001005The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both. St001170Number of indecomposable injective modules whose socle has projective dimension at most g-1 when g denotes the global dimension in the corresponding Nakayama algebra. St001180Number of indecomposable injective modules with projective dimension at most 1. 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. St001464The number of bases of the positroid corresponding to the permutation, with all fixed points counterclockwise. St001019Sum of the projective dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001065Number of indecomposable reflexive modules in the corresponding Nakayama algebra. St001468The smallest fixpoint of a permutation. St001213The number of indecomposable modules in the corresponding Nakayama algebra that have vanishing first Ext-group with the regular module. 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$. St001432The order dimension of the partition. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St000474Dyson's crank of a partition. St000377The dinv defect of an integer partition. St000734The last entry in the first row of a standard tableau. St000676The number of odd rises of a Dyck path. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St000653The last descent of a permutation. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a 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. St001684The reduced word complexity of a permutation. St000044The number of vertices of the unicellular map given by a perfect matching. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St000507The number of ascents of a standard tableau. St000546The number of global descents of a permutation. St001777The number of weak descents in an integer composition. St000007The number of saliances of the permutation. St000053The number of valleys of the Dyck path. St000678The number of up steps after the last double rise of a Dyck path. St001068Number of torsionless simple modules 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. St000691The number of changes of a binary word. St000006The dinv of a Dyck path. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000765The number of weak records in an integer composition. St000782The indicator function of whether a given perfect matching is an L & P matching. 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)$. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. St001722The number of minimal chains with small intervals between a binary word and the top element. 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)$. St001168The vector space dimension of the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001529The number of monomials in the expansion of the nabla operator applied to the power-sum symmetric function indexed by the partition. St001484The number of singletons of an integer partition. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001279The sum of the parts of an integer partition that are at least two. St001389The number of partitions of the same length below the given integer partition. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000159The number of distinct parts of the integer partition. St000481The number of upper covers of a partition in dominance order. St000155The number of exceedances (also excedences) of a permutation. St000331The number of upper interactions of a Dyck path. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St000015The number of peaks of a Dyck path. St000783The side length of the largest staircase partition fitting into a partition. St000097The order of the largest clique of the graph. St000012The area of a Dyck path. St000984The number of boxes below precisely one peak. St000318The number of addable cells of the Ferrers diagram of an integer partition. St001462The number of factors of a standard tableaux under concatenation. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St001581The achromatic number of a graph. St001033The normalized area of the parallelogram polyomino associated with the Dyck path. St000093The cardinality of a maximal independent set of vertices of a graph. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St001058The breadth of the ordered tree. St000439The position of the first down step of a Dyck path. St000340The number of non-final maximal constant sub-paths of length greater than one. St000521The number of distinct subtrees of an ordered tree. St000011The number of touch points (or returns) of a Dyck path. St000932The number of occurrences of the pattern UDU in a Dyck path. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St000098The chromatic number of a graph. St000617The number of global maxima of a Dyck path. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000069The number of maximal elements of a poset. St001733The number of weak left to right maxima of a Dyck path. St001809The index of the step at the first peak of maximal height in a Dyck path. St000306The bounce count of a Dyck path. St001050The number of terminal closers of a set partition. St000648The number of 2-excedences of a permutation. St000996The number of exclusive left-to-right maxima of a permutation. St001083The number of boxed occurrences of 132 in a permutation. St000445The number of rises of length 1 of a Dyck path. St000052The number of valleys of a Dyck path not on the x-axis. St000028The number of stack-sorts needed to sort a permutation. St000161The sum of the sizes of the right subtrees of a binary tree. St000031The number of cycles in the cycle decomposition of a permutation. St000071The number of maximal chains in a poset. 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. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000695The number of blocks in the first part of the atomic decomposition of a set partition. St000068The number of minimal elements in a poset. St000167The number of leaves of an ordered tree. St000925The number of topologically connected components of a set partition. St000527The width of the poset. St000272The treewidth of a graph. St000362The size of a minimal vertex cover of a graph. St000536The pathwidth of a graph. St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St000172The Grundy number of a graph. St001029The size of the core of a graph. St001108The 2-dynamic chromatic number of a graph. 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: St001494The Alon-Tarsi number of a graph. St001580The acyclic chromatic number of a graph. St001670The connected partition number of a graph. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St000234The number of global ascents of a permutation. St000632The jump number of the poset. St000025The number of initial rises of a Dyck path. St000105The number of blocks in the set partition. St000118The number of occurrences of the contiguous pattern [.,[.,[.,.]]] in a binary tree. St001116The game chromatic number of a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St000121The number of occurrences of the contiguous pattern [.,[.,[.,[.,.]]]] in a binary tree. 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. St000211The rank of the set partition. St000374The number of exclusive right-to-left minima of a permutation. St000502The number of successions of a set partitions. St000703The number of deficiencies of a permutation. St000728The dimension of a set partition. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. 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. St001479The number of bridges of a graph. St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St001498The normalised height of a Nakayama algebra with magnitude 1. St000273The domination number of a graph. St000381The largest part of an integer composition. St000382The first part of an integer composition. St000383The last part of an integer composition. St000504The cardinality of the first block of a set partition. St000544The cop number of a graph. St000686The finitistic dominant dimension of a Dyck path. St000722The number of different neighbourhoods in a graph. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000808The number of up steps of the associated bargraph. St000916The packing number of a graph. St000971The smallest closer of a set partition. St001062The maximal size of a block of a set partition. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St001286The annihilation number of a graph. St001315The dissociation number of a graph. St001322The size of a minimal independent dominating set in a graph. St001339The irredundance number of a graph. St001363The Euler characteristic of a graph according to Knill. St001372The length of a longest cyclic run of ones of a binary word. St001373The logarithm of the number of winning configurations of the lights out game on a graph. St001829The common independence number of a graph. St001843The Z-index of a set partition. St001883The mutual visibility 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}$. St001277The degeneracy of a graph. St001358The largest degree of a regular subgraph of a graph. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001331The size of the minimal feedback vertex set. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001963The tree-depth of a graph. St001270The bandwidth of a graph. St001962The proper pathwidth of a graph. St000246The number of non-inversions of a permutation. St000741The Colin de Verdière graph invariant. St000883The number of longest increasing subsequences of a permutation. St000451The length of the longest pattern of the form k 1 2. St000822The Hadwiger number of the graph. St001316The domatic number of a graph. St001458The rank of the adjacency matrix of a graph. St001812The biclique partition number of a graph. St001087The number of occurrences of the vincular pattern |12-3 in a permutation. St001644The dimension of a graph. St001726The number of visible inversions of a permutation. St000731The number of double exceedences of a permutation. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000662The staircase size of the code of a permutation. St000366The number of double descents of a permutation. St000371The number of mid points of decreasing subsequences of length 3 in a permutation. St000437The number of occurrences of the pattern 312 or of the pattern 321 in a permutation. St000711The number of big exceedences of a permutation. St000141The maximum drop size of a permutation. St000054The first entry of the permutation. St000065The number of entries equal to -1 in an alternating sign matrix. St000153The number of adjacent cycles of a permutation. St000292The number of ascents of a binary word. St001397Number of pairs of incomparable elements in a finite poset. St000164The number of short pairs. St000291The number of descents of a binary word. St000390The number of runs of ones in a binary word. St000041The number of nestings of a perfect matching. St000354The number of recoils of a permutation. St000829The Ulam distance of a permutation to the identity permutation. St000833The comajor index of a permutation. St000868The aid statistic in the sense of Shareshian-Wachs. St001489The maximum of the number of descents and the number of inverse descents. St000271The chromatic index of a graph. St000358The number of occurrences of the pattern 31-2. St000470The number of runs in a permutation. St000654The first descent of a permutation. St000702The number of weak deficiencies of a permutation. St000989The number of final rises of a permutation. St001461The number of topologically connected components of the chord diagram of a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St000539The number of odd inversions of a permutation. St000795The mad of a permutation. St000831The number of indices that are either descents or recoils. St000961The shifted major index of a permutation. St001061The number of indices that are both descents and recoils of a permutation. St000359The number of occurrences of the pattern 23-1. St000237The number of small exceedances. St000214The number of adjacencies of a permutation. St000794The mak of a permutation. St001427The number of descents of a signed permutation. St000312The number of leaves in a graph. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St000081The number of edges of a graph. St000446The disorder of a permutation. St000740The last entry of a permutation. St001152The number of pairs with even minimum in a perfect matching.