St000093The cardinality of a maximal independent set of vertices of a graph. St000159The number of distinct parts of the integer partition. St000160The multiplicity of the smallest part of a partition. St000183The side length of the Durfee square of an integer partition. St000259The diameter of a connected graph. St000260The radius of a connected graph. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000480The number of lower covers of a partition in dominance order. St000481The number of upper covers of a partition in dominance order. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000548The number of different non-empty partial sums of an integer partition. St000549The number of odd partial sums of an integer partition. St000741The Colin de Verdière graph invariant. St000783The side length of the largest staircase partition fitting into a partition. St000897The number of different multiplicities of parts of an integer partition. St001071The beta invariant of the graph. St001251The number of parts of a partition that are not congruent 1 modulo 3. St001271The competition number of a graph. St001280The number of parts of an integer partition that are at least two. St001335The cardinality of a minimal cycle-isolating set of a graph. St001340The cardinality of a minimal non-edge isolating set of a graph. St001484The number of singletons of an integer partition. St001512The minimum rank of a graph. St000258The burning number of a graph. St000298The order dimension or Dushnik-Miller dimension of a poset. St000299The number of nonisomorphic vertex-induced subtrees. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000452The number of distinct eigenvalues of a graph. St000453The number of distinct Laplacian eigenvalues of a graph. St000511The number of invariant subsets when acting with a permutation of given cycle type. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000918The 2-limited packing number of a graph. St001093The detour number of a graph. St001315The dissociation 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. St001674The number of vertices of the largest induced star graph in the graph. St001720The minimal length of a chain of small intervals in a lattice. St001734The lettericity of a graph. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St001746The coalition number of a graph. St001792The arboricity of a graph. St000013The height of a Dyck path. St000025The number of initial rises of a Dyck path. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000120The number of left tunnels of a Dyck path. St000142The number of even parts of a partition. St000147The largest part of an integer partition. St000148The number of odd parts of a partition. St000149The number of cells of the partition whose leg is zero and arm is odd. St000185The weighted size of a partition. St000256The number of parts from which one can substract 2 and still get an integer partition. St000290The major index of a binary word. St000291The number of descents of a binary word. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000340The number of non-final maximal constant sub-paths of length greater than one. St000378The diagonal inversion number of an integer partition. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000547The number of even non-empty partial sums of an integer partition. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000628The balance of a binary word. St000671The maximin edge-connectivity for choosing a subgraph. St000745The index of the last row whose first entry is the row number in a standard Young tableau. St000769The major index of a composition regarded as a word. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St000920The logarithmic height of a Dyck path. St000938The number of zeros of the symmetric group character corresponding to the partition. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001092The number of distinct even parts of a partition. St001121The multiplicity of the irreducible representation indexed by the partition in the Kronecker square corresponding to the partition. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001176The size of a partition minus its first part. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001214The aft of an integer partition. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001252Half the sum of the even parts of a partition. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. 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. St001424The number of distinct squares in a binary word. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001485The modular major index of a binary word. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001524The degree of symmetry of a binary word. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001587Half of the largest even part of an integer partition. St001613The binary logarithm of the size of the center of a lattice. St001617The dimension of the space of valuations of a lattice. St001657The number of twos in an integer partition. St001673The degree of asymmetry of an integer composition. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001777The number of weak descents in an integer composition. St001871The number of triconnected components 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). St001931The weak major index of an integer composition regarded as a word. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St001961The sum of the greatest common divisors of all pairs of parts. St000273The domination number of a graph. St000287The number of connected components of a graph. St000346The number of coarsenings of a partition. St000351The determinant of the adjacency matrix of a graph. St000388The number of orbits of vertices of a graph under automorphisms. St000455The second largest eigenvalue of a graph if it is integral. St000544The cop number of a graph. St000553The number of blocks of a graph. St000644The number of graphs with given frequency partition. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000758The length of the longest staircase fitting into an integer composition. St000759The smallest missing part in an integer partition. St000760The length of the longest strictly decreasing subsequence of parts of an integer composition. St000767The number of runs in an integer composition. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000785The number of distinct colouring schemes of a graph. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000814The sum of the entries in the column specified by the partition of the change of basis matrix from elementary symmetric functions to Schur symmetric functions. St000903The number of different parts of an integer composition. St000907The number of maximal antichains of minimal length in a poset. St000916The packing number of a graph. St001111The weak 2-dynamic chromatic number of a graph. St001119The length of a shortest maximal path in a graph. St001120The length of a longest path in a graph. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001257The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. 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. St001345The Hamming dimension of a graph. St001352The number of internal nodes in the modular decomposition of a graph. St001363The Euler characteristic of a graph according to Knill. St001373The logarithm of the number of winning configurations of the lights out game on a graph. St001432The order dimension of the partition. St001463The number of distinct columns in the nullspace of a graph. St001471The magnitude of a Dyck path. St001486The number of corners of the ribbon associated with an integer composition. St001616The number of neutral elements in a lattice. St001716The 1-improper chromatic number of a graph. St001754The number of tolerances of a finite lattice. St001774The degree of the minimal polynomial of the smallest eigenvalue of a graph. St001775The degree of the minimal polynomial of the largest eigenvalue of a graph. St001814The number of partitions interlacing the given partition. St001829The common independence number of a graph. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001951The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. St001955The number of natural descents for set-valued two row standard Young tableaux. St001108The 2-dynamic chromatic number of a graph. St001180Number of indecomposable injective modules with projective dimension at most 1. St000008The major index of the composition. St000011The number of touch points (or returns) of a Dyck path. St000021The number of descents of a permutation. St000023The number of inner peaks of a permutation. St000024The number of double up and double down steps of a Dyck path. St000028The number of stack-sorts needed to sort a permutation. St000035The number of left outer peaks of a permutation. St000052The number of valleys of a Dyck path not on the x-axis. St000053The number of valleys of the Dyck path. St000141The maximum drop size of a permutation. St000143The largest repeated part of a partition. St000150The floored half-sum of the multiplicities of a partition. St000154The sum of the descent bottoms of a permutation. St000155The number of exceedances (also excedences) of a permutation. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000214The number of adjacencies of a permutation. St000234The number of global ascents of a permutation. St000238The number of indices that are not small weak excedances. St000257The number of distinct parts of a partition that occur at least twice. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000271The chromatic index of a graph. St000272The treewidth of a graph. St000292The number of ascents of a binary word. St000293The number of inversions of a binary word. St000295The length of the border of a binary word. St000306The bounce count of a Dyck path. St000310The minimal degree of a vertex of a 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. St000331The number of upper interactions of a Dyck path. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000347The inversion sum of a binary word. St000352The Elizalde-Pak rank of a permutation. St000353The number of inner valleys of a permutation. St000362The size of a minimal vertex cover of a graph. St000374The number of exclusive right-to-left minima of a permutation. St000377The dinv defect of an integer partition. St000386The number of factors DDU in a Dyck path. St000389The number of runs of ones of odd length in a binary word. St000390The number of runs of ones in a binary word. St000427The number of occurrences of the pattern 123 or of the pattern 231 in a permutation. St000441The number of successions of a permutation. St000479The Ramsey number of a graph. St000507The number of ascents of a standard tableau. St000513The number of invariant subsets of size 2 when acting with a permutation of given cycle type. St000536The pathwidth of a graph. St000537The cutwidth of a graph. St000546The number of global descents of a permutation. St000552The number of cut vertices of a graph. St000624The normalized sum of the minimal distances to a greater element. St000650The number of 3-rises of a permutation. St000651The maximal size of a rise in a permutation. St000659The number of rises of length at least 2 of a Dyck path. St000660The number of rises of length at least 3 of a Dyck path. St000662The staircase size of the code of a permutation. St000665The number of rafts of a permutation. St000670The reversal length of a permutation. St000676The number of odd rises of a Dyck path. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000691The number of changes of a binary word. St000703The number of deficiencies of a permutation. St000710The number of big deficiencies of a permutation. St000711The number of big exceedences of a permutation. St000742The number of big ascents of a permutation after prepending zero. St000754The Grundy value for the game of removing nestings in a perfect matching. St000761The number of ascents in an integer composition. St000766The number of inversions of an integer composition. St000778The metric dimension of a graph. St000779The tier of a permutation. St000834The number of right outer peaks of a permutation. St000835The minimal difference in size when partitioning the integer partition into two subpartitions. St000864The number of circled entries of the shifted recording tableau of a permutation. St000871The number of very big ascents of a permutation. St000873The aix statistic of a permutation. St000884The number of isolated descents of a permutation. St000954Number of times the corresponding LNakayama algebra has $Ext^i(D(A),A)=0$ for $i>0$. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama algebra. St000992The alternating sum of the parts of an integer partition. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St000996The number of exclusive left-to-right maxima of a permutation. St001017Number of indecomposable injective modules with projective dimension equal to the codominant dimension in the Nakayama algebra corresponding to the Dyck path. St001021Sum of the differences between projective and codominant dimension of the non-projective indecomposable injective modules in the Nakayama algebra corresponding to the Dyck path. St001026The maximum of the projective dimensions of the indecomposable non-projective injective modules minus the minimum 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. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001037The number of inner corners of the upper path of the parallelogram polyomino associated with the Dyck path. St001055The Grundy value for the game of removing cells of a row in an integer partition. 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. St001090The number of pop-stack-sorts needed to sort a permutation. St001104The number of descents of the invariant in a tensor power of the adjoint representation of the rank two general linear group. St001114The number of odd descents of a permutation. St001115The number of even descents of a permutation. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001152The number of pairs with even minimum in a perfect matching. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001172The number of 1-rises at odd height of a Dyck path. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001204Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001205The number of non-simple indecomposable projective-injective modules of the algebra $eAe$ in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001217The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001263The index of the maximal parabolic seaweed algebra associated with the composition. St001269The sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation. St001270The bandwidth of a graph. St001273The projective dimension of the first term in an injective coresolution of the regular module. St001274The number of indecomposable injective modules with projective dimension equal to two. St001276The number of 2-regular indecomposable modules in the corresponding Nakayama algebra. St001277The degeneracy of a graph. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001358The largest degree of a regular subgraph of a graph. St001394The genus of a permutation. St001395The number of strictly unfriendly partitions of a graph. St001413Half the length of the longest even length palindromic prefix of a binary word. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St001489The maximum of the number of descents and the number of inverse descents. St001502The global dimension minus the dominant dimension of magnitude 1 Nakayama algebras. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001520The number of strict 3-descents. St001579The number of cyclically simple transpositions decreasing the number of cyclic descents needed to sort a permutation. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St001644The dimension of a graph. St001665The number of pure excedances of a permutation. St001689The number of celebrities in a graph. St001691The number of kings in a graph. St001692The number of vertices with higher degree than the average degree in a graph. St001726The number of visible inversions of a permutation. St001729The number of visible descents of a permutation. St001730The number of times the path corresponding to a binary word crosses the base line. St001737The number of descents of type 2 in a permutation. St001743The discrepancy of a graph. St001760The number of prefix or suffix reversals needed to sort a permutation. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St001794Half the number of sets of vertices in a graph which are dominating and non-blocking. St001801Half the number of preimage-image pairs of different parity in a permutation. St001812The biclique partition number of a graph. St001874Lusztig's a-function for the symmetric group. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001928The number of non-overlapping descents in a permutation. St001930The weak major index of a binary word. St001949The rigidity index of a graph. St001962The proper pathwidth of a graph. St000006The dinv of a Dyck path. St000007The number of saliances of the permutation. St000015The number of peaks of a Dyck path. St000031The number of cycles in the cycle decomposition of a permutation. St000054The first entry of the permutation. St000056The decomposition (or block) number of a permutation. St000058The order of a permutation. St000079The number of alternating sign matrices for a given Dyck path. St000092The number of outer peaks of a permutation. St000099The number of valleys of a permutation, including the boundary. St000153The number of adjacent cycles of a permutation. St000172The Grundy number of a graph. St000184The size of the centralizer of any permutation of given cycle type. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000213The number of weak exceedances (also weak excedences) of a permutation. St000240The number of indices that are not small excedances. St000244The cardinality of the automorphism group of a graph. St000276The size of the preimage of the map 'to graph' from Ordered trees to Graphs. St000286The number of connected components of the complement of a graph. St000288The number of ones in a binary word. St000300The number of independent sets of vertices of a graph. St000314The number of left-to-right-maxima of a permutation. St000321The number of integer partitions of n that are dominated by an integer partition. St000325The width of the tree associated to a permutation. St000335The difference of lower and upper interactions. St000345The number of refinements of a partition. St000364The exponent of the automorphism group of a graph. St000381The largest part of an integer composition. St000382The first part of an integer composition. St000383The last part of an integer composition. St000384The maximal part of the shifted composition of an integer partition. St000393The number of strictly increasing runs in a binary word. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000397The Strahler number of a rooted tree. St000443The number of long tunnels of a Dyck path. St000451The length of the longest pattern of the form k 1 2. St000469The distinguishing number of a graph. St000470The number of runs in a permutation. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000542The number of left-to-right-minima of a permutation. St000626The minimal period of a binary word. St000630The length of the shortest palindromic decomposition of a binary word. St000631The number of distinct palindromic decompositions of a binary word. St000636The hull number of a graph. St000645The sum of the areas of the rectangles formed by two consecutive peaks and the valley in between. St000678The number of up steps after the last double rise of a Dyck path. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St000722The number of different neighbourhoods in a graph. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000764The number of strong records in an integer composition. St000765The number of weak records in an integer composition. St000784The maximum of the length and the largest part of the integer partition. St000808The number of up steps of the associated bargraph. St000820The number of compositions obtained by rotating the composition. St000822The Hadwiger number of the graph. St000847The number of standard Young tableaux whose descent set is the binary word. St000862The number of parts of the shifted shape of a permutation. St000876The number of factors in the Catalan decomposition of a binary word. St000883The number of longest increasing subsequences of a permutation. St000917The open packing number of a graph. St000922The minimal number such that all substrings of this length are unique. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000935The number of ordered refinements of an integer partition. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for 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}$. St000983The length of the longest alternating subword. St000991The number of right-to-left minima of a permutation. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001014Number of indecomposable injective modules with codominant dimension equal to the dominant dimension of the Nakayama algebra corresponding to the Dyck path. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001029The size of the core of a graph. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001043The depth of the leaf closest to the root in the binary unordered tree associated with the perfect matching. St001044The number of pairs whose larger element is at most one more than half the size of the perfect matching. St001045The number of leaves in the subtree not containing one in the decreasing labelled binary unordered tree associated with the perfect matching. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001109The number of proper colourings of a graph with as few colours as possible. St001116The game chromatic number of a graph. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001202Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001203We associate to a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n-1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a Dyck path as follows: St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001267The length of the Lyndon factorization of the binary word. St001285The number of primes in the column sums of the two line notation of a permutation. St001299The product of all non-zero projective dimensions of simple modules of the corresponding Nakayama algebra. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001316The domatic number of a graph. St001330The hat guessing number of a graph. St001366The maximal multiplicity of a degree of a vertex of a graph. St001372The length of a longest cyclic run of ones of a binary word. St001389The number of partitions of the same length below the given integer partition. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001437The flex of a binary word. St001461The number of topologically connected components of the chord diagram of a permutation. St001464The number of bases of the positroid corresponding to the permutation, with all fixed points counterclockwise. St001480The number of simple summands of the module J^2/J^3. St001487The number of inner corners of a skew partition. St001488The number of corners of a skew partition. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001494The Alon-Tarsi number of a graph. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001530The depth of a Dyck path. St001580The acyclic chromatic number of a graph. St001581The achromatic number of a graph. St001600The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple graphs. St001608The number of coloured rooted trees such that the multiplicities of colours are given by a partition. St001649The length of a longest trail in a graph. St001652The length of a longest interval of consecutive numbers. St001654The monophonic hull number of a graph. St001655The general position number of a graph. St001656The monophonic position number of a graph. St001661Half the permanent of the Identity matrix plus the permutation matrix associated to the permutation. St001662The length of the longest factor of consecutive numbers in a permutation. St001670The connected partition number of a graph. St001706The number of closed sets in a graph. St001732The number of peaks visible from the left. St001733The number of weak left to right maxima of a Dyck path. St001784The minimum of the smallest closer and the second element of the block containing 1 in a set partition. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001786The number of total orderings of the north steps of a Dyck path such that steps after the k-th east step are not among the first k positions in the order. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St001806The upper middle entry of a permutation. St001807The lower middle entry of a permutation. St001809The index of the step at the first peak of maximal height in a Dyck path. St001844The maximal degree of a generator of the invariant ring of the automorphism group of a graph. St001883The mutual visibility number of a graph. St001884The number of borders of a binary word. St001963The tree-depth of a graph. St000144The pyramid weight of the Dyck path. St000380Half of the maximal perimeter of a rectangle fitting into the diagram of an integer partition. St000439The position of the first down step of a Dyck path. St000495The number of inversions of distance at most 2 of a permutation. St000638The number of up-down runs of a permutation. St000675The number of centered multitunnels of a Dyck path. St000725The smallest label of a leaf of the increasing binary tree associated to a permutation. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001049The smallest label in the subtree not containing 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001166Number of indecomposable projective non-injective modules with dominant dimension equal to the global dimension plus the number of indecomposable projective injective modules in the corresponding Nakayama algebra. St001179Number of indecomposable injective modules with projective dimension at most 2 in the corresponding Nakayama algebra. 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. St001237The number of simple modules with injective dimension at most one or dominant dimension at least one. St001288The number of primes obtained by multiplying preimage and image of a permutation and adding one. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001391The disjunction number of a graph. 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. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). 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. St001211The number of simple modules in the corresponding Nakayama algebra that have vanishing second Ext-group with the regular module. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000928The sum of the coefficients of the character polynomial of an integer partition. St001101The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for increasing trees. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St001621The number of atoms of a lattice. St001624The breadth of a lattice. St001060The distinguishing index of a graph. St000216The absolute length of a permutation. St000251The number of nonsingleton blocks of a set partition. St000253The crossing number of a set partition. St000254The nesting number of a set partition. St000354The number of recoils of a permutation. St000442The maximal area to the right of an up step of a Dyck path. St000454The largest eigenvalue of a graph if it is integral. St000539The number of odd inversions of a permutation. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000658The number of rises of length 2 of a Dyck path. St000677The standardized bi-alternating inversion number of a permutation. St000683The number of points below the Dyck path such that the diagonal to the north-east hits the path between two down steps, and the diagonal to the north-west hits the path between two up steps. St000730The maximal arc length of a set partition. St000809The reduced reflection length of the permutation. St000829The Ulam distance of a permutation to the identity permutation. St000874The position of the last double rise in a Dyck path. St000919The number of maximal left branches of a binary tree. St000934The 2-degree of an integer partition. St000946The sum of the skew hook positions in a Dyck path. St000976The sum of the positions of double up-steps of a Dyck path. St001061The number of indices that are both descents and recoils of a permutation. St001076The minimal length of a factorization of a permutation into transpositions that are cyclic shifts of (12). St001080The minimal length of a factorization of a permutation using the transposition (12) and the cycle (1,. St001139The number of occurrences of hills of size 2 in a Dyck path. St001569The maximal modular displacement of a permutation. St001859The number of factors of the Stanley symmetric function associated with a permutation. St000444The length of the maximal rise of a Dyck path. St000485The length of the longest cycle of a permutation. St000489The number of cycles of a permutation of length at most 3. St000668The least common multiple of the parts of the partition. St000702The number of weak deficiencies of a permutation. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000818The sum of the entries in the column specified by the composition of the change of basis matrix from quasisymmetric Schur functions to monomial quasisymmetric functions. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St000933The number of multipartitions of sizes given by an integer partition. St001498The normalised height of a Nakayama algebra with magnitude 1. St000137The Grundy value of an integer partition. St000466The Gutman (or modified Schultz) index of a connected graph. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001525The number of symmetric hooks on the diagonal of a partition. St001593This is the number of standard Young tableaux of the given shifted shape. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001939The number of parts that are equal to their multiplicity in the integer partition. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. 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. 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$. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000344The number of strongly connected outdegree sequences of a graph. St000349The number of different adjacency matrices of a graph. St000618The number of self-evacuating tableaux of given shape. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000775The multiplicity of the largest eigenvalue in a graph. St000781The number of proper colouring schemes of a Ferrers diagram. St001057The Grundy value of the game of creating an independent set in a graph. St001070The absolute value of the derivative of the chromatic polynomial of the graph at 1. St001095The number of non-isomorphic posets with precisely one further covering relation. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001272The number of graphs with the same degree sequence. St001282The number of graphs with the same chromatic polynomial. St001283The number of finite solvable groups that are realised by the given partition over the complex numbers. St001284The number of finite groups that are realised by the given partition over the complex numbers. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001383The BG-rank of an integer partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001476The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,-1). St001496The number of graphs with the same Laplacian spectrum as the given graph. St001518The number of graphs with the same ordinary spectrum as the given graph. St001562The value of the complete homogeneous symmetric function evaluated at 1. St001563The value of the power-sum symmetric function evaluated at 1. St001564The value of the forgotten symmetric functions when all variables set to 1. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001739The number of graphs with the same edge polytope as the given graph. St001740The number of graphs with the same symmetric edge polytope as the given graph. St001765The number of connected components of the friends and strangers graph. St001776The degree of the minimal polynomial of the largest Laplacian eigenvalue of a graph. St001780The order of promotion on the set of standard tableaux of given shape. St001828The Euler characteristic of a graph. St001890The maximum magnitude of the Möbius function of a poset. 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. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001917The order of toric promotion on the set of labellings of a graph. St001924The number of cells in an integer partition whose arm and leg length coincide. St001933The largest multiplicity of a part in an integer partition. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St001957The number of Hasse diagrams with a given underlying undirected graph. St000003The number of standard Young tableaux of the partition. St000026The position of the first return of a Dyck path. St000032The number of elements smaller than the given Dyck path in the Tamari Order. St000038The product of the heights of the descending steps of a Dyck path. St000046The largest eigenvalue of the random to random operator acting on the simple module corresponding to the given partition. St000047The number of standard immaculate tableaux of a given shape. St000048The multinomial of the parts of a partition. St000049The number of set partitions whose sorted block sizes correspond to the partition. St000063The number of linear extensions of a certain poset defined for an integer partition. St000075The orbit size of a standard tableau under promotion. St000086The number of subgraphs. St000088The row sums of the character table of the symmetric group. St000108The number of partitions contained in the given partition. St000117The number of centered tunnels of a Dyck path. St000179The product of the hook lengths of the integer partition. St000182The number of permutations whose cycle type is the given integer partition. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000212The number of standard Young tableaux for an integer partition such that no two consecutive entries appear in the same row. St000266The number of spanning subgraphs of a graph with the same connected components. St000267The number of maximal spanning forests contained in a graph. St000268The number of strongly connected orientations of a graph. St000269The number of acyclic orientations of a graph. St000270The number of forests contained in a graph. St000275Number of permutations whose sorted list of non zero multiplicities of the Lehmer code is the given partition. St000277The number of ribbon shaped standard tableaux. St000278The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. St000283The size of the preimage of the map 'to graph' from Binary trees to Graphs. St000284The Plancherel distribution on integer partitions. St000289The decimal representation of a binary word. St000296The length of the symmetric border of a binary word. St000297The number of leading ones in a binary word. St000315The number of isolated vertices of a graph. St000326The position of the first one in a binary word after appending a 1 at the end. St000343The number of spanning subgraphs of a graph. St000363The number of minimal vertex covers of a graph. St000369The dinv deficit of a Dyck path. St000379The number of Hamiltonian cycles in a graph. St000391The sum of the positions of the ones in a binary word. St000392The length of the longest run of ones in a binary word. St000468The Hosoya index of a graph. St000475The number of parts equal to 1 in a partition. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000517The Kreweras number of an integer partition. St000524The number of posets with the same order polynomial. St000525The number of posets with the same zeta polynomial. St000526The number of posets with combinatorially isomorphic order polytopes. St000529The number of permutations whose descent word is the given binary word. St000531The leading coefficient of the rook polynomial of an integer partition. St000532The total number of rook placements on a Ferrers board. St000543The size of the conjugacy class of a binary word. St000627The exponent of a binary word. St000655The length of the minimal rise of a Dyck path. St000657The smallest part of an integer composition. St000667The greatest common divisor of the parts of the partition. St000680The Grundy value for Hackendot on posets. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000699The toughness times the least common multiple of 1,. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000705The number of semistandard tableaux on a given integer partition of n with maximal entry n. St000706The product of the factorials of the multiplicities of an integer partition. St000712The number of semistandard Young tableau of given shape, with entries at most 4. St000715The number of semistandard Young tableaux of given shape and entries at most 3. St000717The number of ordinal summands of a poset. St000733The row containing the largest entry of a standard tableau. St000738The first entry in the last row of a standard tableau. St000753The Grundy value for the game of Kayles on a binary word. St000762The sum of the positions of the weak records of an integer composition. St000763The sum of the positions of the strong records of an integer composition. St000792The Grundy value for the game of ruler on a binary word. St000805The number of peaks of the associated bargraph. St000810The sum of the entries in the column specified by the partition of the change of basis matrix from powersum symmetric functions to monomial symmetric functions. St000811The sum of the entries in the column specified by the partition of the change of basis matrix from powersum symmetric functions to Schur symmetric functions. St000812The sum of the entries in the column specified by the partition of the change of basis matrix from complete homogeneous symmetric functions to monomial symmetric functions. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000816The number of standard composition tableaux of the composition. St000817The sum of the entries in the column specified by the composition of the change of basis matrix from dual immaculate quasisymmetric functions to monomial quasisymmetric functions. St000885The number of critical steps in the Catalan decomposition of a binary word. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000905The number of different multiplicities of parts of an integer composition. St000906The length of the shortest maximal chain in a poset. St000913The number of ways to refine the partition into singletons. St000914The sum of the values of the Möbius function of a poset. St000929The constant term of the character polynomial of an integer partition. St000932The number of occurrences of the pattern UDU in a Dyck path. St000941The number of characters of the symmetric group whose value on the partition is even. St000964Gives the dimension of Ext^g(D(A),A) of the corresponding LNakayama algebra, when g denotes the global dimension of that algebra. St000965The sum of the dimension of Ext^i(D(A),A) for i=1,. St000972The composition number of a graph. St000982The length of the longest constant subword. St000986The multiplicity of the eigenvalue zero of the adjacency matrix of the graph. St000993The multiplicity of the largest part of an integer partition. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. 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. St001013Number of indecomposable injective modules with codominant dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001015Number of indecomposable injective modules with codominant dimension equal to one in the Nakayama algebra corresponding to the Dyck path. St001016Number of indecomposable injective modules with codominant dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001063Numbers of 3-torsionfree simple modules in the corresponding Nakayama algebra. St001064Number of simple modules in the corresponding Nakayama algebra that are 3-syzygy modules. 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. St001072The evaluation of the Tutte polynomial of the graph at x and y equal to 3. St001073The number of nowhere zero 3-flows of a graph. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. St001110The 3-dynamic chromatic number of a graph. St001112The 3-weak dynamic number of a graph. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001128The exponens consonantiae of a partition. St001129The product of the squares of the parts of a partition. St001159Number of simple modules with dominant dimension equal to the global dimension in the corresponding Nakayama algebra. St001191Number of simple modules $S$ with $Ext_A^i(S,A)=0$ for all $i=0,1,...,g-1$ in the corresponding Nakayama algebra $A$ with global dimension $g$. St001196The global dimension of $A$ minus the global dimension of $eAe$ for the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. 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. 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. St001249Sum of the odd parts of a partition. St001256Number of simple reflexive modules that are 2-stable reflexive. St001289The vector space dimension of the n-fold tensor product of D(A), where n is maximal such that this n-fold tensor product is nonzero. 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. St001303The number of dominating sets of vertices of a graph. St001313The number of Dyck paths above the lattice path given by a binary word. St001353The number of prime nodes in the modular decomposition of a graph. St001356The number of vertices in prime modules of a graph. St001365The number of lattice paths of the same length weakly above the path given by a binary word. St001367The smallest number which does not occur as degree of a vertex in a graph. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001385The number of conjugacy classes of subgroups with connected subgroups of sizes prescribed by an integer partition. St001386The number of prime labellings of a graph. St001387Number of standard Young tableaux of the skew shape tracing the border of the given partition. St001400The total number of Littlewood-Richardson tableaux of given shape. 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. St001474The evaluation of the Tutte polynomial of the graph at (x,y) equal to (2,-1). St001475The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,0). St001477The number of nowhere zero 5-flows of a graph. St001478The number of nowhere zero 4-flows of a graph. St001481The minimal height of a peak of a Dyck path. St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St001490The number of connected components of a skew partition. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001527The cyclic permutation representation number of an integer partition. St001546The number of monomials in the Tutte polynomial of a graph. St001561The value of the elementary symmetric function evaluated at 1. St001568The smallest positive integer that does not appear twice in the partition. St001571The Cartan determinant of the integer partition. St001591The number of graphs with the given composition of multiplicities of Laplacian eigenvalues. St001595The number of standard Young tableaux of the skew partition. St001597The Frobenius rank of a skew partition. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001612The number of coloured multisets of cycles such that the multiplicities of colours are given by a partition. St001627The number of coloured connected graphs such that the multiplicities of colours are given by a partition. St001651The Frankl number of a lattice. St001659The number of ways to place as many non-attacking rooks as possible on a Ferrers board. St001672The restrained domination number of a graph. St001694The number of maximal dissociation sets in 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. St001710The number of permutations such that conjugation with a permutation of given cycle type yields the inverse permutation. St001711The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. St001722The number of minimal chains with small intervals between a binary word and the top element. St001725The harmonious chromatic number of a graph. St001763The Hurwitz number of an integer partition. St001795The binary logarithm of the evaluation of the Tutte polynomial of the graph at (x,y) equal to (-1,-1). St001838The number of nonempty primitive factors of a binary word. St001845The number of join irreducibles minus the rank of a lattice. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001910The height of the middle non-run of a Dyck path. St001915The size of the component corresponding to a necklace in Bulgarian solitaire. St001929The number of meanders with top half given by the noncrossing matching corresponding to the Dyck path. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001938The number of transitive monotone factorizations of genus zero of a permutation of given cycle type. St001956The comajor index for set-valued two-row standard Young tableaux. St000005The bounce statistic of a Dyck path. St000012The area of a Dyck path. St000014The number of parking functions supported by a Dyck path. St000087The number of induced subgraphs. St000096The number of spanning trees of a graph. St000285The size of the preimage of the map 'to inverse des composition' from Parking functions to Integer compositions. St000309The number of vertices with even degree. St000376The bounce deficit of a Dyck path. St000418The number of Dyck paths that are weakly below a Dyck path. St000419The number of Dyck paths that are weakly above the Dyck path, except for the path itself. St000421The number of Dyck paths that are weakly below a Dyck path, except for the path itself. St000450The number of edges minus the number of vertices plus 2 of a graph. St000456The monochromatic index of a connected graph. St000478Another weight of a partition according to Alladi. St000482The (zero)-forcing number of a graph. St000509The diagonal index (content) of a partition. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000567The sum of the products of all pairs of parts. St000674The number of hills of a Dyck path. St000681The Grundy value of Chomp on Ferrers diagrams. St000685The dominant dimension of the LNakayama algebra associated to a Dyck path. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000734The last entry in the first row of a standard tableau. St000735The last entry on the main diagonal of a standard tableau. St000770The major index of an integer partition when read from bottom to top. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000776The maximal multiplicity of an eigenvalue in a graph. St000790The number of pairs of centered tunnels, one strictly containing the other, of a Dyck path. St000791The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. St000815The number of semistandard Young tableaux of partition weight of given shape. St000877The depth of the binary word interpreted as a path. 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. St000921The number of internal inversions of a binary word. St000926The clique-coclique number of a graph. St000937The number of positive values of the symmetric group character corresponding to the partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St000940The number of characters of the symmetric group whose value on the partition is zero. St000947The major index east count of a Dyck path. St000948The chromatic discriminant of a graph. St000984The number of boxes below precisely one peak. St001008Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. 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. St001126Number of simple module that are 1-regular in the corresponding Nakayama algebra. St001161The major index north count of a Dyck path. St001164Number of indecomposable injective modules whose socle has projective dimension at most g-1 (g the global dimension) minus the number of indecomposable projective-injective modules. 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. St001182Number of indecomposable injective modules with codominant dimension at least two in the corresponding Nakayama algebra. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001255The vector space dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. St001281The normalized isoperimetric number of a graph. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001312Number of parabolic noncrossing partitions indexed by the composition. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001342The number of vertices in the center of a graph. St001368The number of vertices of maximal degree in a graph. St001441The number of non-empty connected induced subgraphs of a graph. St001462The number of factors of a standard tableaux under concatenation. St001473The absolute value of the sum of all entries of the Coxeter matrix of the corresponding LNakayama algebra. St001501The dominant dimension of magnitude 1 Nakayama algebras. St001531Number of partial orders contained in the poset determined by the Dyck path. St001584The area statistic between a Dyck path and its bounce path. St001592The maximal number of simple paths between any two different vertices of a graph. St001602The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on endofunctions. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001643The Frobenius dimension of the Nakayama algebra corresponding to the Dyck path. St001675The number of parts equal to the part in the reversed composition. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001721The degree of a binary word. St001757The number of orbits of toric promotion on a graph. St001758The number of orbits of promotion on a graph. St001796The absolute value of the quotient of the Tutte polynomial of the graph at (1,1) and (-1,-1). St001802The number of endomorphisms of a graph. St001816Eigenvalues of the top-to-random operator acting on a simple module. St001872The number of indecomposable injective modules with even projective dimension in the corresponding Nakayama algebra. St001959The product of the heights of the peaks of a Dyck path. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St000302The determinant of the distance matrix of a connected graph. St000467The hyper-Wiener index of a connected graph. St001877Number of indecomposable injective modules with projective dimension 2. St000422The energy of a graph, if it is integral. St001626The number of maximal proper sublattices of a lattice. St000145The Dyson rank of a partition. St000228The size of a partition. St000459The hook length of the base cell of a partition. St000519The largest length of a factor maximising the subword complexity. St000867The sum of the hook lengths in the first row of an integer partition. St000869The sum of the hook lengths of an integer partition. St000878The number of ones minus the number of zeros of a binary word. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001091The number of parts in an integer partition whose next smaller part has the same size. St001127The sum of the squares of the parts of a partition. 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. St001541The Gini index of an integer partition. St001614The cyclic permutation representation number of a skew partition. St001697The shifted natural comajor index of a standard Young tableau. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001932The number of pairs of singleton blocks in the noncrossing set partition corresponding to a Dyck path, that can be merged to create another noncrossing set partition.