St001399The distinguishing number of a poset. St001779The order of promotion on the set of linear extensions of a poset. St000081The number of edges of a graph. St000142The number of even parts of a partition. St000145The Dyson rank of a partition. St000149The number of cells of the partition whose leg is zero and arm is odd. St000171The degree of the graph. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000185The weighted size of a partition. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000256The number of parts from which one can substract 2 and still get an integer partition. St000263The Szeged index of a graph. St000265The Wiener index of a graph. St000272The treewidth of a graph. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000361The second Zagreb index of a graph. St000362The size of a minimal vertex cover of a graph. St000387The matching number of a graph. St000454The largest eigenvalue of a graph if it is integral. 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. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000513The number of invariant subsets of size 2 when acting with a permutation of given cycle type. St000535The rank-width of a graph. St000536The pathwidth of a graph. St000537The cutwidth of a graph. St000547The number of even non-empty partial sums of an integer partition. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001071The beta invariant of the graph. St001092The number of distinct even parts of a partition. St001117The game chromatic index of a graph. St001120The length of a longest path in a graph. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001175The size of a partition minus the hook length of the base cell. St001176The size of a partition minus its first part. St001214The aft of an integer partition. St001251The number of parts of a partition that are not congruent 1 modulo 3. St001252Half the sum of the even parts of a partition. St001270The bandwidth of a graph. St001277The degeneracy of a graph. St001280The number of parts of an integer partition that are at least two. St001305The number of induced cycles on four vertices in a graph. 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. St001324The minimal number of occurrences of the chordal-pattern in a linear ordering of the vertices of the graph. St001326The minimal number of occurrences of the interval-pattern in a linear ordering of the vertices of the graph. St001331The size of the minimal feedback vertex set. St001333The cardinality of a minimal edge-isolating set of a graph. St001335The cardinality of a minimal cycle-isolating set of a graph. St001341The number of edges in the center of a graph. St001349The number of different graphs obtained from the given graph by removing an edge. St001354The number of series nodes in the modular decomposition of a graph. St001358The largest degree of a regular subgraph of a graph. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001393The induced matching number of a graph. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001479The number of bridges of a graph. St001512The minimum rank of a graph. St001525The number of symmetric hooks on the diagonal of a partition. St001541The Gini index of an integer partition. St001574The minimal number of edges to add or remove to make a graph regular. St001576The minimal number of edges to add or remove to make a graph vertex transitive. St001587Half of the largest even part of an integer partition. St001638The book thickness of a graph. St001644The dimension of a graph. St001646The number of edges that can be added without increasing the maximal degree of a graph. St001649The length of a longest trail in a graph. St001657The number of twos in an integer partition. St001736The total number of cycles in a graph. St001742The difference of the maximal and the minimal degree in a graph. St001743The discrepancy of a graph. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001792The arboricity of a graph. St001812The biclique partition number of a graph. St001826The maximal number of leaves on a vertex of a graph. St001869The maximum cut size of a graph. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001961The sum of the greatest common divisors of all pairs of parts. St001962The proper pathwidth of a graph. St000010The length of the partition. St000086The number of subgraphs. St000088The row sums of the character table of the symmetric group. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000146The Andrews-Garvan crank of a partition. St000147The largest part of an integer partition. St000159The number of distinct parts of the integer partition. St000172The Grundy number of a graph. St000179The product of the hook lengths of the integer partition. St000183The side length of the Durfee square of an integer partition. St000184The size of the centralizer of any permutation of given cycle type. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000228The size of a partition. St000269The number of acyclic orientations of a graph. St000270The number of forests contained in a graph. St000278The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. St000299The number of nonisomorphic vertex-induced subtrees. St000321The number of integer partitions of n that are dominated by an integer partition. St000343The number of spanning subgraphs of a graph. St000345The number of refinements of a partition. St000346The number of coarsenings of a partition. St000363The number of minimal vertex covers of a graph. St000378The diagonal inversion number of an integer partition. St000384The maximal part of the shifted composition of an integer partition. St000388The number of orbits of vertices of a graph under automorphisms. St000450The number of edges minus the number of vertices plus 2 of a graph. St000453The number of distinct Laplacian eigenvalues of a graph. St000459The hook length of the base cell of a partition. St000460The hook length of the last cell along the main diagonal of an integer partition. St000468The Hosoya index of a graph. St000482The (zero)-forcing number of a graph. St000531The leading coefficient of the rook polynomial of an integer partition. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000544The cop number of a graph. St000644The number of graphs with given frequency partition. St000667The greatest common divisor of the parts of the partition. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000783The side length of the largest staircase partition fitting into a partition. St000784The maximum of the length and the largest part of the integer partition. St000785The number of distinct colouring schemes of a graph. 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. 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. 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. St000822The Hadwiger number of the graph. St000835The minimal difference in size when partitioning the integer partition into two subpartitions. St000870The product of the hook lengths of the diagonal cells in an integer partition. St000935The number of ordered refinements of an integer partition. St000972The composition number of a graph. St000992The alternating sum of the parts of an integer partition. St001029The size of the core of a graph. St001055The Grundy value for the game of removing cells of a row in an integer partition. St001093The detour number of a graph. St001108The 2-dynamic chromatic number of a graph. St001110The 3-dynamic chromatic number of a graph. St001116The game chromatic number of a graph. St001121The multiplicity of the irreducible representation indexed by the partition in the Kronecker square corresponding to the partition. St001261The Castelnuovo-Mumford regularity of a graph. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001330The hat guessing number of a graph. St001352The number of internal nodes in the modular decomposition of a graph. St001360The number of covering relations in Young's lattice below a partition. St001367The smallest number which does not occur as degree of a vertex in a graph. St001378The product of the cohook lengths of the integer partition. St001380The number of monomer-dimer tilings of a Ferrers diagram. St001389The number of partitions of the same length below the given integer partition. St001432The order dimension of the partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001474The evaluation of the Tutte polynomial of the graph at (x,y) equal to (2,-1). St001476The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,-1). St001484The number of singletons of an integer partition. St001494The Alon-Tarsi number of a graph. St001527The cyclic permutation representation number of an integer partition. St001571The Cartan determinant of the integer partition. 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. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001607The number of coloured graphs such that the multiplicities of colours are given by a partition. St001611The number of multiset partitions such that the multiplicities of elements are given by a partition. St001612The number of coloured multisets of cycles such that the multiplicities of colours are given by a partition. St001659The number of ways to place as many non-attacking rooks as possible on a Ferrers board. St001670The connected partition number of a graph. St001674The number of vertices of the largest induced star graph in the graph. St001710The number of permutations such that conjugation with a permutation of given cycle type yields the inverse permutation. St001725The harmonious chromatic number of a graph. St001734The lettericity of a graph. St001796The absolute value of the quotient of the Tutte polynomial of the graph at (1,1) and (-1,-1). St001883The mutual visibility number of a graph. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001924The number of cells in an integer partition whose arm and leg length coincide. St001951The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. St001963The tree-depth of a graph. St000063The number of linear extensions of a certain poset defined for an integer partition. St000108The number of partitions contained in the given partition. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000380Half of the maximal perimeter of a rectangle fitting into the diagram of an integer partition. St000532The total number of rook placements on a Ferrers board. St001400The total number of Littlewood-Richardson tableaux of given shape. St001814The number of partitions interlacing the given partition. St000008The major index of the composition. St000012The area of a Dyck path. St000024The number of double up and double down steps of a Dyck path. St000052The number of valleys of a Dyck path not on the x-axis. St000059The inversion number of a standard tableau as defined by Haglund and Stevens. St000143The largest repeated part of a partition. St000148The number of odd parts of a partition. St000150The floored half-sum of the multiplicities of a partition. St000157The number of descents of a standard tableau. St000160The multiplicity of the smallest part of a partition. St000169The cocharge of a standard tableau. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000225Difference between largest and smallest parts in a partition. St000257The number of distinct parts of a partition that occur at least twice. St000259The diameter of a connected graph. St000260The radius of a connected graph. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000274The number of perfect matchings of a graph. St000292The number of ascents of a binary word. St000310The minimal degree of a vertex of a graph. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000330The (standard) major index of a standard tableau. St000336The leg major index of a standard tableau. St000340The number of non-final maximal constant sub-paths of length greater than one. St000377The dinv defect of an integer partition. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000448The number of pairs of vertices of a graph with distance 2. St000466The Gutman (or modified Schultz) index of a connected graph. St000475The number of parts equal to 1 in a partition. St000519The largest length of a factor maximising the subword complexity. St000548The number of different non-empty partial sums of an integer partition. St000549The number of odd partial sums of an integer partition. St000671The maximin edge-connectivity for choosing a subgraph. St000741The Colin de Verdière graph invariant. St000761The number of ascents in an integer composition. St000766The number of inversions of an integer composition. St000769The major index of a composition regarded as a word. St000778The metric dimension of a graph. St000867The sum of the hook lengths in the first row of an integer partition. St000869The sum of the hook lengths of an integer partition. St000897The number of different multiplicities of parts of an integer partition. St001022Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to 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. St001056The Grundy value for the game of deleting vertices of a graph until it has no edges. St001091The number of parts in an integer partition whose next smaller part has the same size. St001104The number of descents of the invariant in a tensor power of the adjoint representation of the rank two general linear group. St001119The length of a shortest maximal path in a graph. St001127The sum of the squares of the parts of a partition. 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. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001194The injective dimension of $A/AfA$ in the corresponding Nakayama algebra $A$ when $Af$ is the minimal faithful projective-injective left $A$-module St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. 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. St001271The competition number of a graph. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001319The minimal number of occurrences of the star-pattern in a linear ordering of the vertices of the graph. St001323The independence gap of a graph. St001328The minimal number of occurrences of the bipartite-pattern in a linear ordering of the vertices of the graph. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001340The cardinality of a minimal non-edge isolating set of a graph. St001345The Hamming dimension of a graph. St001347The number of pairs of vertices of a graph having the same neighbourhood. St001357The maximal degree of a regular spanning subgraph of a graph. St001362The normalized Knill dimension of a graph. St001391The disjunction number of a graph. St001395The number of strictly unfriendly partitions of a graph. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001521Half the total irregularity of a graph. St001575The minimal number of edges to add or remove to make a graph edge transitive. St001588The number of distinct odd parts smaller than the largest even part in an integer partition. St001647The number of edges that can be added without increasing the clique number. St001648The number of edges that can be added without increasing the chromatic number. St001673The degree of asymmetry of an integer composition. St001697The shifted natural comajor index of a standard Young tableau. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001712The number of natural descents of a standard Young tableau. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001777The number of weak descents in an integer composition. St001783The number of odd automorphisms of a graph. St001794Half the number of sets of vertices in a graph which are dominating and non-blocking. St001799The number of proper separations of a graph. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001827The number of two-component spanning forests 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. St001940The number of distinct parts that are equal to their multiplicity in the integer partition. St001949The rigidity index of a graph. St000013The height 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. St000048The multinomial of the parts of a partition. St000053The number of valleys of the Dyck path. St000087The number of induced subgraphs. St000093The cardinality of a maximal independent set of vertices of a graph. St000244The cardinality of the automorphism group of a graph. St000258The burning number of a graph. St000273The domination number of a graph. St000283The size of the preimage of the map 'to graph' from Binary trees to Graphs. St000286The number of connected components of the complement of a graph. St000287The number of connected components of a graph. St000288The number of ones in a binary word. St000291The number of descents of a binary word. St000306The bounce count of a Dyck path. St000335The difference of lower and upper interactions. St000364The exponent of the automorphism group of a graph. St000389The number of runs of ones of odd length in a binary word. St000390The number of runs of ones in a binary word. St000443The number of long tunnels of a Dyck path. St000452The number of distinct eigenvalues of a graph. St000456The monochromatic index of a connected graph. St000469The distinguishing number of a graph. St000479The Ramsey number of a graph. St000511The number of invariant subsets when acting with a permutation of given cycle type. St000553The number of blocks of a graph. St000636The hull number of a graph. St000668The least common multiple of the parts of the partition. St000675The number of centered multitunnels of a Dyck path. St000722The number of different neighbourhoods in a graph. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000733The row containing the largest entry of a standard tableau. St000738The first entry in the last row of a standard tableau. St000745The index of the last row whose first entry is the row number in a standard Young tableau. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. 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. St000764The number of strong records in an integer composition. St000765The number of weak records in an integer composition. St000767The number of runs in an integer composition. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. 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. St000820The number of compositions obtained by rotating the composition. 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. St000903The number of different parts of an integer composition. St000916The packing number of a graph. St000917The open packing number of a graph. St000918The 2-limited packing number of a graph. St000926The clique-coclique number of a graph. St000948The chromatic discriminant of a graph. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001057The Grundy value of the game of creating an independent set in a graph. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. St001109The number of proper colourings of a graph with as few colours as possible. St001128The exponens consonantiae of a partition. 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. St001197The global dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001249Sum of the odd parts of a partition. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001286The annihilation number of a graph. St001315The dissociation number of a graph. St001316The domatic 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. 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. St001342The number of vertices in the center of a graph. St001363The Euler characteristic of a graph according to Knill. St001366The maximal multiplicity of a degree of a vertex of a graph. St001368The number of vertices of maximal degree in a graph. St001373The logarithm of the number of winning configurations of the lights out game on a graph. St001387Number of standard Young tableaux of the skew shape tracing the border of the given partition. St001463The number of distinct columns in the nullspace of a graph. St001475The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,0). St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001592The maximal number of simple paths between any two different vertices of a graph. St001608The number of coloured rooted trees such that the multiplicities of colours are given by a partition. St001642The Prague dimension of a graph. St001645The pebbling number of a connected graph. St001654The monophonic hull number of a graph. St001655The general position number of a graph. St001656The monophonic position number of a graph. 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. St001732The number of peaks visible from the left. St001746The coalition number of a graph. St001757The number of orbits of toric promotion on a graph. St001758The number of orbits of promotion on a graph. 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. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001802The number of endomorphisms of a graph. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St001828The Euler characteristic of a graph. St001829The common independence number of a graph. St001844The maximal degree of a generator of the invariant ring of the automorphism group of a graph. St001884The number of borders of a binary word. 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. St001917The order of toric promotion on the set of labellings of a graph. St001933The largest multiplicity of a part in an integer partition. St000300The number of independent sets of vertices of a graph. St000301The number of facets of the stable set polytope of a graph. 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. St000983The length of the longest alternating subword. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. 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: 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. St001568The smallest positive integer that does not appear twice in the partition. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001166Number of indecomposable projective non-injective modules with dominant dimension equal to the global dimension plus the number of indecomposable projective injective modules in the corresponding Nakayama algebra. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St000848The balance constant multiplied with the number of linear extensions of a poset. St000849The number of 1/3-balanced pairs in a poset. St000850The number of 1/2-balanced pairs in a poset. St000100The number of linear extensions of a poset. St000633The size of the automorphism group of a poset. St000640The rank of the largest boolean interval in a poset. St000910The number of maximal chains of minimal length in a poset. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. 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. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St000095The number of triangles of a graph. St000117The number of centered tunnels of a Dyck path. St000303The determinant of the product of the incidence matrix and its transpose of a graph divided by $4$. St000421The number of Dyck paths that are weakly below a Dyck path, except for the path itself. St000442The maximal area to the right of an up step of a Dyck path. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000658The number of rises of length 2 of a Dyck path. St000659The number of rises of length at least 2 of a Dyck path. 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. St000693The modular (standard) major index of a standard tableau. St000940The number of characters of the symmetric group whose value on the partition is zero. St000984The number of boxes below precisely one peak. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001139The number of occurrences of hills of size 2 in a Dyck path. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001181Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. 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. St001480The number of simple summands of the module J^2/J^3. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001572The minimal number of edges to remove to make a graph bipartite. St001573The minimal number of edges to remove to make a graph triangle-free. St001871The number of triconnected components of a graph. St000331The number of upper interactions of a Dyck path. St000418The number of Dyck paths that are weakly below a Dyck path. St000444The length of the maximal rise of a Dyck path. St000455The second largest eigenvalue of a graph if it is integral. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000845The maximal number of elements covered by an element in a poset. St000846The maximal number of elements covering an element of a poset. St000933The number of multipartitions of sizes given by an integer partition. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. 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. 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$. 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. 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. 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. St001296The maximal torsionfree index of an indecomposable non-projective module 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. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001531Number of partial orders contained in the poset determined by the Dyck path. St001765The number of connected components of the friends and strangers graph. St001959The product of the heights of the peaks of a Dyck path. St000015The number of peaks of a Dyck path. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001530The depth of a Dyck path. St001182Number of indecomposable injective modules with codominant dimension at least two in the corresponding Nakayama algebra. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. 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$. St000302The determinant of the distance matrix of a connected graph. St000467The hyper-Wiener index of a connected graph. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001095The number of non-isomorphic posets with precisely one further covering relation. St001570The minimal number of edges to add to make a graph Hamiltonian. St001651The Frankl number of a lattice. St001964The interval resolution global dimension of a poset. St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. 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. St000914The sum of the values of the Möbius function of a poset. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000181The number of connected components of the Hasse diagram for the poset. St000635The number of strictly order preserving maps of a poset into itself. St001890The maximum magnitude of the Möbius function of a poset. St000284The Plancherel distribution on integer partitions. St000478Another weight of a partition according to Alladi. St000509The diagonal index (content) of a partition. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000681The Grundy value of Chomp on Ferrers diagrams. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000706The product of the factorials of the multiplicities of an integer partition. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000927The alternating sum of the coefficients of the character polynomial of an integer partition. St000934The 2-degree of an integer partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St000993The multiplicity of the largest part of an integer partition. St001118The acyclic chromatic index of a graph. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St000477The weight of a partition according to Alladi. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. 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. St000567The sum of the products of all pairs of parts. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000770The major index of an integer partition when read from bottom to top. St000815The number of semistandard Young tableaux of partition weight of given shape. St000928The sum of the coefficients of the character polynomial of an integer partition. St000929The constant term of the character polynomial of an integer partition. St000936The number of even values of the symmetric group character corresponding to the partition. St000937The number of positive values of the symmetric group character corresponding to the partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St000941The number of characters of the symmetric group whose value on the partition is even. St000997The even-odd crank of an integer partition. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St001098The 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 vertex labelled trees. 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. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000264The girth of a graph, which is not a tree. St000713The dimension of the irreducible representation of Sp(4) labelled by an integer partition. St000716The dimension of the irreducible representation of Sp(6) labelled by an integer partition. St000046The largest eigenvalue of the random to random operator acting on the simple module corresponding to the given partition. St000137The Grundy value of an integer partition. St000618The number of self-evacuating tableaux of given shape. St000781The number of proper colouring schemes of a Ferrers diagram. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001262The dimension of the maximal parabolic seaweed algebra corresponding to the partition. St001281The normalized isoperimetric number of a graph. 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. St001529The number of monomials in the expansion of the nabla operator applied to the power-sum symmetric function indexed by the partition. St001561The value of the elementary symmetric function evaluated at 1. 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. St001593This is the number of standard Young tableaux of the given shifted shape. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001602The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on endofunctions. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001610The number of coloured endofunctions 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. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001763The Hurwitz number of an integer partition. St001780The order of promotion on the set of standard tableaux of given shape. 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. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St001938The number of transitive monotone factorizations of genus zero of a permutation of given cycle type. St001939The number of parts that are equal to their multiplicity in the integer partition. St001943The sum of the squares of the hook lengths of an integer partition. St000379The number of Hamiltonian cycles in a graph. St000464The Schultz index of a connected graph. St000699The toughness times the least common multiple of 1,. St000749The smallest integer d such that the restriction of the representation corresponding to a partition of n to the symmetric group on n-d letters has a constituent of odd degree. St000944The 3-degree of an integer partition. St001177Twice the mean value of the major index among all standard Young tableaux of a partition. St001178Twelve times the variance of the major index among all standard Young tableaux of a partition. St001248Sum of the even parts of a partition. St001279The sum of the parts of an integer partition that are at least two. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001545The second Elser number of a connected graph. St001586The number of odd parts smaller than the largest even part in an integer partition. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St000474Dyson's crank of a partition.