St000687The dimension of $Hom(I,P)$ for the LNakayama algebra of a Dyck path. St000768The number of peaks in an integer composition. St000966Number of peaks minus the global dimension of the corresponding LNakayama algebra. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St000649The number of 3-excedences of a permutation. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St001578The minimal number of edges to add or remove to make a graph a line graph. St001301The first Betti number of the order complex associated with the poset. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000775The multiplicity of the largest eigenvalue in a graph. St001307The number of induced stars on four vertices in a graph. St001326The minimal number of occurrences of the interval-pattern in a linear ordering of the vertices of the graph. St001638The book thickness of a graph. St001689The number of celebrities in a graph. St000266The number of spanning subgraphs of a graph with the same connected components. St000267The number of maximal spanning forests contained in a graph. St000363The number of minimal vertex covers of a graph. St001475The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,0). St001476The evaluation of the Tutte polynomial of the graph at (x,y) equal to (1,-1). St001546The number of monomials in the Tutte polynomial of a graph. St000323The minimal crossing number of a graph. St000351The determinant of the adjacency matrix of a graph. St000368The Altshuler-Steinberg determinant of a graph. St000370The genus of a graph. St000403The Szeged index minus the Wiener index of a graph. St000637The length of the longest cycle in a graph. St001069The coefficient of the monomial xy of the Tutte polynomial of the graph. St001071The beta invariant of the graph. St001309The number of four-cliques in a graph. St001310The number of induced diamond graphs 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. St001325The minimal number of occurrences of the comparability-pattern in a linear ordering of the vertices of the graph. St001328The minimal number of occurrences of the bipartite-pattern in a linear ordering of the vertices of the graph. St001329The minimal number of occurrences of the outerplanar pattern in a linear ordering of the vertices of the graph. St001331The size of the minimal feedback vertex set. St001334The minimal number of occurrences of the 3-colorable pattern in a linear ordering of the vertices of the graph. St001335The cardinality of a minimal cycle-isolating set of a graph. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001357The maximal degree of a regular spanning subgraph of a graph. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001736The total number of cycles in a graph. St001793The difference between the clique number and the chromatic number of a graph. St001797The number of overfull subgraphs of a graph. St000273The domination number of a graph. St000326The position of the first one in a binary word after appending a 1 at the end. St000349The number of different adjacency matrices of a graph. St000388The number of orbits of vertices of a graph under automorphisms. St000544The cop number of a graph. St000553The number of blocks of a graph. 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. St000763The sum of the positions of the strong records of an integer composition. St000764The number of strong records in an integer composition. St000765The number of weak records in an integer composition. St000785The number of distinct colouring schemes of a graph. 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. St000905The number of different multiplicities of parts of an integer composition. St000916The packing number of a graph. St001057The Grundy value of the game of creating an independent set in a graph. St001271The competition number of a graph. 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. 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. St001829The common independence number of a graph. St001951The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. St000091The descent variation of a composition. St000258The burning number of a graph. St000296The length of the symmetric border of a binary word. St000447The number of pairs of vertices of a graph with distance 3. St000448The number of pairs of vertices of a graph with distance 2. St000449The number of pairs of vertices of a graph with distance 4. St000552The number of cut vertices of a graph. St000629The defect of a binary word. St000752The Grundy value for the game 'Couples are forever' on an integer partition. St000761The number of ascents in an integer composition. St000918The 2-limited packing number of a graph. St001371The length of the longest Yamanouchi prefix of a binary word. St001521Half the total irregularity of a graph. St001522The total irregularity 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. St001692The number of vertices with higher degree than the average degree in a graph. St001708The number of pairs of vertices of different degree in a graph. St001764The number of non-convex subsets of vertices in 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. St000003The number of standard Young tableaux of the partition. St000278The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. St000346The number of coarsenings of a partition. St000535The rank-width 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. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. 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. St001121The multiplicity of the irreducible representation indexed by the partition in the Kronecker square corresponding to the partition. St001256Number of simple reflexive modules that are 2-stable reflexive. St000297The number of leading ones in a binary word. St000481The number of upper covers of a partition in dominance order. St000741The Colin de Verdière graph invariant. St001025Number of simple modules with projective dimension 4 in the Nakayama algebra corresponding to the Dyck path. St001091The number of parts in an integer partition whose next smaller part has the same size. 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. 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$. St000260The radius of a connected graph. St000287The number of connected components of a graph. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. St001272The number of graphs with the same degree sequence. St001282The number of graphs with the same chromatic polynomial. St001352The number of internal nodes in the modular decomposition of a graph. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001463The number of distinct columns in the nullspace of a graph. St001562The value of the complete homogeneous symmetric function evaluated at 1. St001563The value of the power-sum symmetric function evaluated at 1. St001564The value of the forgotten symmetric functions when all variables set to 1. 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. St000283The size of the preimage of the map 'to graph' from Binary trees to Graphs. St000379The number of Hamiltonian cycles in a graph. St000422The energy of a graph, if it is integral. St000671The maximin edge-connectivity for choosing a subgraph. St000699The toughness times the least common multiple of 1,. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000948The chromatic discriminant of a graph. St001119The length of a shortest maximal path in a graph. St001323The independence gap of a graph. St001347The number of pairs of vertices of a graph having the same neighbourhood. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001794Half the number of sets of vertices in a graph which are dominating and non-blocking. St001796The absolute value of the quotient of the Tutte polynomial of the graph at (1,1) and (-1,-1). St000455The second largest eigenvalue of a graph if it is integral. St000010The length of the partition. St000048The multinomial of the parts of a partition. St000049The number of set partitions whose sorted block sizes correspond to the partition. St000159The number of distinct parts of the integer partition. St000160The multiplicity of the smallest part of a partition. St000183The side length of the Durfee square of an integer partition. 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. St000275Number of permutations whose sorted list of non zero multiplicities of the Lehmer code is the given partition. St000286The number of connected components of the complement of a graph. St000344The number of strongly connected outdegree sequences of a graph. St000383The last part of an integer composition. 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. St000548The number of different non-empty partial sums of an integer partition. St000550The number of modular elements of a lattice. St000551The number of left modular elements of a lattice. St000618The number of self-evacuating tableaux of given shape. St000657The smallest part of an integer composition. St000781The number of proper colouring schemes of a Ferrers diagram. St000783The side length of the largest staircase partition fitting into a partition. St000897The number of different multiplicities of parts of an integer partition. St001387Number of standard Young tableaux of the skew shape tracing the border of the given partition. St001432The order dimension of the partition. St001484The number of singletons of an integer partition. St001593This is the number of standard Young tableaux of the given shifted shape. 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. St001679The number of subsets of a lattice whose meet is the bottom element. St001681The number of inclusion-wise minimal subsets of a lattice, whose meet is the bottom element. St001711The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St001720The minimal length of a chain of small intervals in a lattice. St001754The number of tolerances of a finite lattice. St001780The order of promotion on the set of standard tableaux of given shape. St001820The size of the image of the pop stack sorting operator. St001833The number of linear intervals in a lattice. St001881The number of factors of a lattice as a Cartesian product of lattices. 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. St001924The number of cells in an integer partition whose arm and leg length coincide. St001933The largest multiplicity of a part in an integer 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. St000095The number of triangles of a graph. St000143The largest repeated part of a partition. St000150The floored half-sum of the multiplicities of a partition. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000185The weighted size of a partition. St000225Difference between largest and smallest parts in a partition. St000257The number of distinct parts of a partition that occur at least twice. St000274The number of perfect matchings of a graph. St000311The number of vertices of odd degree in a graph. St000312The number of leaves in a graph. St000318The number of addable cells of the Ferrers diagram of an integer partition. St000322The skewness of a graph. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000511The number of invariant subsets when acting with a permutation of given cycle type. 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. St001175The size of a partition minus the hook length of the base cell. 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. St001178Twelve times the variance of the major index among all standard Young tableaux of a partition. St001214The aft of an integer partition. St001330The hat guessing number of a graph. St001350Half of the Albertson index of a graph. St001351The Albertson index of a graph. St001354The number of series nodes in the modular decomposition of a graph. St001395The number of strictly unfriendly partitions 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. 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. St001575The minimal number of edges to add or remove to make a graph edge transitive. St001576The minimal number of edges to add or remove to make a graph vertex transitive. St001577The minimal number of edges to add or remove to make a graph a cograph. 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. St001613The binary logarithm of the size of the center of a lattice. St001615The number of join prime elements of a lattice. St001617The dimension of the space of valuations of a lattice. St001619The number of non-isomorphic sublattices of a lattice. St001620The number of sublattices 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. St001666The number of non-isomorphic subposets of a lattice which are lattices. St001677The number of non-degenerate subsets of a lattice whose meet is the bottom element. 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. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001742The difference of the maximal and the minimal degree in a graph. St001826The maximal number of leaves on a vertex of a graph. St001845The number of join irreducibles minus the rank of a lattice. St001846The number of elements which do not have a complement in the lattice. St001871The number of triconnected components of a graph. St001961The sum of the greatest common divisors of all pairs of parts. St001316The domatic number of a graph. St001710The number of permutations such that conjugation with a permutation of given cycle type yields the inverse permutation. St001281The normalized isoperimetric number of a graph. St000879The number of long braid edges in the graph of braid moves of a permutation. St000655The length of the minimal rise of a Dyck path. St000303The determinant of the product of the incidence matrix and its transpose of a graph divided by $4$. St001572The minimal number of edges to remove to make a graph bipartite. St000088The row sums of the character table of the symmetric group. St000917The open packing number of a graph. St001322The size of a minimal independent dominating set in a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001339The irredundance number of a graph. 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. St001642The Prague dimension of a graph. St001672The restrained domination number of a graph. St001734The lettericity of a graph. St001765The number of connected components of the friends and strangers graph. St001917The order of toric promotion on the set of labellings of a graph. St001306The number of induced paths on four vertices in a graph. St001308The number of induced paths on three vertices in a graph. St001327The minimal number of occurrences of the split-pattern in a linear ordering of the vertices of the graph. St001374The Padmakar-Ivan index of a graph. St001657The number of twos in an integer partition. St000022The number of fixed points of a permutation. St000052The number of valleys of a Dyck path not on the x-axis. St000386The number of factors DDU in a Dyck path. St000405The number of occurrences of the pattern 1324 in a permutation. St000660The number of rises of length at least 3 of a Dyck path. St001783The number of odd automorphisms of a graph. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001141The number of occurrences of hills of size 3 in a Dyck path. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St001722The number of minimal chains with small intervals between a binary word and the top element. St000284The Plancherel distribution on integer partitions. 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. St000993The multiplicity of the largest part of an integer partition. St001128The exponens consonantiae of a partition. St001568The smallest positive integer that does not appear twice in the partition. St000093The cardinality of a maximal independent set of vertices of a graph. St000096The number of spanning trees of a graph. St000271The chromatic index of a graph. St000276The size of the preimage of the map 'to graph' from Ordered trees to Graphs. St000450The number of edges minus the number of vertices plus 2 of a graph. St000482The (zero)-forcing number of a graph. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000776The maximal multiplicity of an eigenvalue in a graph. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St001070The absolute value of the derivative of the chromatic polynomial of the graph at 1. St001111The weak 2-dynamic chromatic number of a graph. St001112The 3-weak dynamic number of a graph. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001286The annihilation number of a graph. St001333The cardinality of a minimal edge-isolating set of a graph. St001340The cardinality of a minimal non-edge isolating set of a graph. St001386The number of prime labellings of a graph. St001694The number of maximal dissociation sets in a graph. St001716The 1-improper chromatic number of a graph. St001828The Euler characteristic of a graph. St001957The number of Hasse diagrams with a given underlying undirected graph. St000313The number of degree 2 vertices of a 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. St001367The smallest number which does not occur as degree of a vertex in a graph. St001703The villainy of a graph. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001738The minimal order of a graph which is not an induced subgraph of the given graph. St000086The number of subgraphs. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000172The Grundy number of a graph. St000268The number of strongly connected orientations of a graph. St000269The number of acyclic orientations of a graph. St000270The number of forests contained in a graph. St000299The number of nonisomorphic vertex-induced subtrees. St000343The number of spanning subgraphs of a graph. St000452The number of distinct eigenvalues of a graph. St000453The number of distinct Laplacian eigenvalues of a graph. St000468The Hosoya index of a graph. St000722The number of different neighbourhoods in a graph. St000822The Hadwiger number of the graph. St000972The composition number of a graph. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001029The size of the core of a graph. St001072The evaluation of the Tutte polynomial of the graph at x and y equal to 3. St001073The number of nowhere zero 3-flows of a graph. St001093The detour number of a graph. St001108The 2-dynamic chromatic number of a graph. St001109The number of proper colourings of a graph with as few colours as possible. St001110The 3-dynamic chromatic number of a graph. St001116The game chromatic number of a graph. St001261The Castelnuovo-Mumford regularity of a graph. St001302The number of minimally dominating sets of vertices of a graph. St001303The number of dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001474The evaluation of the Tutte polynomial of the graph at (x,y) equal to (2,-1). St001477The number of nowhere zero 5-flows of a graph. St001478The number of nowhere zero 4-flows of a graph. St001494The Alon-Tarsi number of a graph. St001580The acyclic chromatic number of a graph. St001581The achromatic number of a graph. St001670The connected partition number of a graph. St001674The number of vertices of the largest induced star graph in the graph. St001725The harmonious chromatic number of a graph. St001758The number of orbits of promotion on a graph. St001883The mutual visibility number of a graph. St001963The tree-depth of a graph. St000081The number of edges of a graph. St000171The degree of the graph. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000263The Szeged index of a graph. St000265The Wiener index of a graph. St000272The treewidth of a graph. St000310The minimal degree of a vertex of a graph. St000350The sum of the vertex degrees of a graph. 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. St000465The first Zagreb index of a graph. St000536The pathwidth of a graph. St000537The cutwidth of a graph. St000571The F-index (or forgotten topological index) of a graph. St000915The Ore degree of a graph. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001056The Grundy value for the game of deleting vertices of a graph until it has no edges. St001117The game chromatic index of a graph. St001120The length of a longest path in a graph. St001200The number of simple modules in $eAe$ with projective dimension at most 2 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001270The bandwidth of a graph. St001277The degeneracy 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. St001341The number of edges in the center of a graph. St001349The number of different graphs obtained from the given graph by removing an edge. St001358The largest degree of a regular subgraph of a graph. St001362The normalized Knill dimension of a graph. St001393The induced matching number of a graph. St001458The rank of the adjacency matrix of a graph. St001459The number of zero columns in the nullspace of a graph. St001512The minimum rank of a graph. St001644The dimension of a graph. St001649The length of a longest trail in a graph. St001743The discrepancy of a graph. St001792The arboricity of a graph. St001812The biclique partition number of a graph. St001869The maximum cut size of a graph. St001962The proper pathwidth of a graph. St000717The number of ordinal summands of a poset. St000906The length of the shortest maximal chain in a poset. St000281The size of the preimage of the map 'to poset' from Binary trees to Posets. St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. St000298The order dimension or Dushnik-Miller dimension of a poset. St001696The natural major index of a standard Young tableau. St001260The permanent of an alternating sign matrix. St001385The number of conjugacy classes of subgroups with connected subgroups of sizes prescribed by an integer partition. St001786The number of total orderings of the north steps of a Dyck path such that steps after the k-th east step are not among the first k positions in the order. 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. 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. St001037The number of inner corners of the upper path of the parallelogram polyomino associated with the Dyck path. St000617The number of global maxima of a Dyck path. St000057The Shynar inversion number of a standard tableau. St001571The Cartan determinant of the integer partition. St000668The least common multiple of the parts of the partition. St000627The exponent of a binary word. St000628The balance of a binary word. St000031The number of cycles in the cycle decomposition of a permutation. St000291The number of descents of a binary word. St000306The bounce count of a Dyck path. St000390The number of runs of ones in a binary word. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St000153The number of adjacent cycles of a permutation. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St000315The number of isolated vertices of a graph. St001501The dominant dimension of magnitude 1 Nakayama algebras. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001964The interval resolution global dimension of a poset. 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. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001490The number of connected components of a skew partition. St000759The smallest missing part in an integer partition. 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. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. 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. 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$. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001804The minimal height of the rectangular inner shape in a cylindrical tableau associated to a tableau. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. 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. St000929The constant term of the character polynomial of an integer partition. St000933The number of multipartitions of sizes given by an integer partition. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St000788The number of nesting-similar perfect matchings of a perfect matching. St000787The number of flips required to make a perfect matching noncrossing. 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. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St000762The sum of the positions of the weak records of an integer composition. St001487The number of inner corners of a skew partition. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St000036The evaluation at 1 of the Kazhdan-Lusztig polynomial with parameters given by the identity and the permutation. St000352The Elizalde-Pak rank of a permutation. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St000007The number of saliances of the permutation. St000119The number of occurrences of the pattern 321 in a permutation. St000123The difference in Coxeter length of a permutation and its image under the Simion-Schmidt map. St000223The number of nestings in the permutation. St000366The number of double descents of a permutation. 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$. St000404The number of occurrences of the pattern 3241 or of the pattern 4231 in a permutation. St000408The number of occurrences of the pattern 4231 in a permutation. St000440The number of occurrences of the pattern 4132 or of the pattern 4231 in a permutation. St001890The maximum magnitude of the Möbius function of a poset. St001196The global dimension of $A$ minus the global dimension of $eAe$ for the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St001597The Frobenius rank of a skew partition. St000659The number of rises of length at least 2 of a Dyck path. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St000685The dominant dimension of the LNakayama algebra associated to a Dyck path. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001353The number of prime nodes in the modular decomposition of a graph. St001356The number of vertices in prime modules of a graph. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St001645The pebbling number of a connected graph. St000259The diameter of a connected graph. St000302The determinant of the distance matrix of a connected graph. St000466The Gutman (or modified Schultz) index of a connected graph. St000467The hyper-Wiener index of a connected graph. St000567The sum of the products of all pairs of parts. 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. 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. 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. 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. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001238The number of simple modules S such that the Auslander-Reiten translate of S is isomorphic to the Nakayama functor applied to the second syzygy of S. 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. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St000078The number of alternating sign matrices whose left key is the permutation. St000255The number of reduced Kogan faces with the permutation as type. St001592The maximal number of simple paths between any two different vertices of a graph. St000056The decomposition (or block) number 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. St000864The number of circled entries of the shifted recording tableau of a permutation. St000889The number of alternating sign matrices with the same antidiagonal sums. St000968We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n−1}]$ by adding $c_0$ to $c_{n−1}$. St001162The minimum jump of a permutation. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001344The neighbouring number of a permutation. St001665The number of pure excedances of a permutation. St001859The number of factors of the Stanley symmetric function associated with a permutation. St001941The evaluation at 1 of the modified Kazhdan--Lusztig R polynomial (as in [1, Section 5. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St000217The number of occurrences of the pattern 312 in a permutation. St000221The number of strong fixed points of a permutation. St000234The number of global ascents of a permutation. St000279The size of the preimage of the map 'cycle-as-one-line notation' from Permutations to Permutations. St000317The cycle descent number of a permutation. St000358The number of occurrences of the pattern 31-2. St000360The number of occurrences of the pattern 32-1. St000367The number of simsun double descents of a permutation. St000406The number of occurrences of the pattern 3241 in a permutation. St000407The number of occurrences of the pattern 2143 in a permutation. St000516The number of stretching pairs of a permutation. St000542The number of left-to-right-minima 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. St000666The number of right tethers of a permutation. St000674The number of hills of a Dyck path. St000709The number of occurrences of 14-2-3 or 14-3-2. 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. 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. St000962The 3-shifted major index of a permutation. 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. St001059Number of occurrences of the patterns 41352,42351,51342,52341 in a permutation. 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. 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. St001139The number of occurrences of hills of size 2 in a Dyck path. 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. 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. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001381The fertility of a permutation. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001471The magnitude of a Dyck path. St001498The normalised height of a Nakayama algebra with magnitude 1. St001513The number of nested exceedences 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. St001552The number of inversions between excedances and fixed points of a permutation. St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. 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. St001705The number of occurrences of the pattern 2413 in a permutation. St001715The number of non-records in a permutation. St001728The number of invisible descents of a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001766The number of cells which are not occupied by the same tile in all reduced pipe dreams corresponding to a permutation. St001810The number of fixed points of a permutation smaller than its largest moved point. 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. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St000053The number of valleys of the Dyck path. 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$. St001159Number of simple modules with dominant dimension equal to the global dimension in the corresponding Nakayama algebra. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St000475The number of parts equal to 1 in a partition. St000456The monochromatic index of a connected graph. St001118The acyclic chromatic index of a graph. St001695The natural comajor 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. St001712The number of natural descents of a standard Young tableau. St000069The number of maximal elements of a poset. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St001481The minimal height of a peak of a Dyck path. St000331The number of upper interactions of a Dyck path. St000999Number of indecomposable projective module with injective 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. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. 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$. St001257The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St000182The number of permutations whose cycle type is the given integer partition. St000321The number of integer partitions of n that are dominated by an integer partition. St000345The number of refinements of a partition. St000694The number of affine bounded permutations that project to a given permutation. St000847The number of standard Young tableaux whose descent set is the binary word. St000935The number of ordered refinements of an integer partition. St000964Gives the dimension of Ext^g(D(A),A) of the corresponding LNakayama algebra, when g denotes the global dimension of that algebra. 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)$. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001461The number of topologically connected components of the chord diagram of a permutation. St001590The crossing number of a perfect matching. St001830The chord expansion number of a perfect matching. St001832The number of non-crossing perfect matchings in the chord expansion of a perfect matching. 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. St001811The Castelnuovo-Mumford regularity of a permutation. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St000264The girth of a graph, which is not a tree. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000181The number of connected components of the Hasse diagram for the poset. St001081The number of minimal length factorizations of a permutation into star transpositions. St001661Half the permanent of the Identity matrix plus the permutation matrix associated to the permutation. St001761The maximal multiplicity of a letter in a reduced word of a permutation. St000986The multiplicity of the eigenvalue zero of the adjacency matrix of the graph. St001315The dissociation number of a graph. St001318The number of vertices of the largest induced subforest with the same number of connected components of a graph. St001321The number of vertices of the largest induced subforest of a graph. St001411The number of patterns 321 or 3412 in a permutation. St001691The number of kings in a graph. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St001342The number of vertices in the center of a graph. St001368The number of vertices of maximal degree in a graph. St000486The number of cycles of length at least 3 of a permutation. 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)$. St000488The number of cycles of a permutation of length at most 2. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St001850The number of Hecke atoms of a permutation. St000068The number of minimal elements in a poset. St001730The number of times the path corresponding to a binary word crosses the base line. St000908The length of the shortest maximal antichain in a poset. St001877Number of indecomposable injective modules with projective dimension 2. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St001389The number of partitions of the same length below the given integer partition. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees.