St000291The number of descents of a binary word. St000292The number of ascents of a binary word. St000293The number of inversions of a binary word. St000347The inversion sum of a binary word. St000348The non-inversion sum of a binary word. St000682The Grundy value of Welter's game on a binary word. St000768The number of peaks in an integer composition. St000807The sum of the heights of the valleys of the associated bargraph. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St000921The number of internal inversions 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. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001485The modular major index of a binary word. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000047The number of standard immaculate tableaux of a given shape. St000160The multiplicity of the smallest part of a partition. St000183The side length of the Durfee square of an integer partition. St000277The number of ribbon shaped standard tableaux. St000326The position of the first one in a binary word after appending a 1 at the end. St000390The number of runs of ones in a binary word. St000706The product of the factorials of the multiplicities of an integer partition. St000758The length of the longest staircase fitting into an integer composition. St000760The length of the longest strictly decreasing subsequence of parts of an integer composition. St000763The sum of the positions of the strong records of an integer composition. St000764The number of strong records in an integer composition. St000767The number of runs in an integer composition. St000781The number of proper colouring schemes of a Ferrers diagram. St000816The number of standard composition tableaux of the composition. St000820The number of compositions obtained by rotating the composition. St000897The number of different multiplicities of parts of an integer partition. St000903The number of different parts of an integer composition. St000993The multiplicity of the largest part of an integer partition. 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. St001196The global dimension of $A$ minus the global dimension of $eAe$ for the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001256Number of simple reflexive modules that are 2-stable reflexive. St001272The number of graphs with the same degree sequence. 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. St001476The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,-1). St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. 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. St001568The smallest positive integer that does not appear twice in the partition. St001597The Frobenius rank of a skew partition. St001613The binary logarithm of the size of the center of a lattice. St001681The number of inclusion-wise minimal subsets of a lattice, whose meet is the bottom element. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001776The degree of the minimal polynomial of the largest Laplacian eigenvalue of a graph. 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. St001881The number of factors of a lattice as a Cartesian product of lattices. St001933The largest multiplicity of a part in an integer partition. St000052The number of valleys of a Dyck path not on the x-axis. St000089The absolute variation of a composition. St000090The variation of a composition. St000091The descent variation of a composition. St000143The largest repeated part of a partition. St000150The floored half-sum of the multiplicities of a partition. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000206Number of non-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. St000257The number of distinct parts of a partition that occur at least twice. St000322The skewness of a graph. St000323The minimal crossing number of a graph. St000370The genus of a graph. St000403The Szeged index minus the Wiener index of a graph. St000447The number of pairs of vertices of a graph with distance 3. St000449The number of pairs of vertices of a graph with distance 4. St000671The maximin edge-connectivity for choosing a subgraph. St000687The dimension of $Hom(I,P)$ for the LNakayama algebra of a Dyck path. 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. St000929The constant term of the character polynomial of an integer partition. St000966Number of peaks minus the global dimension of the corresponding LNakayama algebra. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. 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. St001025Number of simple modules with projective dimension 4 in the Nakayama algebra corresponding to the Dyck path. St001069The coefficient of the monomial xy of the Tutte polynomial of the graph. 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. St001091The number of parts in an integer partition whose next smaller part has the same size. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St001122The multiplicity of the sign representation in the Kronecker square corresponding to a partition. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001172The number of 1-rises at odd height of a Dyck path. St001175The size of a partition minus the hook length of the base cell. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. 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. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001305The number of induced cycles on four vertices in a graph. St001306The number of induced paths on four vertices in a graph. St001309The number of four-cliques in a graph. St001310The number of induced diamond graphs in a graph. St001324The minimal number of occurrences of the chordal-pattern in a linear ordering of the vertices of the graph. St001325The minimal number of occurrences of the comparability-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. St001327The minimal number of occurrences of the split-pattern in a linear ordering of the vertices of the graph. St001329The minimal number of occurrences of the outerplanar pattern in a linear ordering of the vertices of the graph. St001334The minimal number of occurrences of the 3-colorable pattern in a linear ordering of the vertices of the graph. St001371The length of the longest Yamanouchi prefix of a binary word. St001561The value of the elementary symmetric function evaluated at 1. St001575The minimal number of edges to add or remove to make a graph edge transitive. St001577The minimal number of edges to add or remove to make a graph a cograph. St001584The area statistic between a Dyck path and its bounce path. St001586The number of odd parts smaller than the largest even part in an integer partition. St001588The number of distinct odd parts smaller than the largest even part in an integer partition. St001596The number of two-by-two squares inside a skew partition. St001673The degree of asymmetry of an integer composition. St001677The number of non-degenerate subsets of a lattice whose meet is the bottom element. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001730The number of times the path corresponding to a binary word crosses the base line. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001793The difference between the clique number and the chromatic number of a graph. St001845The number of join irreducibles minus the rank of a lattice. St001871The number of triconnected components of a graph. St000007The number of saliances of the permutation. St000093The cardinality of a maximal independent set of vertices of a graph. St000258The burning number of a graph. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000630The length of the shortest palindromic decomposition of a binary word. St000733The row containing the largest entry of a standard tableau. St000842The breadth of a permutation. St000918The 2-limited packing number of a graph. St001261The Castelnuovo-Mumford regularity of a graph. St001471The magnitude of a Dyck path. St001619The number of non-isomorphic sublattices of a lattice. St001620The number of sublattices of a lattice. St001666The number of non-isomorphic subposets of a lattice which are lattices. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St000001The number of reduced words for a permutation. St000003The number of standard Young tableaux of the partition. St000011The number of touch points (or returns) of a Dyck path. St000031The number of cycles in the cycle decomposition of a permutation. St000036The evaluation at 1 of the Kazhdan-Lusztig polynomial with parameters given by the identity and the permutation. St000048The multinomial of the parts of a partition. St000049The number of set partitions whose sorted block sizes correspond to the partition. St000078The number of alternating sign matrices whose left key is the permutation. St000124The cardinality of the preimage of the Simion-Schmidt map. St000159The number of distinct parts of the integer partition. St000182The number of permutations whose cycle type is the given integer partition. St000255The number of reduced Kogan faces with the permutation as type. St000260The radius of a connected graph. St000266The number of spanning subgraphs of a graph with the same connected components. St000267The number of maximal spanning forests contained in a graph. St000273The domination number of a graph. St000275Number of permutations whose sorted list of non zero multiplicities of the Lehmer code is the given partition. St000278The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. St000287The number of connected components of a graph. St000321The number of integer partitions of n that are dominated by an integer partition. St000345The number of refinements of a partition. St000346The number of coarsenings of a partition. St000349The number of different adjacency matrices of a graph. St000352The Elizalde-Pak rank of a permutation. St000382The first part of an integer composition. St000388The number of orbits of vertices of a graph under automorphisms. St000481The number of upper covers of a partition in dominance order. St000517The Kreweras number of an integer partition. St000533The minimum of the number of parts and the size of the first part of an integer partition. St000535The rank-width of a graph. St000544The cop number of a graph. St000550The number of modular elements of a lattice. St000551The number of left modular elements of a lattice. St000553The number of blocks of a graph. St000618The number of self-evacuating tableaux of given shape. St000628The balance 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. St000679The pruning number of an ordered tree. St000695The number of blocks in the first part of the atomic decomposition of a set partition. St000705The number of semistandard tableaux on a given integer partition of n with maximal entry n. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000765The number of weak records in an integer composition. St000775The multiplicity of the largest eigenvalue in a graph. St000783The side length of the largest staircase partition fitting into a partition. St000785The number of distinct colouring schemes of a graph. St000786The maximal number of occurrences of a colour in a proper colouring 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. 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. St000876The number of factors in the Catalan decomposition of a binary word. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. 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. St000908The length of the shortest maximal antichain in a poset. St000913The number of ways to refine the partition into singletons. St000916The packing number of a graph. St000920The logarithmic height of a Dyck path. 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. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001057The Grundy value of the game of creating an independent set in a graph. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001070The absolute value of the derivative of the chromatic polynomial of the graph at 1. St001102The number of words with multiplicities of the letters given by the composition, avoiding the consecutive pattern 132. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. St001111The weak 2-dynamic chromatic number of a graph. St001112The 3-weak dynamic number of a graph. St001121The multiplicity of the irreducible representation indexed by the partition in the Kronecker square corresponding to the 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. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001236The dominant dimension of the corresponding Comp-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. St001271The competition number of a graph. St001282The number of graphs with the same chromatic polynomial. St001286The annihilation number of a graph. St001312Number of parabolic noncrossing partitions indexed by the composition. St001322The size of a minimal independent dominating set in a graph. St001333The cardinality of a minimal edge-isolating set of a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001339The irredundance number of a graph. St001340The cardinality of a minimal non-edge isolating set of a graph. St001352The number of internal nodes in the modular decomposition of a graph. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. 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. 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. St001393The induced matching number of a graph. St001432The order dimension of the 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. St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001546The number of monomials in the Tutte polynomial of a graph. St001571The Cartan determinant of the integer partition. St001595The number of standard Young tableaux of the skew partition. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001616The number of neutral elements in a lattice. St001618The cardinality of the Frattini sublattice of a lattice. St001624The breadth of a lattice. St001625The Möbius invariant of a lattice. St001642The Prague dimension of a graph. St001675The number of parts equal to the part in the reversed composition. St001679The number of subsets of a lattice whose meet is the bottom element. St001694The number of maximal dissociation sets in a graph. St001711The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. St001716The 1-improper chromatic number of a graph. St001720The minimal length of a chain of small intervals in a lattice. St001732The number of peaks visible from the left. St001734The lettericity of a graph. St001735The number of permutations with the same set of runs. 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. St001754The number of tolerances of a finite lattice. St001765The number of connected components of the friends and strangers 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. St001780The order of promotion on the set of standard tableaux of given shape. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St001820The size of the image of the pop stack sorting operator. St001829The common independence number of a graph. St001833The number of linear intervals in a lattice. 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. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St001941The evaluation at 1 of the modified Kazhdan--Lusztig R polynomial (as in [1, Section 5. St001951The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. St001957The number of Hasse diagrams with a given underlying undirected graph. St000008The major index of the composition. St000017The number of inversions of a standard tableau. St000022The number of fixed points of a permutation. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St000039The number of crossings of a permutation. St000042The number of crossings of a perfect matching. St000057The Shynar inversion number of a standard tableau. St000065The number of entries equal to -1 in an alternating sign matrix. St000095The number of triangles of a graph. St000119The number of occurrences of the pattern 321 in a permutation. St000121The number of occurrences of the contiguous pattern [.,[.,[.,[.,.]]]] in a binary tree. St000122The number of occurrences of the contiguous pattern [.,[.,[[.,.],.]]] in a binary tree. St000123The difference in Coxeter length of a permutation and its image under the Simion-Schmidt map. St000125The number of occurrences of the contiguous pattern [.,[[[.,.],.],. St000126The number of occurrences of the contiguous pattern [.,[.,[.,[.,[.,.]]]]] in a binary tree. St000127The number of occurrences of the contiguous pattern [.,[.,[.,[[.,.],.]]]] in a binary tree. St000128The number of occurrences of the contiguous pattern [.,[.,[[.,[.,.]],.]]] in a binary tree. St000129The number of occurrences of the contiguous pattern [.,[.,[[[.,.],.],.]]] in a binary tree. St000130The number of occurrences of the contiguous pattern [.,[[.,.],[[.,.],.]]] in a binary tree. St000131The number of occurrences of the contiguous pattern [.,[[[[.,.],.],.],. St000132The number of occurrences of the contiguous pattern [[.,.],[.,[[.,.],.]]] in a binary tree. St000142The number of even parts of a partition. St000149The number of cells of the partition whose leg is zero and arm is odd. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000185The weighted size of a partition. St000214The number of adjacencies of a permutation. St000217The number of occurrences of the pattern 312 in a permutation. St000218The number of occurrences of the pattern 213 in a permutation. St000220The number of occurrences of the pattern 132 in a permutation. St000223The number of nestings in the permutation. St000225Difference between largest and smallest parts in a partition. St000232The number of crossings of a set partition. St000233The number of nestings of a set partition. St000234The number of global ascents of a permutation. St000252The number of nodes of degree 3 of a binary tree. St000256The number of parts from which one can substract 2 and still get an integer partition. St000296The length of the symmetric border of a binary word. St000297The number of leading ones in a binary word. St000303The determinant of the product of the incidence matrix and its transpose of a graph divided by $4$. St000313The number of degree 2 vertices of a graph. St000317The cycle descent number of a permutation. St000355The number of occurrences of the pattern 21-3. St000356The number of occurrences of the pattern 13-2. St000358The number of occurrences of the pattern 31-2. St000359The number of occurrences of the pattern 23-1. St000360The number of occurrences of the pattern 32-1. St000366The number of double descents of a permutation. St000367The number of simsun double descents of a permutation. St000368The Altshuler-Steinberg determinant of a graph. St000371The number of mid points of decreasing subsequences of length 3 in a permutation. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$. St000377The dinv defect of an integer partition. St000386The number of factors DDU in a Dyck path. St000404The number of occurrences of the pattern 3241 or of the pattern 4231 in a permutation. St000405The number of occurrences of the pattern 1324 in a permutation. St000406The number of occurrences of the pattern 3241 in a permutation. St000407The number of occurrences of the pattern 2143 in a permutation. St000408The number of occurrences of the pattern 4231 in a permutation. St000425The number of occurrences of the pattern 132 or of the pattern 213 in a permutation. St000433The number of occurrences of the pattern 132 or of the pattern 321 in a permutation. St000440The number of occurrences of the pattern 4132 or of the pattern 4231 in a permutation. St000448The number of pairs of vertices of a graph with distance 2. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000478Another weight of a partition according to Alladi. St000480The number of lower covers of a partition in dominance order. St000491The number of inversions of a set partition. St000496The rcs statistic of a set partition. St000497The lcb statistic of a set partition. St000534The number of 2-rises of a permutation. St000552The number of cut vertices of a graph. St000555The number of occurrences of the pattern {{1,3},{2}} in a set partition. St000559The number of occurrences of the pattern {{1,3},{2,4}} in a set partition. St000562The number of internal points of a set partition. St000563The number of overlapping pairs of blocks of a set partition. St000565The major index of a set partition. St000572The dimension exponent of a set partition. St000581The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 2 is maximal. St000582The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 3 is maximal, (1,3) are consecutive in a block. St000585The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal, (1,3) are consecutive in a block. St000594The number of occurrences of the pattern {{1,3},{2}} such that 1,2 are minimal, (1,3) are consecutive in a block. St000600The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, (1,3) are consecutive in a block. St000602The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal. St000610The number of occurrences of the pattern {{1,3},{2}} such that 2 is maximal. St000613The number of occurrences of the pattern {{1,3},{2}} such that 2 is minimal, 3 is maximal, (1,3) are consecutive in a block. St000637The length of the longest cycle in a graph. St000647The number of big descents of a permutation. St000648The number of 2-excedences of a permutation. St000660The number of rises of length at least 3 of a Dyck path. St000661The number of rises of length 3 of a Dyck path. St000663The number of right floats of a permutation. St000664The number of right ropes of a permutation. St000666The number of right tethers of a permutation. St000674The number of hills of a Dyck path. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000697The number of 3-rim hooks removed from an integer partition to obtain its associated 3-core. St000731The number of double exceedences of a permutation. St000748The major index of the permutation obtained by flattening the set partition. 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. St000752The Grundy value for the game 'Couples are forever' on an integer partition. 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. St000871The number of very big ascents of a permutation. St000877The depth of the binary word interpreted as a path. St000878The number of ones minus the number of zeros of a binary word. St000879The number of long braid edges in the graph of braid moves of a permutation. St000885The number of critical steps in the Catalan decomposition of a binary word. St000931The number of occurrences of the pattern UUU in a Dyck path. St000944The 3-degree of an integer partition. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama algebra. St000995The largest even part of an integer partition. St001022Number of simple modules with projective dimension 3 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. St001033The normalized area 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. St001047The maximal number of arcs crossing a given arc of a perfect matching. St001059Number of occurrences of the patterns 41352,42351,51342,52341 in a permutation. St001083The number of boxed occurrences of 132 in a permutation. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St001092The number of distinct even parts of a partition. 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. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001137Number of simple modules that are 3-regular in the corresponding Nakayama algebra. St001141The number of occurrences of hills of size 3 in a Dyck path. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. 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. St001178Twelve times the variance of the major index among all standard Young tableaux of a partition. 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. St001193The dimension of $Ext_A^1(A/AeA,A)$ in the corresponding Nakayama algebra $A$ such that $eA$ is a minimal faithful projective-injective module. St001214The aft of an integer partition. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001234The number of indecomposable three dimensional modules with projective dimension one. St001251The number of parts of a partition that are not congruent 1 modulo 3. St001252Half the sum of the even parts of a partition. St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St001263The index of the maximal parabolic seaweed algebra associated with the composition. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001301The first Betti number of the order complex associated with the poset. St001307The number of induced stars on four vertices in a graph. St001308The number of induced paths on three vertices in a graph. St001311The cyclomatic number of a graph. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001317The minimal number of occurrences of the forest-pattern in a linear ordering of the vertices of the graph. St001319The minimal number of occurrences of the star-pattern in a linear ordering of the vertices of the graph. St001320The minimal number of occurrences of the path-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. St001331The size of the minimal feedback vertex set. St001335The cardinality of a minimal cycle-isolating set of a graph. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001347The number of pairs of vertices of a graph having the same neighbourhood. St001350Half of the Albertson index of a graph. St001351The Albertson index of a graph. St001353The number of prime nodes in the modular decomposition of a graph. St001356The number of vertices in prime modules of a graph. St001367The smallest number which does not occur as degree of a vertex in a graph. St001374The Padmakar-Ivan index of a graph. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001394The genus of a permutation. St001396Number of triples of incomparable elements in a finite poset. St001411The number of patterns 321 or 3412 in a permutation. St001414Half the length of the longest odd length palindromic prefix of a binary word. St001423The number of distinct cubes in a binary word. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St001470The cyclic holeyness of a permutation. St001513The number of nested exceedences of a permutation. St001521Half the total irregularity of a graph. St001522The total irregularity of a graph. St001535The number of cyclic alignments of a permutation. St001536The number of cyclic misalignments of a permutation. St001537The number of cyclic crossings of a permutation. St001549The number of restricted non-inversions between exceedances. St001550The number of inversions between exceedances where the greater exceedance is linked. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. 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. 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. St001578The minimal number of edges to add or remove to make a graph a line graph. St001593This is the number of standard Young tableaux of the given shifted shape. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001615The number of join prime elements of a lattice. St001617The dimension of the space of valuations of a lattice. St001621The number of atoms of a lattice. St001622The number of join-irreducible elements of a lattice. St001623The number of doubly irreducible elements of a lattice. St001626The number of maximal proper sublattices of a lattice. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001638The book thickness of a graph. St001646The number of edges that can be added without increasing the maximal degree of a graph. 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. St001663The number of occurrences of the Hertzsprung pattern 132 in a permutation. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St001689The number of celebrities in a graph. St001690The length of a longest path in a graph such that after removing the paths edges, every vertex of the path has distance two from some other vertex of the path. St001692The number of vertices with higher degree than the average degree in a graph. St001695The natural comajor index of a standard Young tableau. St001696The natural major index of a standard Young tableau. St001698The comajor index of a standard tableau minus the weighted size of its shape. St001699The major index of a standard tableau minus the weighted size of its shape. St001703The villainy of a graph. St001705The number of occurrences of the pattern 2413 in a permutation. St001708The number of pairs of vertices of different degree in a graph. St001712The number of natural descents of a standard Young tableau. St001715The number of non-records in a permutation. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001727The number of invisible inversions of a permutation. St001728The number of invisible descents of a permutation. St001736The total number of cycles in a graph. St001742The difference of the maximal and the minimal degree in a graph. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001764The number of non-convex subsets of vertices in a graph. St001766The number of cells which are not occupied by the same tile in all reduced pipe dreams corresponding to a permutation. St001777The number of weak descents in an integer composition. St001781The interlacing number of a set partition. St001797The number of overfull subgraphs of a graph. St001798The difference of the number of edges in a graph and the number of edges in the complement of the Turán graph. St001799The number of proper separations of a graph. St001810The number of fixed points of a permutation smaller than its largest moved point. St001839The number of excedances of a set partition. St001840The number of descents of a set partition. St001841The number of inversions of a set partition. St001842The major index of a set partition. St001843The Z-index of a set partition. St001846The number of elements which do not have a complement in the lattice. St001847The number of occurrences of the pattern 1432 in a permutation. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St001931The weak major index of an integer composition regarded as a word. St001964The interval resolution global dimension of a poset. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St000886The number of permutations with the same antidiagonal sums. St001162The minimum jump of a permutation. St001344The neighbouring number of a permutation. St000432The number of occurrences of the pattern 231 or of the pattern 312 in a permutation. St000436The number of occurrences of the pattern 231 or of the pattern 321 in a permutation. St000437The number of occurrences of the pattern 312 or of the pattern 321 in a permutation. St000486The number of cycles of length at least 3 of a permutation. St000516The number of stretching pairs of a permutation. St000622The number of occurrences of the patterns 2143 or 4231 in a permutation. St000623The number of occurrences of the pattern 52341 in a permutation. St000646The number of big ascents of a permutation. St000649The number of 3-excedences of a permutation. St000650The number of 3-rises of a permutation. St000709The number of occurrences of 14-2-3 or 14-3-2. St000710The number of big deficiencies of a permutation. St000711The number of big exceedences of a permutation. St000732The number of double deficiencies of a permutation. St000750The number of occurrences of the pattern 4213 in a permutation. St000751The number of occurrences of either of the pattern 2143 or 2143 in a permutation. St000779The tier of a permutation. St000799The number of occurrences of the vincular pattern |213 in a permutation. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000801The number of occurrences of the vincular pattern |312 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000803The number of occurrences of the vincular pattern |132 in a permutation. St000872The number of very big descents of a permutation. St000962The 3-shifted major index of a permutation. St000963The 2-shifted major index of a permutation. St001552The number of inversions between excedances and fixed points of a permutation. St000542The number of left-to-right-minima of a permutation. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St000056The decomposition (or block) number of a permutation. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000181The number of connected components of the Hasse diagram for the poset. St000243The number of cyclic valleys and cyclic peaks 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. St000570The Edelman-Greene number of a permutation. St000640The rank of the largest boolean interval in a poset. St000694The number of affine bounded permutations that project to a given permutation. St000735The last entry on the main diagonal of a standard tableau. St000788The number of nesting-similar perfect matchings of a perfect matching. St000864The number of circled entries of the shifted recording tableau of a permutation. St000880The number of connected components of long braid edges in the graph of braid moves of a permutation. St000889The number of alternating sign matrices with the same antidiagonal sums. St000914The sum of the values of the Möbius function of a poset. St001006Number of simple modules with projective dimension equal to 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. St001081The number of minimal length factorizations of a permutation into star transpositions. 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. 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$. St001208The number of connected components of the quiver of $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra $A$ of $K[x]/(x^n)$. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001220The width of a permutation. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001260The permanent of an alternating sign matrix. St001461The number of topologically connected components of the chord diagram of a permutation. St001473The absolute value of the sum of all entries of the Coxeter matrix of the corresponding LNakayama algebra. St001481The minimal height of a peak of a Dyck path. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001590The crossing number of a perfect matching. St001661Half the permanent of the Identity matrix plus the permutation matrix associated to the permutation. St001665The number of pure excedances of a permutation. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St001830The chord expansion number of a perfect matching. St001832The number of non-crossing perfect matchings in the chord expansion of a perfect matching. St001859The number of factors of the Stanley symmetric function associated with a permutation. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St000221The number of strong fixed points of a permutation. St000279The size of the preimage of the map 'cycle-as-one-line notation' from Permutations to Permutations. St000315The number of isolated vertices of a graph. St000369The dinv deficit of a Dyck path. St000376The bounce deficit of a Dyck path. St000379The number of Hamiltonian cycles in a graph. St000462The major index minus the number of excedences of a permutation. St000560The number of occurrences of the pattern {{1,2},{3,4}} in a set partition. St000787The number of flips required to make a perfect matching noncrossing. St000881The number of short braid edges in the graph of braid moves of a permutation. St000961The shifted major index of a permutation. St001139The number of occurrences of hills of size 2 in a Dyck path. St001174The Gorenstein dimension of the algebra $A/I$ when $I$ is the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. 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. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001381The fertility of a permutation. St001444The rank of the skew-symmetric form which is non-zero on crossing arcs of a perfect matching. St001837The number of occurrences of a 312 pattern in the restricted growth word of a perfect matching. St001856The number of edges in the reduced word graph of a permutation. St001635The trace of the square of the Coxeter matrix of the incidence algebra of a poset. St000636The hull number of a graph. St001029The size of the core of a graph. St001109The number of proper colourings of a graph with as few colours as possible. St001654The monophonic hull number of a graph. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St001316The domatic number of a graph. St001395The number of strictly unfriendly partitions of a graph. St000283The size of the preimage of the map 'to graph' from Binary trees to Graphs. St000351The determinant of the adjacency matrix of a graph. St000699The toughness times the least common multiple of 1,. St000948The chromatic discriminant of a graph. St001119The length of a shortest maximal path in a graph. St001281The normalized isoperimetric number of a graph. St001357The maximal degree of a regular spanning subgraph of a graph. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001794Half the number of sets of vertices in a graph which are dominating and non-blocking. St001795The binary logarithm of the evaluation of the Tutte polynomial of the graph at (x,y) equal to (-1,-1). St001796The absolute value of the quotient of the Tutte polynomial of the graph at (1,1) and (-1,-1). St001741The largest integer such that all patterns of this size are contained in the permutation. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001890The maximum magnitude of the Möbius function of a poset. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St000219The number of occurrences of the pattern 231 in a permutation. St000488The number of cycles of a permutation of length at most 2. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001061The number of indices that are both descents and recoils of a permutation. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St001520The number of strict 3-descents. St001556The number of inversions of the third entry of a permutation. St001691The number of kings in a graph. St001811The Castelnuovo-Mumford regularity of a permutation. St001850The number of Hecke atoms of a permutation. St001960The number of descents of a permutation minus one if its first entry is not one. St001532The leading coefficient of the Poincare polynomial of the poset cone. St000286The number of connected components of the complement of a graph. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000096The number of spanning trees of a graph. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000274The number of perfect matchings of a graph. St000276The size of the preimage of the map 'to graph' from Ordered trees to Graphs. St000310The minimal degree of a vertex of a graph. St001877Number of indecomposable injective modules with projective dimension 2. St000264The girth of a graph, which is not a tree. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001354The number of series nodes in the modular decomposition of a graph. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St001498The normalised height of a Nakayama algebra with magnitude 1. St000455The second largest eigenvalue of a graph if it is integral. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. 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$. St001570The minimal number of edges to add to make a graph Hamiltonian. St000741The Colin de Verdière graph invariant. St000917The open packing number of a graph. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. 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. St001060The distinguishing index of a graph. 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. St000284The Plancherel distribution on integer partitions. 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. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000806The semiperimeter of the associated bargraph. St000901The cube of the number of standard Young tableaux with shape given by the partition. St001128The exponens consonantiae of a partition. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001389The number of partitions of the same length below the given integer partition. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001527The cyclic permutation representation number of an integer partition. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001602The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on endofunctions. St001627The number of coloured connected graphs such that the multiplicities of colours are given by a partition. St001763The Hurwitz number of an integer partition. St001938The number of transitive monotone factorizations of genus zero of a permutation of given cycle type. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000936The number of even values of the symmetric group character corresponding to the partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St000940The number of characters of the symmetric group whose value on the partition is zero. St000941The number of characters of the symmetric group whose value on the partition is even. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001248Sum of the even parts of a partition. St001279The sum of the parts of an integer partition that are at least two. St001280The number of parts of an integer partition that are at least two. St001502The global dimension minus the dominant dimension of magnitude 1 Nakayama algebras. St001541The Gini index of an integer partition. St001587Half of the largest even part of an integer partition. St001657The number of twos in an integer partition. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St000464The Schultz index of a connected graph. 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. 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. St001545The second Elser number of a connected graph. St000285The size of the preimage of the map 'to inverse des composition' from Parking functions to Integer compositions. St000456The monochromatic index of a connected graph. St000762The sum of the positions of the weak records of an integer composition. St000782The indicator function of whether a given perfect matching is an L & P matching. St001118The acyclic chromatic index of a graph. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. 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. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001608The number of coloured rooted trees 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. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St001176The size of a partition minus its first part. St001177Twice the mean value of the major index among all standard Young tableaux of a partition. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001961The sum of the greatest common divisors of all pairs of parts.