St001417The length of a longest palindromic subword of a binary word. St001437The flex of a binary word. St001884The number of borders of a binary word. St000294The number of distinct factors of a binary word. St000295The length of the border of a binary word. St000518The number of distinct subsequences in a binary word. St000519The largest length of a factor maximising the subword complexity. St000381The largest part of an integer composition. St000382The first part of an integer composition. St000383The last part of an integer composition. St000529The number of permutations whose descent word is the given binary word. St000543The size of the conjugacy class of a binary word. St000626The minimal period of a binary word. St000657The smallest part of an integer composition. St000808The number of up steps of the associated bargraph. St000983The length of the longest alternating subword. St001371The length of the longest Yamanouchi prefix of a binary word. St001631The number of simple modules $S$ with $dim Ext^1(S,A)=1$ in the incidence algebra $A$ of the poset. St001879The number of indecomposable summands of the top of the first syzygy of the dual of the regular module in the incidence algebra of the lattice. St000528The height of a poset. St000691The number of changes of a binary word. St000806The semiperimeter of the associated bargraph. St000907The number of maximal antichains of minimal length in a poset. St000911The number of maximal antichains of maximal size in a poset. St000912The number of maximal antichains in a poset. St001343The dimension of the reduced incidence algebra of a poset. St001838The number of nonempty primitive factors of a binary word. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St000070The number of antichains in a poset. St000013The height of a Dyck path. St000025The number of initial rises of a Dyck path. St000026The position of the first return of a Dyck path. St000071The number of maximal chains in a poset. St000081The number of edges of a graph. St000087The number of induced subgraphs. St000093The cardinality of a maximal independent set of vertices of a graph. St000117The number of centered tunnels of a Dyck path. St000144The pyramid weight of the Dyck path. St000145The Dyson rank of a partition. St000147The largest part of an integer partition. St000184The size of the centralizer of any permutation of given cycle type. St000228The size of a partition. St000258The burning number of a graph. St000259The diameter of a connected graph. St000273The domination number of a graph. St000277The number of ribbon shaped standard tableaux. St000287The number of connected components of a graph. St000309The number of vertices with even degree. St000315The number of isolated vertices of a graph. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000335The difference of lower and upper interactions. St000384The maximal part of the shifted composition of an integer partition. St000395The sum of the heights of the peaks of a Dyck path. St000438The position of the last up step in a Dyck path. St000443The number of long tunnels of a Dyck path. St000444The length of the maximal rise of a Dyck path. St000459The hook length of the base cell of a partition. St000460The hook length of the last cell along the main diagonal of an integer partition. St000469The distinguishing number of a graph. St000474Dyson's crank of a partition. St000477The weight of a partition according to Alladi. St000479The Ramsey number of a graph. St000482The (zero)-forcing number of a graph. St000531The leading coefficient of the rook polynomial of an integer partition. St000544The cop number of a graph. St000553The number of blocks of a graph. St000636The hull number of a graph. St000655The length of the minimal rise of a Dyck path. St000667The greatest common divisor of the parts of the partition. St000668The least common multiple of the parts of the partition. St000675The number of centered multitunnels of a Dyck path. St000681The Grundy value of Chomp on Ferrers diagrams. St000708The product of the parts of an integer partition. 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. St000770The major index of an integer partition when read from bottom to top. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St000774The maximal multiplicity of a Laplacian eigenvalue in a graph. St000775The multiplicity of the largest eigenvalue in a graph. St000776The maximal multiplicity of an eigenvalue in a graph. St000778The metric dimension of a graph. St000784The maximum of the length and the largest part of the integer partition. St000786The maximal number of occurrences of a colour in a proper colouring of a graph. St000835The minimal difference in size when partitioning the integer partition into two subpartitions. St000870The product of the hook lengths of the diagonal cells in an integer partition. St000899The maximal number of repetitions of an integer composition. St000900The minimal number of repetitions of a part in an integer composition. St000902 The minimal number of repetitions of an integer composition. St000904The maximal number of repetitions of an integer composition. St000916The packing number of a graph. St000917The open packing number of a graph. St000918The 2-limited packing number of a graph. St000926The clique-coclique number of a graph. St000986The multiplicity of the eigenvalue zero of the adjacency matrix of the graph. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St000992The alternating sum of the parts of an integer partition. St000999Number of indecomposable projective module with injective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001008Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001009Number of indecomposable injective modules with projective dimension g when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. St001013Number of indecomposable injective modules with codominant dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001014Number of indecomposable injective modules with codominant dimension equal to the dominant dimension of the Nakayama algebra corresponding to the Dyck path. St001015Number of indecomposable injective modules with codominant dimension equal to one in the Nakayama algebra corresponding to the Dyck path. St001016Number of indecomposable injective modules with codominant dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001017Number of indecomposable injective modules with projective dimension equal to the codominant dimension in the Nakayama algebra corresponding to the Dyck path. St001018Sum of projective dimension of the indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001019Sum of the projective dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001020Sum of the codominant dimensions of the non-projective indecomposable injective modules of the Nakayama algebra corresponding to the Dyck path. St001055The Grundy value for the game of removing cells of a row in an integer partition. St001070The absolute value of the derivative of the chromatic polynomial of the graph at 1. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001102The number of words with multiplicities of the letters given by the composition, avoiding the consecutive pattern 132. 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. St001119The length of a shortest maximal path in a graph. St001120The length of a longest path in a graph. St001126Number of simple module that are 1-regular in the corresponding Nakayama algebra. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. 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$. St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St001279The sum of the parts of an integer partition that are at least two. St001286The annihilation number of a graph. St001297The number of indecomposable non-injective projective modules minus the number of indecomposable non-injective projective modules that have reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001312Number of parabolic noncrossing partitions indexed by the composition. St001313The number of Dyck paths above the lattice path given by a binary word. 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. 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. St001340The cardinality of a minimal non-edge isolating set of a graph. St001342The number of vertices in the center of a graph. St001348The bounce of the parallelogram polyomino associated with the Dyck path. St001360The number of covering relations in Young's lattice below a partition. St001363The Euler characteristic of a graph according to Knill. St001366The maximal multiplicity of a degree of a vertex of a graph. St001368The number of vertices of maximal degree in a graph. St001373The logarithm of the number of winning configurations of the lights out game on a graph. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001389The number of partitions of the same length below the given integer partition. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001441The number of non-empty connected induced subgraphs of a graph. St001463The number of distinct columns in the nullspace of a graph. St001479The number of bridges of a graph. St001481The minimal height of a peak of a Dyck path. St001512The minimum rank of a graph. St001523The degree of symmetry of a Dyck path. St001527The cyclic permutation representation number of an integer partition. St001571The Cartan determinant of the integer partition. St001614The cyclic permutation representation number of a skew partition. St001615The number of join prime elements of a lattice. St001617The dimension of the space of valuations of a lattice. St001622The number of join-irreducible elements of a lattice. St001651The Frankl number of a lattice. St001654The monophonic hull number of a graph. St001655The general position number of a graph. St001656The monophonic position number of a graph. St001659The number of ways to place as many non-attacking rooks as possible on a Ferrers board. St001660The number of ways to place as many non-attacking rooks as possible on a skew Ferrers board. St001672The restrained domination number of a graph. St001675The number of parts equal to the part in the reversed composition. St001691The number of kings in a graph. St001809The index of the step at the first peak of maximal height in a Dyck path. St001820The size of the image of the pop stack sorting operator. St001828The Euler characteristic of a graph. St001829The common independence number of a graph. St001844The maximal degree of a generator of the invariant ring of the automorphism group of a graph. St001846The number of elements which do not have a complement in the lattice. St001910The height of the middle non-run of a Dyck path. St001917The order of toric promotion on the set of labellings of a graph. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001949The rigidity index of a graph. St001959The product of the heights of the peaks of a Dyck path. St000024The number of double up and double down steps of a Dyck path. St000063The number of linear extensions of a certain poset defined for an integer partition. St000108The number of partitions contained in the given partition. St000288The number of ones in a binary word. St000293The number of inversions of a binary word. St000313The number of degree 2 vertices of a graph. St000377The dinv defect of an integer partition. St000380Half of the maximal perimeter of a rectangle fitting into the diagram of an integer partition. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000439The position of the first down step of a Dyck path. St000442The maximal area to the right of an up step of a Dyck path. St000448The number of pairs of vertices of a graph with distance 2. St000452The number of distinct eigenvalues of a graph. St000453The number of distinct Laplacian eigenvalues of a graph. St000532The total number of rook placements on a Ferrers board. St000550The number of modular elements of a lattice. St000551The number of left modular elements of a lattice. St000552The number of cut vertices of a graph. St000682The Grundy value of Welter's game on a binary word. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000777The number of distinct eigenvalues of the distance Laplacian of a connected graph. St000874The position of the last double rise in a Dyck path. St000998Number of indecomposable projective modules with injective dimension smaller than or equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001012Number of simple modules with projective dimension at most 2 in the Nakayama algebra corresponding to the Dyck path. St001023Number of simple modules with projective dimension at most 3 in the Nakayama algebra corresponding to the Dyck path. St001027Number of simple modules with projective dimension equal to injective dimension in the Nakayama algebra corresponding to the Dyck path. St001065Number of indecomposable reflexive modules in the corresponding Nakayama algebra. St001093The detour number of a graph. St001166Number of indecomposable projective non-injective modules with dominant dimension equal to the global dimension plus the number of indecomposable projective injective modules in the corresponding Nakayama algebra. St001179Number of indecomposable injective modules with projective dimension at most 2 in the corresponding Nakayama algebra. St001180Number of indecomposable injective modules with projective dimension at most 1. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001190Number of simple modules with projective dimension at most 4 in the corresponding Nakayama algebra. St001211The number of simple modules in the corresponding Nakayama algebra that have vanishing second Ext-group with the regular module. St001213The number of indecomposable modules in the corresponding Nakayama algebra that have vanishing first Ext-group with the regular module. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001237The number of simple modules with injective dimension at most one or dominant dimension at least one. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St001259The vector space dimension of the double dual of D(A) in the corresponding Nakayama algebra. St001265The maximal i such that the i-th simple module has projective dimension equal to the global dimension in the corresponding Nakayama algebra. St001308The number of induced paths on three vertices in a graph. St001372The length of a longest cyclic run of ones of a binary word. St001400The total number of Littlewood-Richardson tableaux of given shape. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001480The number of simple summands of the module J^2/J^3. St001486The number of corners of the ribbon associated with an integer composition. St001492The number of simple modules that do not appear in the socle of the regular module or have no nontrivial selfextensions with the regular module in the corresponding Nakayama algebra. St001504The sum of all indegrees of vertices with indegree at least two in the resolution quiver of a Nakayama algebra corresponding to the Dyck path. St001521Half the total irregularity of a graph. St001616The number of neutral elements in a lattice. St001623The number of doubly irreducible elements of a lattice. St001626The number of maximal proper sublattices of a lattice. St001650The order of Ringel's homological bijection associated to the linear Nakayama algebra corresponding to the Dyck path. St001658The total number of rook placements on a Ferrers board. St001692The number of vertices with higher degree than the average degree in a graph. St001707The length of a longest path in a graph such that the remaining vertices can be partitioned into two sets of the same size without edges between them. St001720The minimal length of a chain of small intervals in a lattice. St001777The number of weak descents in an integer composition. St001814The number of partitions interlacing the given partition. St001875The number of simple modules with projective dimension at most 1. St000089The absolute variation of a composition. St000090The variation of a composition. St000091The descent variation of a composition. St000447The number of pairs of vertices of a graph with distance 3. St000877The depth of the binary word interpreted as a path. St000878The number of ones minus the number of zeros of a binary word. St000921The number of internal inversions of a binary word. St000931The number of occurrences of the pattern UUU in a Dyck path. St000967The value p(1) for the Coxeterpolynomial p of the corresponding LNakayama algebra. St001218Smallest index k greater than or equal to one such that the Coxeter matrix C of the corresponding Nakayama algebra has C^k=1. 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. St001306The number of induced paths on four vertices in a graph. St001619The number of non-isomorphic sublattices of a lattice. St001666The number of non-isomorphic subposets of a lattice which are lattices. St000826The stopping time of the decimal representation of the binary word for the 3x+1 problem. St000003The number of standard Young tableaux of the partition. St000007The number of saliances of the permutation. St000010The length of the partition. St000011The number of touch points (or returns) of a Dyck path. St000014The number of parking functions supported by a Dyck path. St000015The number of peaks of a Dyck path. St000018The number of inversions of a permutation. St000019The cardinality of the support of a permutation. St000022The number of fixed points of a permutation. St000027The major index of a Dyck path. St000028The number of stack-sorts needed to sort a permutation. St000031The number of cycles in the cycle decomposition of a permutation. St000047The number of standard immaculate tableaux of a given shape. St000048The multinomial of the parts of a partition. St000050The depth or height of a binary tree. St000054The first entry of the permutation. St000056The decomposition (or block) number of a permutation. St000058The order of a permutation. St000061The number of nodes on the left branch of a binary tree. St000062The length of the longest increasing subsequence of the permutation. St000064The number of one-box pattern of a permutation. St000066The column of the unique '1' in the first row of the alternating sign matrix. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000110The number of permutations less than or equal to a permutation in left weak order. St000111The sum of the descent tops (or Genocchi descents) of a permutation. St000148The number of odd parts of a partition. St000153The number of adjacent cycles of a permutation. St000160The multiplicity of the smallest part of a partition. St000166The depth minus 1 of an ordered tree. St000169The cocharge of a standard tableau. St000171The degree of the graph. St000172The Grundy number of a graph. St000189The number of elements in the poset. St000203The number of external nodes of a binary tree. St000213The number of weak exceedances (also weak excedences) of a permutation. St000215The number of adjacencies of a permutation, zero appended. St000221The number of strong fixed points of a permutation. St000229Sum of the difference between the maximal and the minimal elements of the blocks plus the number of blocks of a set partition. St000231Sum of the maximal elements of the blocks of a set partition. St000235The number of indices that are not cyclical small weak excedances. St000236The number of cyclical small weak excedances. St000237The number of small exceedances. St000239The number of small weak excedances. St000240The number of indices that are not small excedances. St000245The number of ascents of a permutation. St000248The number of anti-singletons of a set partition. St000249The number of singletons (St000247) plus the number of antisingletons (St000248) of a set partition. St000271The chromatic index of a graph. St000272The treewidth of a graph. St000286The number of connected components of the complement of a graph. St000290The major index of a binary word. St000297The number of leading ones in a binary word. St000308The height of the tree associated to a permutation. St000312The number of leaves in a graph. St000314The number of left-to-right-maxima of a permutation. St000325The width of the tree associated to a permutation. St000326The position of the first one in a binary word after appending a 1 at the end. St000330The (standard) major index of a standard tableau. St000336The leg major index of a standard tableau. St000338The number of pixed points of a permutation. St000362The size of a minimal vertex cover of a graph. St000363The number of minimal vertex covers of a graph. St000385The number of vertices with out-degree 1 in a binary tree. St000388The number of orbits of vertices of a graph under automorphisms. St000391The sum of the positions of the ones in a binary word. St000392The length of the longest run of ones in a binary word. St000414The binary logarithm of the number of binary trees with the same underlying unordered tree. St000419The number of Dyck paths that are weakly above the Dyck path, except for the path itself. St000420The number of Dyck paths that are weakly above a Dyck path. St000441The number of successions of a permutation. St000445The number of rises of length 1 of a Dyck path. St000451The length of the longest pattern of the form k 1 2. St000454The largest eigenvalue of a graph if it is integral. St000461The rix statistic of a permutation. St000463The number of admissible inversions of a permutation. St000470The number of runs in a permutation. St000475The number of parts equal to 1 in a partition. St000476The sum of the semi-lengths of tunnels before a valley of a Dyck path. St000485The length of the longest cycle of a permutation. St000487The length of the shortest cycle of a permutation. St000488The number of cycles of a permutation of length at most 2. St000489The number of cycles of a permutation of length at most 3. St000501The size of the first part in the decomposition of a permutation. St000504The cardinality of the first block of a set partition. St000505The biggest entry in the block containing the 1. St000507The number of ascents of a standard tableau. St000536The pathwidth of a graph. St000542The number of left-to-right-minima of a permutation. St000548The number of different non-empty partial sums of an integer partition. St000617The number of global maxima of a Dyck path. St000625The sum of the minimal distances to a greater element. St000628The balance of a binary word. St000645The sum of the areas of the rectangles formed by two consecutive peaks and the valley in between. St000654The first descent of a permutation. St000656The number of cuts of a poset. St000672The number of minimal elements in Bruhat order not less than the permutation. St000673The number of non-fixed points of a permutation. St000674The number of hills of a Dyck path. St000676The number of odd rises of a Dyck path. St000678The number of up steps after the last double rise of a Dyck path. St000680The Grundy value for Hackendot on posets. St000684The global dimension of the LNakayama algebra associated to a Dyck path. St000685The dominant dimension of the LNakayama algebra associated to a Dyck path. St000686The finitistic dominant dimension of a Dyck path. St000696The number of cycles in the breakpoint graph of a permutation. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000700The protection number of an ordered tree. St000702The number of weak deficiencies of a permutation. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000717The number of ordinal summands of a poset. St000718The largest Laplacian eigenvalue of a graph if it is integral. St000720The size of the largest partition in the oscillating tableau corresponding to the perfect matching. St000722The number of different neighbourhoods in a graph. St000724The label of the leaf of the path following the smaller label in the increasing binary tree associated to a permutation. St000725The smallest label of a leaf of the increasing binary tree associated to a permutation. St000727The largest label of a leaf in the binary search tree associated with the permutation. St000734The last entry in the first row of a standard tableau. St000740The last entry of a permutation. St000743The number of entries in a standard Young tableau such that the next integer is a neighbour. St000744The length of the path to the largest entry in a standard Young tableau. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000814The sum of the entries in the column specified by the partition of the change of basis matrix from elementary symmetric functions to Schur symmetric functions. St000819The propagating number of a perfect matching. St000822The Hadwiger number of the graph. St000823The number of unsplittable factors of the set partition. St000825The sum of the major and the inverse major index of a permutation. St000838The number of terminal right-hand endpoints when the vertices are written in order. St000844The size of the largest block in the direct sum decomposition of a permutation. St000863The length of the first row of the shifted shape of a permutation. St000867The sum of the hook lengths in the first row of an integer partition. St000873The aix statistic of a permutation. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St000883The number of longest increasing subsequences of a permutation. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St000906The length of the shortest maximal chain in a poset. St000923The minimal number with no two order isomorphic substrings of this length in a permutation. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000947The major index east count of a Dyck path. St000971The smallest closer of a set partition. St000974The length of the trunk of an ordered tree. St000975The length of the boundary minus the length of the trunk of an ordered tree. St000990The first ascent of a permutation. St000991The number of right-to-left minima of a permutation. St000993The multiplicity of the largest part of an integer partition. St000996The number of exclusive left-to-right maxima of a permutation. St001004The number of indices that are either left-to-right maxima or right-to-left minima. St001005The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001029The size of the core of a graph. St001032The number of horizontal steps in the bicoloured Motzkin path associated with the Dyck path. St001034The area of the parallelogram polyomino associated with the Dyck path. St001038The minimal height of a column in the parallelogram polyomino associated with the Dyck path. St001039The maximal height of a column in the parallelogram polyomino associated with a Dyck path. St001052The length of the exterior of a permutation. St001062The maximal size of a block of a set partition. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001074The number of inversions of the cyclic embedding of a permutation. St001075The minimal size of a block of a set partition. St001090The number of pop-stack-sorts needed to sort a permutation. St001091The number of parts in an integer partition whose next smaller part has the same size. St001096The size of the overlap set of a permutation. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. St001108The 2-dynamic chromatic number of a graph. St001110The 3-dynamic chromatic number of a graph. St001116The game chromatic number of a graph. St001118The acyclic chromatic index of a graph. St001127The sum of the squares of the parts of a partition. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001161The major index north count of a Dyck path. St001170Number of indecomposable injective modules whose socle has projective dimension at most g-1 when g denotes the global dimension in the corresponding Nakayama algebra. 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. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001202Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001203We associate to a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n-1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a Dyck path as follows: St001228The vector space dimension of the space of module homomorphisms between J and itself when J denotes the Jacobson radical of the corresponding Nakayama algebra. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001249Sum of the odd parts of a partition. St001250The number of parts of a partition that are not congruent 0 modulo 3. St001254The vector space dimension of the first extension-group between A/soc(A) and J when A is the corresponding Nakayama algebra with Jacobson radical J. St001258Gives the maximum of injective plus projective dimension of an indecomposable module over the corresponding Nakayama algebra. St001291The number of indecomposable summands of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001316The domatic number of a graph. St001330The hat guessing number of a graph. St001345The Hamming dimension of a graph. St001352The number of internal nodes in the modular decomposition of a graph. St001379The number of inversions plus the major index of a permutation. St001387Number of standard Young tableaux of the skew shape tracing the border of the given partition. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St001419The length of the longest palindromic factor beginning with a one of a binary word. St001439The number of even weak deficiencies and of odd weak exceedences. St001458The rank of the adjacency matrix of a graph. St001459The number of zero columns in the nullspace of a graph. St001461The number of topologically connected components of the chord diagram of a permutation. St001462The number of factors of a standard tableaux under concatenation. St001464The number of bases of the positroid corresponding to the permutation, with all fixed points counterclockwise. St001494The Alon-Tarsi number of a graph. St001497The position of the largest weak excedence of a permutation. St001498The normalised height of a Nakayama algebra with magnitude 1. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001530The depth of a Dyck path. St001554The number of distinct nonempty subtrees of a binary tree. St001566The length of the longest arithmetic progression in a permutation. St001580The acyclic chromatic number of a graph. St001581The achromatic number of a graph. St001595The number of standard Young tableaux of the skew partition. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St001641The number of ascent tops in the flattened set partition such that all smaller elements appear before. St001644The dimension of a graph. St001645The pebbling number of a connected graph. St001652The length of a longest interval of consecutive numbers. St001662The length of the longest factor of consecutive numbers in a permutation. St001670The connected partition number of a graph. St001688The sum of the squares of the heights of the peaks of a Dyck path. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001708The number of pairs of vertices of different degree in a graph. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001717The largest size of an interval in a poset. St001721The degree of a binary word. St001725The harmonious chromatic number of a graph. St001733The number of weak left to right maxima of a Dyck path. St001746The coalition number of a graph. St001759The Rajchgot index of a permutation. St001778The largest greatest common divisor of an element and its image in a permutation. St001780The order of promotion on the set of standard tableaux of given shape. St001800The number of 3-Catalan paths having this Dyck path as first and last coordinate projections. St001808The box weight or horizontal decoration of a Dyck path. St001816Eigenvalues of the top-to-random operator acting on a simple module. St001826The maximal number of leaves on a vertex of a graph. St001883The mutual visibility number of a graph. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001933The largest multiplicity of a part in an integer partition. St001951The number of factors in the disjoint direct product decomposition of the automorphism group of a graph. St001955The number of natural descents for set-valued two row standard Young tableaux. St001963The tree-depth of a graph. St000005The bounce statistic of a Dyck path. St000008The major index of the composition. St000021The number of descents of a permutation. St000029The depth of a permutation. St000030The sum of the descent differences of a permutations. St000051The size of the left subtree of a binary tree. St000053The number of valleys of the Dyck path. St000060The greater neighbor of the maximum. St000067The inversion number of the alternating sign matrix. St000080The rank of the poset. St000083The number of left oriented leafs of a binary tree except the first one. St000094The depth of an ordered tree. St000104The number of facets in the order polytope of this poset. St000120The number of left tunnels of a Dyck path. St000141The maximum drop size of a permutation. St000151The number of facets in the chain polytope of the poset. St000168The number of internal nodes of an ordered tree. St000185The weighted size of a partition. St000209Maximum difference of elements in cycles. St000210Minimum over maximum difference of elements in cycles. St000211The rank of the set partition. St000214The number of adjacencies of a permutation. St000216The absolute length of a permutation. St000234The number of global ascents of a permutation. St000238The number of indices that are not small weak excedances. St000250The number of blocks (St000105) plus the number of antisingletons (St000248) of a set partition. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000300The number of independent sets of vertices of a graph. St000301The number of facets of the stable set polytope of a graph. St000305The inverse major index of a permutation. St000306The bounce count of a Dyck path. St000310The minimal degree of a vertex of a graph. St000316The number of non-left-to-right-maxima of a permutation. St000331The number of upper interactions of a Dyck path. St000332The positive inversions of an alternating sign matrix. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000349The number of different adjacency matrices of a graph. St000354The number of recoils of a permutation. St000359The number of occurrences of the pattern 23-1. St000374The number of exclusive right-to-left minima of a permutation. St000468The Hosoya index of a graph. St000502The number of successions of a set partitions. St000503The maximal difference between two elements in a common block. St000520The number of patterns in a permutation. St000521The number of distinct subtrees of an ordered tree. St000530The number of permutations with the same descent word as the given permutation. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. St000546The number of global descents of a permutation. St000567The sum of the products of all pairs of parts. St000619The number of cyclic descents of a permutation. St000637The length of the longest cycle in a graph. St000642The size of the smallest orbit of antichains under Panyushev complementation. St000643The size of the largest orbit of antichains under Panyushev complementation. St000653The last descent of a permutation. St000662The staircase size of the code of a permutation. St000703The number of deficiencies of a permutation. St000728The dimension of a set partition. St000731The number of double exceedences of a permutation. St000738The first entry in the last row of a standard tableau. St000741The Colin de Verdière graph invariant. St000795The mad of a permutation. St000796The stat' of a permutation. St000797The stat`` of a permutation. St000798The makl of a permutation. St000809The reduced reflection length of the permutation. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000816The number of standard composition tableaux of the composition. St000820The number of compositions obtained by rotating the composition. St000829The Ulam distance of a permutation to the identity permutation. St000831The number of indices that are either descents or recoils. St000833The comajor index of a permutation. St000864The number of circled entries of the shifted recording tableau of a permutation. St000868The aid statistic in the sense of Shareshian-Wachs. St000915The Ore degree of a graph. St000932The number of occurrences of the pattern UDU in a Dyck path. St000946The sum of the skew hook positions in a Dyck path. St000954Number of times the corresponding LNakayama algebra has $Ext^i(D(A),A)=0$ for $i>0$. St000956The maximal displacement of a permutation. St000957The number of Bruhat lower covers of a permutation. 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}$. St000969We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n-1}]$ by adding $c_0$ to $c_{n-1}$. St000989The number of final rises of a permutation. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001046The maximal number of arcs nesting a given arc of a perfect matching. St001061The number of indices that are both descents and recoils of a permutation. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001076The minimal length of a factorization of a permutation into transpositions that are cyclic shifts of (12). St001077The prefix exchange distance of a permutation. St001128The exponens consonantiae of a partition. 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. St001182Number of indecomposable injective modules with codominant dimension at least two in the corresponding Nakayama algebra. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. 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$. 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$. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001216The number of indecomposable injective modules in the corresponding Nakayama algebra that have non-vanishing second Ext-group with the regular module. St001223Number of indecomposable projective non-injective modules P such that the modules X and Y in a an Auslander-Reiten sequence ending at P are torsionless. St001225The vector space dimension of the first extension group between J and itself when J is the Jacobson radical of the corresponding Nakayama algebra. St001227The vector space dimension of the first extension group between the socle of the regular module and the Jacobson radical of the corresponding Nakayama algebra. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. 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. St001245The cyclic maximal difference between two consecutive entries of a permutation. St001246The maximal difference between two consecutive entries of a permutation. St001255The vector space dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001270The bandwidth of a graph. St001274The number of indecomposable injective modules with projective dimension equal to two. St001277The degeneracy of a graph. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001298The number of repeated entries in the Lehmer code of a permutation. St001300The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset. St001323The independence gap of a graph. St001332The number of steps on the non-negative side of the walk associated with the permutation. St001357The maximal degree of a regular spanning subgraph of a graph. St001358The largest degree of a regular subgraph of a graph. St001365The number of lattice paths of the same length weakly above the path given by a binary word. St001391The disjunction number of a graph. St001405The number of bonds in a permutation. St001468The smallest fixpoint of a permutation. St001473The absolute value of the sum of all entries of the Coxeter matrix of the corresponding LNakayama algebra. St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St001485The modular major index of a binary word. St001489The maximum of the number of descents and the number of inverse descents. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001558The number of transpositions that are smaller or equal to a permutation in Bruhat order. St001579The number of cyclically simple transpositions decreasing the number of cyclic descents needed to sort a permutation. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001643The Frobenius dimension of the Nakayama algebra corresponding to the Dyck path. St001664The number of non-isomorphic subposets of a poset. St001671Haglund's hag of a permutation. St001674The number of vertices of the largest induced star graph in the graph. St001694The number of maximal dissociation sets in a graph. St001723The differential of a graph. St001724The 2-packing differential of a graph. St001782The order of rowmotion on the set of order ideals of a poset. 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. St001798The difference of the number of edges in a graph and the number of edges in the complement of the Turán graph. St001872The number of indecomposable injective modules with even projective dimension in the corresponding Nakayama algebra. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St001957The number of Hasse diagrams with a given underlying undirected graph. St001958The degree of the polynomial interpolating the values of a permutation. St001962The proper pathwidth of a graph. St000118The number of occurrences of the contiguous pattern [.,[.,[.,.]]] in a binary tree. St000225Difference between largest and smallest parts in a partition. St000242The number of indices that are not cyclical small weak excedances. St000317The cycle descent number of a permutation. St000358The number of occurrences of the pattern 31-2. St000365The number of double ascents of a permutation. St000366The number of double descents of a permutation. St000369The dinv deficit of a Dyck path. St000371The number of mid points of decreasing subsequences of length 3 in a permutation. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St000376The bounce deficit of a Dyck path. St000732The number of double deficiencies of a permutation. St000766The number of inversions of an integer composition. St000836The number of descents of distance 2 of a permutation. St000837The number of ascents of distance 2 of a permutation. St001010Number of indecomposable injective modules with projective dimension g-1 when g is the global dimension of the Nakayama algebra corresponding to the Dyck path. 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. St001082The number of boxed occurrences of 123 in a permutation. St001084The number of occurrences of the vincular pattern |1-23 in a permutation. St001087The number of occurrences of the vincular pattern |12-3 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. St001130The number of two successive successions in a permutation. 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. St001175The size of a partition minus the hook length of the base cell. 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. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001331The size of the minimal feedback vertex set. St001336The minimal number of vertices in a graph whose complement is triangle-free. St001584The area statistic between a Dyck path and its bounce path. St001593This is the number of standard Young tableaux of the given shifted shape. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St001706The number of closed sets in a graph. St001727The number of invisible inversions of a permutation. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St000276The size of the preimage of the map 'to graph' from Ordered trees to Graphs. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001570The minimal number of edges to add to make a graph Hamiltonian. St001649The length of a longest trail in a graph. St001827The number of two-component spanning forests of a graph. St001869The maximum cut size of a graph. St000299The number of nonisomorphic vertex-induced subtrees. St001834The number of non-isomorphic minors of a graph. St000004The major index of a permutation. St000134The size of the orbit of an alternating sign matrix under gyration. St000155The number of exceedances (also excedences) of a permutation. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000197The number of entries equal to positive one in the alternating sign matrix. St000224The sorting index of a permutation. St000334The maz index, the major index of a permutation after replacing fixed points by zeros. St000339The maf index of a permutation. St000446The disorder of a permutation. St000780The size of the orbit under rotation of a perfect matching. St000794The mak of a permutation. St000841The largest opener of a perfect matching. St000890The number of nonzero entries in an alternating sign matrix. St000896The number of zeros on the main diagonal of an alternating sign matrix. St000898The number of maximal entries in the last diagonal of the monotone triangle. St000924The number of topologically connected components of a perfect matching. St000961The shifted major index of a permutation. St001045The number of leaves in the subtree not containing one in the decreasing labelled binary unordered tree associated with the perfect matching. St001060The distinguishing index of a graph. St001117The game chromatic index of a graph. St001132The number of leaves in the subtree whose sister has label 1 in the decreasing labelled binary unordered tree associated with the perfect matching. St001136The largest label with larger sister in the leaf labelled binary unordered tree associated with the perfect matching. St001516The number of cyclic bonds of a permutation. St001589The nesting number of a perfect matching. 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. St001726The number of visible inversions of a permutation. St000039The number of crossings of a permutation. St000086The number of subgraphs. St000199The column of the unique '1' in the last row of the alternating sign matrix. St000226The convexity of a permutation. St000241The number of cyclical small excedances. St000327The number of cover relations in a poset. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000888The maximal sum of entries on a diagonal of an alternating sign matrix. St000892The maximal number of nonzero entries on a diagonal of an alternating sign matrix. St000949Gives the number of generalised tilting modules of the corresponding LNakayama algebra. St001000Number of indecomposable modules with projective dimension equal to the global dimension in the Nakayama algebra corresponding to the Dyck path. St001040The depth of the decreasing labelled binary unordered tree associated with the perfect matching. St001134The largest label in the subtree rooted at the sister of 1 in the leaf labelled binary unordered tree associated with the perfect matching. St001214The aft of an integer partition. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001519The pinnacle sum of a permutation. 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. St001637The number of (upper) dissectors of a poset. St001668The number of points of the poset minus the width of the poset. St001684The reduced word complexity of a permutation. St001742The difference of the maximal and the minimal degree in a graph. St001812The biclique partition number of a graph. St001925The minimal number of zeros in a row of an alternating sign matrix. St001948The number of augmented double ascents of a permutation. St001003The number of indecomposable modules with projective dimension at most 1 in the Nakayama algebra corresponding to the Dyck path. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001350Half of the Albertson index of a graph. St001557The number of inversions of the second entry of a permutation. St001578The minimal number of edges to add or remove to make a graph a line graph. St001960The number of descents of a permutation minus one if its first entry is not one. St000909The number of maximal chains of maximal size in a poset. St000693The modular (standard) major index of a standard tableau. St000945The number of matchings in the dihedral orbit of a perfect matching. St001420Half the length of a longest factor which is its own reverse-complement of a binary word. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001697The shifted natural comajor index of a standard Young tableau. St000044The number of vertices of the unicellular map given by a perfect matching. St000527The width of the poset. St001207The Lowey length of the algebra $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001488The number of corners of a skew partition. St001511The minimal number of transpositions needed to sort a permutation in either direction. St000735The last entry on the main diagonal of a standard tableau. St000307The number of rowmotion orbits of a poset. St000910The number of maximal chains of minimal length in a poset. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St001510The number of self-evacuating linear extensions of a finite poset. St001902The number of potential covers of a poset. St000632The jump number of the poset. St000848The balance constant multiplied with the number of linear extensions of a poset. St000849The number of 1/3-balanced pairs in a poset. St000850The number of 1/2-balanced pairs in a poset. St001397Number of pairs of incomparable elements in a finite poset. St001533The largest coefficient of the Poincare polynomial of the poset cone. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001942The number of loops of the quiver corresponding to the reduced incidence algebra of a poset. St001095The number of non-isomorphic posets with precisely one further covering relation. St000075The orbit size of a standard tableau under promotion. St000387The matching number of a graph. St001112The 3-weak dynamic number of a graph. St001261The Castelnuovo-Mumford regularity of a graph. St001618The cardinality of the Frattini sublattice of a lattice. St001734The lettericity of a graph. St000263The Szeged index of a graph. St000265The Wiener index of a graph. St000298The order dimension or Dushnik-Miller dimension of a poset. St000361The second Zagreb index of a graph. St000379The number of Hamiltonian cycles in a graph. St000640The rank of the largest boolean interval in a poset. St000845The maximal number of elements covered by an element in a poset. St000846The maximal number of elements covering an element of a poset. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St001071The beta invariant of the graph. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001280The number of parts of an integer partition that are at least two. St001282The number of graphs with the same chromatic polynomial. St001333The cardinality of a minimal edge-isolating set of a graph. St001341The number of edges in the center of a graph. St001349The number of different graphs obtained from the given graph by removing an edge. St001354The number of series nodes in the modular decomposition of a graph. St001393The induced matching number of a graph. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001638The book thickness of a graph. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another 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. St001776The degree of the minimal polynomial of the largest Laplacian eigenvalue of a graph. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001057The Grundy value of the game of creating an independent set in a graph. St001319The minimal number of occurrences of the star-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. St001353The number of prime nodes in the modular decomposition of a graph. 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. 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. St001743The discrepancy of a graph. St001871The number of triconnected components of 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$. St001432The order dimension of the partition. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition.