St000528The height of a poset. St000548The number of different non-empty partial sums of an integer partition. St000636The hull number of a graph. St000725The smallest label of a leaf of the increasing binary tree associated to a permutation. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000784The maximum of the length and the largest part of the integer partition. St000870The product of the hook lengths of the diagonal cells in an integer partition. St001020Sum of the codominant dimensions of the non-projective indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001034The area of the parallelogram polyomino associated with the Dyck path. St001093The detour number of a graph. St001318The number of vertices of the largest induced subforest with the same number of connected components of a graph. St001321The number of vertices of the largest induced subforest of a graph. St001342The number of vertices in the center of a graph. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. 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. 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. St001746The coalition number of a graph. St000081The number of edges of a graph. St000259The diameter of a connected graph. St000380Half of the maximal perimeter of a rectangle fitting into the diagram of an integer partition. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St000998Number of indecomposable projective modules with injective dimension smaller than or equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. St001119The length of a shortest maximal path in a graph. St001120The length of a longest path in a graph. St001332The number of steps on the non-negative side of the walk associated with the permutation. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001479The number of bridges of a graph. St001512The minimum rank of a graph. St001641The number of ascent tops in the flattened set partition such that all smaller elements appear before. St001643The Frobenius dimension of the Nakayama algebra corresponding to the Dyck path. St000010The length of the partition. St000018The number of inversions of a permutation. St000019The cardinality of the support of a permutation. St000022The number of fixed points of a permutation. St000026The position of the first return of a Dyck path. St000031The number of cycles in the cycle decomposition of a permutation. St000050The depth or height of a binary tree. St000054The first entry of the permutation. St000058The order of a permutation. St000093The cardinality of a maximal independent set of vertices of a graph. St000153The number of adjacent cycles of a permutation. St000246The number of non-inversions of a permutation. St000273The domination number of a graph. St000290The major index of a binary word. St000308The height of the tree associated to a permutation. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000479The Ramsey number of a graph. St000505The biggest entry in the block containing the 1. St000734The last entry in the first row of a standard tableau. St000738The first entry in the last row of a standard tableau. St000740The last entry of a permutation. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000765The number of weak records in an integer composition. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000839The largest opener of a set partition. St000863The length of the first row of the shifted shape of a permutation. St000876The number of factors in the Catalan decomposition of a binary word. St000885The number of critical steps in the Catalan decomposition of a binary word. St000899The maximal number of repetitions of an integer composition. St000900The minimal number of repetitions of a part in an integer composition. St000902 The minimal number of repetitions of an integer composition. St000904The maximal number of repetitions of an integer composition. St000916The packing number of a graph. St000975The length of the boundary minus the length of the trunk of an ordered tree. St001268The size of the largest ordinal summand in the poset. St001286The annihilation number of a graph. St001322The size of a minimal independent dominating set in a graph. 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. St001416The length of a longest palindromic factor of a binary word. St001417The length of a longest palindromic subword of a binary word. St001439The number of even weak deficiencies and of odd weak exceedences. St001461The number of topologically connected components of the chord diagram of a permutation. St001463The number of distinct columns in the nullspace of a graph. St001497The position of the largest weak excedence of a permutation. St001523The degree of symmetry of a Dyck path. St001554The number of distinct nonempty subtrees of a binary tree. St001566The length of the longest arithmetic progression in a permutation. St001615The number of join prime elements of a lattice. St001617The dimension of the space of valuations of a lattice. St001622The number of join-irreducible elements of a lattice. St001652The length of a longest interval of consecutive numbers. St001662The length of the longest factor of consecutive numbers in a permutation. St001675The number of parts equal to the part in the reversed composition. St001725The harmonious chromatic number of a graph. St001778The largest greatest common divisor of an element and its image in a permutation. St001829The common independence number of a graph. St000141The maximum drop size of a permutation. St000171The degree of the graph. St000234The number of global ascents of a permutation. St000245The number of ascents of a permutation. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000441The number of successions of a permutation. 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. St000696The number of cycles in the breakpoint graph of a permutation. St000921The number of internal inversions of a binary word. St001090The number of pop-stack-sorts needed to sort a permutation. St001096The size of the overlap set of a permutation. St001166Number of indecomposable projective non-injective modules with dominant dimension equal to the global dimension plus the number of indecomposable projective injective modules in the corresponding Nakayama algebra. St001245The cyclic maximal difference between two consecutive entries of a permutation. 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. St001300The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset. St001340The cardinality of a minimal non-edge isolating set of a graph. St001405The number of bonds in a permutation. 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. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001777The number of weak descents in an integer composition. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001958The degree of the polynomial interpolating the values of a permutation. St000438The position of the last up step in a Dyck path. St001430The number of positive entries in a signed permutation. St000519The largest length of a factor maximising the subword complexity. St000250The number of blocks (St000105) plus the number of antisingletons (St000248) of a set partition. St000288The number of ones in a binary word. St000336The leg major index of a standard tableau. St000724The label of the leaf of the path following the smaller label in the increasing binary tree associated to a permutation. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St001190Number of simple modules with projective dimension at most 4 in the corresponding Nakayama algebra. St000189The number of elements in the poset. St000393The number of strictly increasing runs in a binary word. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000806The semiperimeter of the associated bargraph. St001267The length of the Lyndon factorization of the binary word. St001371The length of the longest Yamanouchi prefix of a binary word. St001437The flex of a binary word. St001082The number of boxed occurrences of 123 in a permutation. St000167The number of leaves of an ordered tree. St000271The chromatic index of a graph. St000461The rix statistic of a permutation. St000488The number of cycles of a permutation of length at most 2. St000489The number of cycles of a permutation of length at most 3. St000503The maximal difference between two elements in a common block. St000543The size of the conjugacy class of a binary word. St000625The sum of the minimal distances to a greater element. St000654The first descent of a permutation. St000668The least common multiple of the parts of the partition. St000702The number of weak deficiencies of a permutation. St000727The largest label of a leaf in the binary search tree associated with the permutation. St000873The aix statistic of a permutation. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St000923The minimal number with no two order isomorphic substrings of this length in a permutation. St000947The major index east count of a Dyck path. St001018Sum of projective dimension of the indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001023Number of simple modules with projective dimension at most 3 in the Nakayama algebra corresponding to the Dyck path. St001074The number of inversions of the cyclic embedding of a permutation. 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. 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. St001759The Rajchgot index of a permutation. St000144The pyramid weight of the Dyck path. St000229Sum of the difference between the maximal and the minimal elements of the blocks plus the number of blocks of a set partition. St000240The number of indices that are not small excedances. St000296The length of the symmetric border of a binary word. St000299The number of nonisomorphic vertex-induced subtrees. 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. St000501The size of the first part in the decomposition of a permutation. St000520The number of patterns in a permutation. St000653The last descent of a permutation. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000728The dimension of a set partition. St000730The maximal arc length of a set partition. St000967The value p(1) for the Coxeterpolynomial p of the corresponding LNakayama algebra. St000989The number of final rises of a permutation. St001052The length of the exterior 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. St001218Smallest index k greater than or equal to one such that the Coxeter matrix C of the corresponding Nakayama algebra has C^k=1. St001415The length of the longest palindromic prefix of a binary word. St000030The sum of the descent differences of a permutations. St000209Maximum difference of elements in cycles. St000316The number of non-left-to-right-maxima of a permutation. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000656The number of cuts of a poset. St000837The number of ascents of distance 2 of a permutation. St000932The number of occurrences of the pattern UDU in a Dyck path. St001032The number of horizontal steps in the bicoloured Motzkin path associated with the Dyck path. St001130The number of two successive successions in a permutation. 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. St001391The disjunction number of a graph. St001649The length of a longest trail in a graph. St001827The number of two-component spanning forests of a graph. St001869The maximum cut size of a graph. St000826The stopping time of the decimal representation of the binary word for the 3x+1 problem. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St000080The rank of the poset. St000718The largest Laplacian eigenvalue of a graph if it is integral. St001723The differential of a graph. St001724The 2-packing differential of a graph. St000028The number of stack-sorts needed to sort a permutation. St000056The decomposition (or block) number of a permutation. St000062The length of the longest increasing subsequence of the permutation. St000066The column of the unique '1' in the first row of the alternating sign matrix. St000213The number of weak exceedances (also weak excedences) of a permutation. St000221The number of strong fixed points of a permutation. St000236The number of cyclical small weak excedances. St000239The number of small weak excedances. St000314The number of left-to-right-maxima of a permutation. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000338The number of pixed points of a permutation. St000374The number of exclusive right-to-left minima of a permutation. St000553The number of blocks of a graph. St000632The jump number of the poset. St000703The number of deficiencies of a permutation. St000733The row containing the largest entry of a standard tableau. St000924The number of topologically connected components of a perfect matching. St000991The number of right-to-left minima of a permutation. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St000996The number of exclusive left-to-right maxima of a permutation. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001917The order of toric promotion on the set of labellings of a graph. St000029The depth of a permutation. St000051The size of the left subtree of a binary tree. St000052The number of valleys of a Dyck path not on the x-axis. St000068The number of minimal elements in a poset. St000071The number of maximal chains in a poset. St000210Minimum over maximum difference of elements in cycles. St000224The sorting index of a permutation. St000238The number of indices that are not small weak excedances. St000304The load of a permutation. St000312The number of leaves in a graph. St000446The disorder of a permutation. St000451The length of the longest pattern of the form k 1 2. St000527The width of the poset. St000651The maximal size of a rise in a permutation. St001065Number of indecomposable reflexive modules 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. St001311The cyclomatic 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. St001345The Hamming dimension of a graph. St001579The number of cyclically simple transpositions decreasing the number of cyclic descents needed to sort a permutation. St001726The number of visible inversions of a permutation. St001925The minimal number of zeros in a row of an alternating sign matrix. St000064The number of one-box pattern of a permutation. St000844The size of the largest block in the direct sum decomposition of a permutation. St000906The length of the shortest maximal chain in a poset. St000060The greater neighbor of the maximum. St000197The number of entries equal to positive one in the alternating sign matrix. St000643The size of the largest orbit of antichains under Panyushev complementation. St000956The maximal displacement of a permutation. St000957The number of Bruhat lower covers of a permutation. St000538The number of even inversions of a permutation. St000005The bounce statistic of a Dyck path. St000485The length of the longest cycle of a permutation. St000487The length of the shortest cycle of a permutation. St000673The number of non-fixed points of a permutation. St000719The number of alignments in a perfect matching. St000890The number of nonzero entries in 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. St000216The absolute length of a permutation. St000530The number of permutations with the same descent word as the given permutation. St000619The number of cyclic descents of a permutation. St000652The maximal difference between successive positions of a permutation. St000795The mad of a permutation. St000809The reduced reflection length of the permutation. St000831The number of indices that are either descents or recoils. St001076The minimal length of a factorization of a permutation into transpositions that are cyclic shifts of (12). St001077The prefix exchange distance of a permutation. St001246The maximal difference between two consecutive entries of a permutation. St001480The number of simple summands of the module J^2/J^3. St001782The order of rowmotion on the set of order ideals of a poset. St001875The number of simple modules with projective dimension at most 1. St000354The number of recoils of a permutation. St000435The number of occurrences of the pattern 213 or of the pattern 231 in a permutation. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000829The Ulam distance of a permutation to the identity permutation. St000836The number of descents of distance 2 of a permutation. St001429The number of negative entries in a signed permutation. St001468The smallest fixpoint of a permutation. St000067The inversion number of the alternating sign matrix. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000450The number of edges minus the number of vertices plus 2 of a graph. St001045The number of leaves in the subtree not containing one in the decreasing labelled binary unordered tree associated with the perfect matching. St001117The game chromatic index of a graph. St001132The number of leaves in the subtree whose sister has label 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001401The number of distinct entries in a semistandard tableau. 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. St001817The number of flag weak exceedances of a signed permutation. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St001892The flag excedance statistic of a signed permutation. St000095The number of triangles of a graph. St000235The number of indices that are not cyclical small weak excedances. St000898The number of maximal entries in the last diagonal of the monotone triangle. St001134The largest label in the subtree rooted at the sister of 1 in the leaf labelled binary unordered tree associated with the perfect matching. St001742The difference of the maximal and the minimal degree in a graph. 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. St001255The vector space dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001706The number of closed sets in a graph. St000135The number of lucky cars of the parking function. St000327The number of cover relations in a poset. St001434The number of negative sum pairs of a signed permutation. St000044The number of vertices of the unicellular map given by a perfect matching. St001769The reflection length of a signed permutation. St000186The sum of the first row in a Gelfand-Tsetlin pattern. St000744The length of the path to the largest entry in a standard Young tableau. St001637The number of (upper) dissectors of a poset. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St001948The number of augmented double ascents of a permutation. St001557The number of inversions of the second entry of a permutation. St000176The total number of tiles in the Gelfand-Tsetlin pattern. St000199The column of the unique '1' in the last row of the alternating sign matrix. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000691The number of changes of a binary word. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. 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. St001029The size of the core of a graph. St001108The 2-dynamic chromatic number of a graph. St001316The domatic number of a graph. St001420Half the length of a longest factor which is its own reverse-complement of a binary word. St001494The Alon-Tarsi number of a graph. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001861The number of Bruhat lower covers of a permutation. St000017The number of inversions of a standard tableau. St000035The number of left outer peaks of a permutation. St000778The metric dimension of a graph. St000820The number of compositions obtained by rotating the composition. St000834The number of right outer peaks of a permutation. St000884The number of isolated descents of a permutation. St000896The number of zeros on the main diagonal of an alternating sign matrix. St001668The number of points of the poset minus the width of the poset. St001927Sparre Andersen's number of positives of a signed permutation. St001207The Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001621The number of atoms of a lattice. St001409The maximal entry of a semistandard tableau. 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$. St000168The number of internal nodes of an ordered tree. St001583The projective dimension of the simple module corresponding to the point in the poset of the symmetric group under bruhat order. St001820The size of the image of the pop stack sorting operator. St001555The order of a signed permutation. St001720The minimal length of a chain of small intervals in a lattice. St001926Sparre Andersen's position of the maximum of a signed permutation. St000455The second largest eigenvalue of a graph if it is integral. St000832The number of permutations obtained by reversing blocks of three consecutive numbers. St001645The pebbling number of a connected graph. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St000454The largest eigenvalue of a graph if it is integral. St000741The Colin de Verdière graph invariant. St001623The number of doubly irreducible elements of a lattice. St001626The number of maximal proper sublattices of a lattice. St001581The achromatic number of a graph. 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. St000782The indicator function of whether a given perfect matching is an L & P matching. St000381The largest part of an integer composition. St000845The maximal number of elements covered by an element in a poset. St001644The dimension of a graph. St001812The biclique partition number of a graph. St001118The acyclic chromatic index of a graph. St000264The girth of a graph, which is not a tree. St000767The number of runs in an integer composition. St000903The number of different parts of an integer composition. St000004The major index of a permutation. St000021The number of descents of a permutation. St000053The number of valleys of the Dyck path. St000083The number of left oriented leafs of a binary tree except the first one. St000092The number of outer peaks of a 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. St000166The depth minus 1 of an ordered tree. St000172The Grundy number of a graph. St000211The rank of the set partition. St000251The number of nonsingleton blocks of a set partition. St000325The width of the tree associated to a permutation. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000334The maz index, the major index of a permutation after replacing fixed points by zeros. St000339The maf index of a permutation. St000362The size of a minimal vertex cover of a graph. St000387The matching number of a graph. St000443The number of long tunnels of a Dyck path. St000470The number of runs in a permutation. St000482The (zero)-forcing number of a graph. St000493The los statistic of a set partition. St000499The rcb statistic of a set partition. St000504The cardinality of the first block of a set partition. St000542The number of left-to-right-minima of a permutation. St000552The number of cut vertices of a graph. St000558The number of occurrences of the pattern {{1,2}} in a set partition. St000785The number of distinct colouring schemes of a graph. St000794The mak of a permutation. St000798The makl of a permutation. St000823The number of unsplittable factors of the set partition. St000833The comajor index of a permutation. St000846The maximal number of elements covering an element of a poset. St000925The number of topologically connected components of a set partition. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001062The maximal size of a block of a set partition. St001075The minimal size of a block of a set partition. St001116The game chromatic number of 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. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001220The width of a permutation. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001269The sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation. St001270The bandwidth of a graph. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001489The maximum of the number of descents and the number of inverse descents. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001517The length of a longest pair of twins in a permutation. St001580The acyclic chromatic number of a graph. St001665The number of pure excedances of a permutation. St001667The maximal size of a pair of weak twins for a permutation. St001670The connected partition number of a graph. St001674The number of vertices of the largest induced star graph in the graph. St001692The number of vertices with higher degree than the average degree in a graph. St001729The number of visible descents of a permutation. St001801Half the number of preimage-image pairs of different parity in a permutation. St001874Lusztig's a-function for the symmetric group. St001883The mutual visibility number of a graph. St001962The proper pathwidth of a graph. St000015The number of peaks of a Dyck path. St000024The number of double up and double down steps of a Dyck path. St000094The depth of an ordered tree. St000133The "bounce" of a permutation. St000272The treewidth of a graph. St000358The number of occurrences of the pattern 31-2. St000536The pathwidth of a graph. 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. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St001068Number of torsionless simple modules 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. St001135The projective dimension of the first simple module 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. 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. St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St001277The degeneracy 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. St001358The largest degree of a regular subgraph of a graph. St001366The maximal multiplicity of a degree of a vertex of a graph. St001638The book thickness of a graph. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001792The arboricity of a graph. St001873For a Nakayama algebra corresponding to a Dyck path, we define the matrix C with entries the Hom-spaces between $e_i J$ and $e_j J$ (the radical of the indecomposable projective modules). St001928The number of non-overlapping descents in a permutation. St001963The tree-depth 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}$. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St001404The number of distinct entries in a Gelfand Tsetlin pattern. St001686The order of promotion on a Gelfand-Tsetlin pattern. St000243The number of cyclic valleys and cyclic peaks of a permutation. St000353The number of inner valleys of a permutation. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000739The first entry in the last row of a semistandard tableau. St001114The number of odd descents of a permutation. St000101The cocharge of a semistandard tableau. St001060The distinguishing index of a graph. St001805The maximal overlap of a cylindrical tableau associated with a semistandard tableau. St000681The Grundy value of Chomp on Ferrers diagrams. St000307The number of rowmotion orbits of a poset. St000822The Hadwiger number of the graph. St001330The hat guessing number of a graph. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001642The Prague dimension of a graph. St001734The lettericity of a graph. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001408The number of maximal entries in a semistandard tableau. St001410The minimal entry of a semistandard tableau. St001570The minimal number of edges to add to make a graph Hamiltonian. St000550The number of modular elements of a lattice. St000551The number of left modular elements of a lattice. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St001651The Frankl number of a lattice. St000736The last entry in the first row of a semistandard tableau. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001569The maximal modular displacement of a permutation. St001624The breadth of a lattice. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St000102The charge of a semistandard tableau. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001556The number of inversions of the third entry of a permutation. 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. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St001856The number of edges in the reduced word graph of a permutation. St001877Number of indecomposable injective modules with projective dimension 2. St001960The number of descents of a permutation minus one if its first entry is not one. St001964The interval resolution global dimension of a poset. St000514The number of invariant simple graphs when acting with a permutation of given cycle type. St000515The number of invariant set partitions when acting with a permutation of given cycle type. St000937The number of positive values of the symmetric group character corresponding to the partition. St001002Number of indecomposable modules with projective and injective dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St000284The Plancherel distribution on integer partitions. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000901The cube of the number of standard Young tableaux with shape given by the partition. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001128The exponens consonantiae of a partition. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000936The number of even values of the symmetric group character corresponding to the partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St000940The number of characters of the symmetric group whose value on the partition is zero. St000941The number of characters of the symmetric group whose value on the partition is even. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition.