Your data matches 690 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Mp00214: Semistandard tableaux subcrystalPosets
St000080: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[1,2]]
=> ([(0,1)],2)
=> 1
[[1],[2]]
=> ([],1)
=> 0
[[1],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,2]]
=> ([(0,1)],2)
=> 1
[[1,1],[2]]
=> ([],1)
=> 0
[[1,2],[2]]
=> ([(0,1)],2)
=> 1
[[1,1],[3]]
=> ([(0,1)],2)
=> 1
[[1],[2],[3]]
=> ([],1)
=> 0
[[1,1,1,2]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2]]
=> ([],1)
=> 0
[[1,1,2],[2]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,2]]
=> ([],1)
=> 0
[[1],[2],[4]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[3]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,3]]
=> ([(0,1)],2)
=> 1
[[1,1],[2],[3]]
=> ([],1)
=> 0
[[1,2],[2],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1,2]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1],[2]]
=> ([],1)
=> 0
[[1,1,1,2],[2]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,2]]
=> ([],1)
=> 0
[[1,1,2],[2,2]]
=> ([(0,1)],2)
=> 1
[[1,1],[2],[4]]
=> ([(0,1)],2)
=> 1
[[1],[2],[3],[4]]
=> ([],1)
=> 0
[[1,1,1,1],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,3]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2],[3]]
=> ([],1)
=> 0
[[1,1,2],[2],[3]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,2],[3]]
=> ([],1)
=> 0
[[1,1],[2,3],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1,1,2]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1,1],[2]]
=> ([],1)
=> 0
[[1,1,1,1,2],[2]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1],[2,2]]
=> ([],1)
=> 0
[[1,1,1,2],[2,2]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,2,2]]
=> ([],1)
=> 0
[[1],[2],[3],[5]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2],[4]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,2],[4]]
=> ([(0,1)],2)
=> 1
[[1,1],[2],[3],[4]]
=> ([],1)
=> 0
[[1,2],[2],[3],[4]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1,1],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1],[2,3]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1],[2],[3]]
=> ([],1)
=> 0
[[1,1,1,2],[2],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,2,3]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,2],[3]]
=> ([],1)
=> 0
[[1,1,1],[2,3],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,2],[2,2],[3]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,2],[3,3]]
=> ([],1)
=> 0
Description
The rank of the poset.
Matching statistic: St000845
Mp00214: Semistandard tableaux subcrystalPosets
St000845: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[1,2]]
=> ([(0,1)],2)
=> 1
[[1],[2]]
=> ([],1)
=> 0
[[1],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,2]]
=> ([(0,1)],2)
=> 1
[[1,1],[2]]
=> ([],1)
=> 0
[[1,2],[2]]
=> ([(0,1)],2)
=> 1
[[1,1],[3]]
=> ([(0,1)],2)
=> 1
[[1],[2],[3]]
=> ([],1)
=> 0
[[1,1,1,2]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2]]
=> ([],1)
=> 0
[[1,1,2],[2]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,2]]
=> ([],1)
=> 0
[[1],[2],[4]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[3]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,3]]
=> ([(0,1)],2)
=> 1
[[1,1],[2],[3]]
=> ([],1)
=> 0
[[1,2],[2],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1,2]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1],[2]]
=> ([],1)
=> 0
[[1,1,1,2],[2]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,2]]
=> ([],1)
=> 0
[[1,1,2],[2,2]]
=> ([(0,1)],2)
=> 1
[[1,1],[2],[4]]
=> ([(0,1)],2)
=> 1
[[1],[2],[3],[4]]
=> ([],1)
=> 0
[[1,1,1,1],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,3]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2],[3]]
=> ([],1)
=> 0
[[1,1,2],[2],[3]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,2],[3]]
=> ([],1)
=> 0
[[1,1],[2,3],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1,1,2]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1,1],[2]]
=> ([],1)
=> 0
[[1,1,1,1,2],[2]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1],[2,2]]
=> ([],1)
=> 0
[[1,1,1,2],[2,2]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,2,2]]
=> ([],1)
=> 0
[[1],[2],[3],[5]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2],[4]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,2],[4]]
=> ([(0,1)],2)
=> 1
[[1,1],[2],[3],[4]]
=> ([],1)
=> 0
[[1,2],[2],[3],[4]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1,1],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1],[2,3]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1],[2],[3]]
=> ([],1)
=> 0
[[1,1,1,2],[2],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,2,3]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,2],[3]]
=> ([],1)
=> 0
[[1,1,1],[2,3],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,2],[2,2],[3]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,2],[3,3]]
=> ([],1)
=> 0
Description
The maximal number of elements covered by an element in a poset.
Matching statistic: St000846
Mp00214: Semistandard tableaux subcrystalPosets
St000846: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[1,2]]
=> ([(0,1)],2)
=> 1
[[1],[2]]
=> ([],1)
=> 0
[[1],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,2]]
=> ([(0,1)],2)
=> 1
[[1,1],[2]]
=> ([],1)
=> 0
[[1,2],[2]]
=> ([(0,1)],2)
=> 1
[[1,1],[3]]
=> ([(0,1)],2)
=> 1
[[1],[2],[3]]
=> ([],1)
=> 0
[[1,1,1,2]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2]]
=> ([],1)
=> 0
[[1,1,2],[2]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,2]]
=> ([],1)
=> 0
[[1],[2],[4]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[3]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,3]]
=> ([(0,1)],2)
=> 1
[[1,1],[2],[3]]
=> ([],1)
=> 0
[[1,2],[2],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1,2]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1],[2]]
=> ([],1)
=> 0
[[1,1,1,2],[2]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,2]]
=> ([],1)
=> 0
[[1,1,2],[2,2]]
=> ([(0,1)],2)
=> 1
[[1,1],[2],[4]]
=> ([(0,1)],2)
=> 1
[[1],[2],[3],[4]]
=> ([],1)
=> 0
[[1,1,1,1],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,3]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2],[3]]
=> ([],1)
=> 0
[[1,1,2],[2],[3]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,2],[3]]
=> ([],1)
=> 0
[[1,1],[2,3],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1,1,2]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1,1],[2]]
=> ([],1)
=> 0
[[1,1,1,1,2],[2]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1],[2,2]]
=> ([],1)
=> 0
[[1,1,1,2],[2,2]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,2,2]]
=> ([],1)
=> 0
[[1],[2],[3],[5]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2],[4]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,2],[4]]
=> ([(0,1)],2)
=> 1
[[1,1],[2],[3],[4]]
=> ([],1)
=> 0
[[1,2],[2],[3],[4]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1,1],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1],[2,3]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1],[2],[3]]
=> ([],1)
=> 0
[[1,1,1,2],[2],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,2,3]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,2],[3]]
=> ([],1)
=> 0
[[1,1,1],[2,3],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,2],[2,2],[3]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,2],[3,3]]
=> ([],1)
=> 0
Description
The maximal number of elements covering an element of a poset.
Mp00214: Semistandard tableaux subcrystalPosets
St001300: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[1,2]]
=> ([(0,1)],2)
=> 1
[[1],[2]]
=> ([],1)
=> 0
[[1],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,2]]
=> ([(0,1)],2)
=> 1
[[1,1],[2]]
=> ([],1)
=> 0
[[1,2],[2]]
=> ([(0,1)],2)
=> 1
[[1,1],[3]]
=> ([(0,1)],2)
=> 1
[[1],[2],[3]]
=> ([],1)
=> 0
[[1,1,1,2]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2]]
=> ([],1)
=> 0
[[1,1,2],[2]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,2]]
=> ([],1)
=> 0
[[1],[2],[4]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[3]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,3]]
=> ([(0,1)],2)
=> 1
[[1,1],[2],[3]]
=> ([],1)
=> 0
[[1,2],[2],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1,2]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1],[2]]
=> ([],1)
=> 0
[[1,1,1,2],[2]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,2]]
=> ([],1)
=> 0
[[1,1,2],[2,2]]
=> ([(0,1)],2)
=> 1
[[1,1],[2],[4]]
=> ([(0,1)],2)
=> 1
[[1],[2],[3],[4]]
=> ([],1)
=> 0
[[1,1,1,1],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,3]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2],[3]]
=> ([],1)
=> 0
[[1,1,2],[2],[3]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,2],[3]]
=> ([],1)
=> 0
[[1,1],[2,3],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1,1,2]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1,1],[2]]
=> ([],1)
=> 0
[[1,1,1,1,2],[2]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1],[2,2]]
=> ([],1)
=> 0
[[1,1,1,2],[2,2]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,2,2]]
=> ([],1)
=> 0
[[1],[2],[3],[5]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2],[4]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,2],[4]]
=> ([(0,1)],2)
=> 1
[[1,1],[2],[3],[4]]
=> ([],1)
=> 0
[[1,2],[2],[3],[4]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1,1],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1],[2,3]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1],[2],[3]]
=> ([],1)
=> 0
[[1,1,1,2],[2],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,2,3]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,2],[3]]
=> ([],1)
=> 0
[[1,1,1],[2,3],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,2],[2,2],[3]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,2],[3,3]]
=> ([],1)
=> 0
Description
The rank of the boundary operator in degree 1 of the chain complex of the order complex of the poset.
Mp00214: Semistandard tableaux subcrystalPosets
St001631: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[1,2]]
=> ([(0,1)],2)
=> 1
[[1],[2]]
=> ([],1)
=> 0
[[1],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,2]]
=> ([(0,1)],2)
=> 1
[[1,1],[2]]
=> ([],1)
=> 0
[[1,2],[2]]
=> ([(0,1)],2)
=> 1
[[1,1],[3]]
=> ([(0,1)],2)
=> 1
[[1],[2],[3]]
=> ([],1)
=> 0
[[1,1,1,2]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2]]
=> ([],1)
=> 0
[[1,1,2],[2]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,2]]
=> ([],1)
=> 0
[[1],[2],[4]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[3]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,3]]
=> ([(0,1)],2)
=> 1
[[1,1],[2],[3]]
=> ([],1)
=> 0
[[1,2],[2],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1,2]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1],[2]]
=> ([],1)
=> 0
[[1,1,1,2],[2]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,2]]
=> ([],1)
=> 0
[[1,1,2],[2,2]]
=> ([(0,1)],2)
=> 1
[[1,1],[2],[4]]
=> ([(0,1)],2)
=> 1
[[1],[2],[3],[4]]
=> ([],1)
=> 0
[[1,1,1,1],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,3]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2],[3]]
=> ([],1)
=> 0
[[1,1,2],[2],[3]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,2],[3]]
=> ([],1)
=> 0
[[1,1],[2,3],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1,1,2]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1,1],[2]]
=> ([],1)
=> 0
[[1,1,1,1,2],[2]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1],[2,2]]
=> ([],1)
=> 0
[[1,1,1,2],[2,2]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,2,2]]
=> ([],1)
=> 0
[[1],[2],[3],[5]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2],[4]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,2],[4]]
=> ([(0,1)],2)
=> 1
[[1,1],[2],[3],[4]]
=> ([],1)
=> 0
[[1,2],[2],[3],[4]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1,1],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1],[2,3]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1],[2],[3]]
=> ([],1)
=> 0
[[1,1,1,2],[2],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,2,3]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,2],[3]]
=> ([],1)
=> 0
[[1,1,1],[2,3],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,2],[2,2],[3]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,2],[3,3]]
=> ([],1)
=> 0
Description
The number of simple modules $S$ with $dim Ext^1(S,A)=1$ in the incidence algebra $A$ of the poset.
Matching statistic: St001942
Mp00214: Semistandard tableaux subcrystalPosets
St001942: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[1,2]]
=> ([(0,1)],2)
=> 1
[[1],[2]]
=> ([],1)
=> 0
[[1],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,2]]
=> ([(0,1)],2)
=> 1
[[1,1],[2]]
=> ([],1)
=> 0
[[1,2],[2]]
=> ([(0,1)],2)
=> 1
[[1,1],[3]]
=> ([(0,1)],2)
=> 1
[[1],[2],[3]]
=> ([],1)
=> 0
[[1,1,1,2]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2]]
=> ([],1)
=> 0
[[1,1,2],[2]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,2]]
=> ([],1)
=> 0
[[1],[2],[4]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[3]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,3]]
=> ([(0,1)],2)
=> 1
[[1,1],[2],[3]]
=> ([],1)
=> 0
[[1,2],[2],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1,2]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1],[2]]
=> ([],1)
=> 0
[[1,1,1,2],[2]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,2]]
=> ([],1)
=> 0
[[1,1,2],[2,2]]
=> ([(0,1)],2)
=> 1
[[1,1],[2],[4]]
=> ([(0,1)],2)
=> 1
[[1],[2],[3],[4]]
=> ([],1)
=> 0
[[1,1,1,1],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,3]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2],[3]]
=> ([],1)
=> 0
[[1,1,2],[2],[3]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,2],[3]]
=> ([],1)
=> 0
[[1,1],[2,3],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1,1,2]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1,1],[2]]
=> ([],1)
=> 0
[[1,1,1,1,2],[2]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1],[2,2]]
=> ([],1)
=> 0
[[1,1,1,2],[2,2]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,2,2]]
=> ([],1)
=> 0
[[1],[2],[3],[5]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2],[4]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,2],[4]]
=> ([(0,1)],2)
=> 1
[[1,1],[2],[3],[4]]
=> ([],1)
=> 0
[[1,2],[2],[3],[4]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1,1],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1],[2,3]]
=> ([(0,1)],2)
=> 1
[[1,1,1,1],[2],[3]]
=> ([],1)
=> 0
[[1,1,1,2],[2],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,2,3]]
=> ([(0,1)],2)
=> 1
[[1,1,1],[2,2],[3]]
=> ([],1)
=> 0
[[1,1,1],[2,3],[3]]
=> ([(0,1)],2)
=> 1
[[1,1,2],[2,2],[3]]
=> ([(0,1)],2)
=> 1
[[1,1],[2,2],[3,3]]
=> ([],1)
=> 0
Description
The number of loops of the quiver corresponding to the reduced incidence algebra of a poset.
Mp00214: Semistandard tableaux subcrystalPosets
St000189: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[1,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1],[2]]
=> ([],1)
=> 1 = 0 + 1
[[1],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2]]
=> ([],1)
=> 1 = 0 + 1
[[1,2],[2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1],[2],[3]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,2],[2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2,2]]
=> ([],1)
=> 1 = 0 + 1
[[1],[2],[4]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2,3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2],[3]]
=> ([],1)
=> 1 = 0 + 1
[[1,2],[2],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1],[2]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1,2],[2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2,2]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,2],[2,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2],[4]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1],[2],[3],[4]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1,1],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2,3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2],[3]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,2],[2],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2,2],[3]]
=> ([],1)
=> 1 = 0 + 1
[[1,1],[2,3],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1,1,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1,1],[2]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1,1,2],[2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1],[2,2]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1,2],[2,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2,2,2]]
=> ([],1)
=> 1 = 0 + 1
[[1],[2],[3],[5]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2],[4]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2,2],[4]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2],[3],[4]]
=> ([],1)
=> 1 = 0 + 1
[[1,2],[2],[3],[4]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1,1],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1],[2,3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1],[2],[3]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1,2],[2],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2,2,3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2,2],[3]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1],[2,3],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,2],[2,2],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2,2],[3,3]]
=> ([],1)
=> 1 = 0 + 1
Description
The number of elements in the poset.
Mp00214: Semistandard tableaux subcrystalPosets
St000528: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[1,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1],[2]]
=> ([],1)
=> 1 = 0 + 1
[[1],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2]]
=> ([],1)
=> 1 = 0 + 1
[[1,2],[2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1],[2],[3]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,2],[2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2,2]]
=> ([],1)
=> 1 = 0 + 1
[[1],[2],[4]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2,3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2],[3]]
=> ([],1)
=> 1 = 0 + 1
[[1,2],[2],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1],[2]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1,2],[2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2,2]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,2],[2,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2],[4]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1],[2],[3],[4]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1,1],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2,3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2],[3]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,2],[2],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2,2],[3]]
=> ([],1)
=> 1 = 0 + 1
[[1,1],[2,3],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1,1,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1,1],[2]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1,1,2],[2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1],[2,2]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1,2],[2,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2,2,2]]
=> ([],1)
=> 1 = 0 + 1
[[1],[2],[3],[5]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2],[4]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2,2],[4]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2],[3],[4]]
=> ([],1)
=> 1 = 0 + 1
[[1,2],[2],[3],[4]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1,1],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1],[2,3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1],[2],[3]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1,2],[2],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2,2,3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2,2],[3]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1],[2,3],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,2],[2,2],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2,2],[3,3]]
=> ([],1)
=> 1 = 0 + 1
Description
The height of a poset. This equals the rank of the poset [[St000080]] plus one.
Mp00214: Semistandard tableaux subcrystalPosets
St000907: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[1,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1],[2]]
=> ([],1)
=> 1 = 0 + 1
[[1],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2]]
=> ([],1)
=> 1 = 0 + 1
[[1,2],[2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1],[2],[3]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,2],[2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2,2]]
=> ([],1)
=> 1 = 0 + 1
[[1],[2],[4]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2,3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2],[3]]
=> ([],1)
=> 1 = 0 + 1
[[1,2],[2],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1],[2]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1,2],[2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2,2]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,2],[2,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2],[4]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1],[2],[3],[4]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1,1],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2,3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2],[3]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,2],[2],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2,2],[3]]
=> ([],1)
=> 1 = 0 + 1
[[1,1],[2,3],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1,1,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1,1],[2]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1,1,2],[2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1],[2,2]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1,2],[2,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2,2,2]]
=> ([],1)
=> 1 = 0 + 1
[[1],[2],[3],[5]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2],[4]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2,2],[4]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2],[3],[4]]
=> ([],1)
=> 1 = 0 + 1
[[1,2],[2],[3],[4]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1,1],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1],[2,3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1],[2],[3]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1,2],[2],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2,2,3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2,2],[3]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1],[2,3],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,2],[2,2],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2,2],[3,3]]
=> ([],1)
=> 1 = 0 + 1
Description
The number of maximal antichains of minimal length in a poset.
Mp00214: Semistandard tableaux subcrystalPosets
St000911: Posets ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[[1,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1],[2]]
=> ([],1)
=> 1 = 0 + 1
[[1],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2]]
=> ([],1)
=> 1 = 0 + 1
[[1,2],[2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1],[2],[3]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,2],[2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2,2]]
=> ([],1)
=> 1 = 0 + 1
[[1],[2],[4]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2,3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2],[3]]
=> ([],1)
=> 1 = 0 + 1
[[1,2],[2],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1],[2]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1,2],[2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2,2]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,2],[2,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2],[4]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1],[2],[3],[4]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1,1],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2,3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2],[3]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,2],[2],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2,2],[3]]
=> ([],1)
=> 1 = 0 + 1
[[1,1],[2,3],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1,1,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1,1],[2]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1,1,2],[2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1],[2,2]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1,2],[2,2]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2,2,2]]
=> ([],1)
=> 1 = 0 + 1
[[1],[2],[3],[5]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2],[4]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2,2],[4]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2],[3],[4]]
=> ([],1)
=> 1 = 0 + 1
[[1,2],[2],[3],[4]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1,1],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1],[2,3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1,1],[2],[3]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1,2],[2],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2,2,3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,1],[2,2],[3]]
=> ([],1)
=> 1 = 0 + 1
[[1,1,1],[2,3],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1,2],[2,2],[3]]
=> ([(0,1)],2)
=> 2 = 1 + 1
[[1,1],[2,2],[3,3]]
=> ([],1)
=> 1 = 0 + 1
Description
The number of maximal antichains of maximal size in a poset.
The following 680 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000912The number of maximal antichains in a poset. St001343The dimension of the reduced incidence algebra of a poset. St001636The number of indecomposable injective modules with projective dimension at most one in the incidence algebra of the poset. St001717The largest size of an interval in a poset. St001813The product of the sizes of the principal order filters in a poset. St001815The number of order preserving surjections from a poset to a total order. St000070The number of antichains in a poset. St000104The number of facets in the order polytope of this poset. St000151The number of facets in the chain polytope of the poset. St001664The number of non-isomorphic subposets of a poset. St001782The order of rowmotion on the set of order ideals of a poset. St000081The number of edges of a graph. St000137The Grundy value of an integer partition. St000142The number of even parts of a partition. St000145The Dyson rank of a partition. St000148The number of odd parts of a partition. St000149The number of cells of the partition whose leg is zero and arm is odd. St000171The degree of the graph. St000256The number of parts from which one can substract 2 and still get an integer partition. St000259The diameter of a connected graph. St000260The radius of a connected 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. St000274The number of perfect matchings of a graph. St000310The minimal degree of a vertex of a graph. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000361The second Zagreb index of a graph. St000362The size of a minimal vertex cover of a graph. St000377The dinv defect of an integer partition. St000387The matching number of a graph. St000454The largest eigenvalue of a graph if it is integral. St000466The Gutman (or modified Schultz) index of a connected graph. St000473The number of parts of a partition that are strictly bigger than the number of ones. St000480The number of lower covers of a partition in dominance order. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000513The number of invariant subsets of size 2 when acting with a permutation of given cycle type. St000535The rank-width of a graph. St000536The pathwidth of a graph. St000537The cutwidth of a graph. St000547The number of even non-empty partial sums of an integer partition. St000549The number of odd partial sums of an integer partition. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000697The number of 3-rim hooks removed from an integer partition to obtain its associated 3-core. St000741The Colin de Verdière graph invariant. St000752The Grundy value for the game 'Couples are forever' on an integer partition. St000778The metric dimension of a graph. St000811The sum of the entries in the column specified by the partition of the change of basis matrix from powersum symmetric functions to Schur symmetric functions. St000928The sum of the coefficients of the character polynomial of an integer partition. St000944The 3-degree of an integer partition. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St000987The number of positive eigenvalues of the Laplacian matrix of the graph. St001056The Grundy value for the game of deleting vertices of a graph until it has no edges. St001071The beta invariant of the graph. St001092The number of distinct even parts of a partition. St001117The game chromatic index of a graph. St001119The length of a shortest maximal path in a graph. St001120The length of a longest path in a graph. St001247The number of parts of a partition that are not congruent 2 modulo 3. St001251The number of parts of a partition that are not congruent 1 modulo 3. St001252Half the sum of the even parts of a partition. St001270The bandwidth of a graph. St001271The competition number of a graph. St001277The degeneracy of a graph. St001280The number of parts of an integer partition that are at least two. St001333The cardinality of a minimal edge-isolating set of a graph. St001340The cardinality of a minimal non-edge isolating set of a graph. St001341The number of edges in the center of a graph. St001345The Hamming dimension of a graph. St001347The number of pairs of vertices of a graph having the same neighbourhood. 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. St001357The maximal degree of a regular spanning subgraph of a graph. St001358The largest degree of a regular subgraph of a graph. St001362The normalized Knill dimension of a graph. St001382The number of boxes in the diagram of a partition that do not lie in its Durfee square. St001383The BG-rank of an integer partition. St001384The number of boxes in the diagram of a partition that do not lie in the largest triangle it contains. St001391The disjunction number of a graph. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001393The induced matching number of a graph. St001395The number of strictly unfriendly partitions of a graph. St001479The number of bridges of a graph. St001512The minimum rank of a graph. St001541The Gini index of an integer partition. St001587Half of the largest even part of 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. 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. St001644The dimension of a graph. St001649The length of a longest trail in a graph. St001651The Frankl number of a lattice. St001657The number of twos in an integer partition. St001702The absolute value of the determinant of the adjacency matrix of a graph. St001743The discrepancy of a graph. St001767The largest minimal number of arrows pointing to a cell in the Ferrers diagram in any assignment. St001783The number of odd automorphisms of a graph. St001792The arboricity of a graph. St001794Half the number of sets of vertices in a graph which are dominating and non-blocking. St001799The number of proper separations of a graph. St001812The biclique partition number of a graph. St001826The maximal number of leaves on a vertex of a graph. St001827The number of two-component spanning forests of a graph. St001846The number of elements which do not have a complement in the lattice. St001869The maximum cut size of a graph. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001949The rigidity index of a graph. St001962The proper pathwidth of a graph. St000086The number of subgraphs. St000087The number of induced subgraphs. St000088The row sums of the character table of the symmetric group. St000093The cardinality of a maximal independent set of vertices of a graph. St000097The order of the largest clique of the graph. St000098The chromatic number of a graph. St000147The largest part of an integer partition. St000172The Grundy number of a graph. St000179The product of the hook lengths of the integer partition. St000182The number of permutations whose cycle type is the given integer partition. St000184The size of the centralizer of any permutation of given cycle type. St000207Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000208Number of integral Gelfand-Tsetlin polytopes with prescribed top row and integer partition weight. St000228The size of a partition. St000244The cardinality of the automorphism group of a graph. St000258The burning number of a graph. St000269The number of acyclic orientations of a graph. St000270The number of forests contained in a graph. St000273The domination number of a graph. St000283The size of the preimage of the map 'to graph' from Binary trees to Graphs. St000286The number of connected components of the complement of a graph. St000287The number of connected components of a graph. St000299The number of nonisomorphic vertex-induced subtrees. St000309The number of vertices with even degree. St000315The number of isolated vertices of a graph. St000321The number of integer partitions of n that are dominated by an integer partition. St000343The number of spanning subgraphs of a graph. St000345The number of refinements of a partition. St000363The number of minimal vertex covers of a graph. St000364The exponent of the automorphism group of a graph. St000378The diagonal inversion number of an integer partition. St000384The maximal part of the shifted composition of an integer partition. St000452The number of distinct eigenvalues of a graph. St000453The number of distinct Laplacian eigenvalues of a graph. St000459The hook length of the base cell of a partition. St000460The hook length of the last cell along the main diagonal of an integer partition. St000468The Hosoya index of a graph. St000469The distinguishing number of a graph. St000478Another weight of a partition according to Alladi. St000479The Ramsey number of a graph. St000482The (zero)-forcing number of a graph. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000531The leading coefficient of the rook polynomial of an integer partition. St000544The cop number of a graph. St000550The number of modular elements of a lattice. St000551The number of left modular elements of a lattice. St000553The number of blocks of a graph. St000636The hull number of a graph. St000644The number of graphs with given frequency partition. St000667The greatest common divisor of the parts of the partition. St000681The Grundy value of Chomp on Ferrers diagrams. St000722The number of different neighbourhoods in a graph. St000723The maximal cardinality of a set of vertices with the same neighbourhood in a graph. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. 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. St000777The number of distinct eigenvalues of the distance Laplacian of a connected 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. St000812The sum of the entries in the column specified by the partition of the change of basis matrix from complete homogeneous symmetric functions to monomial symmetric functions. St000822The Hadwiger number of the graph. St000835The minimal difference in size when partitioning the integer partition into two subpartitions. St000870The product of the hook lengths of the diagonal cells in an integer partition. 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. St000935The number of ordered refinements of an integer partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St000972The composition number of a graph. St000986The multiplicity of the eigenvalue zero of the adjacency matrix of the graph. St000992The alternating sum of the parts of an integer partition. St001029The size of the core of a graph. St001055The Grundy value for the game of removing cells of a row in an integer partition. St001070The absolute value of the derivative of the chromatic polynomial of the graph at 1. 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. St001286The annihilation number of a graph. St001302The number of minimally dominating sets of vertices of a graph. St001304The number of maximally independent sets of vertices of a graph. St001315The dissociation number of a graph. St001316The domatic number of a graph. St001318The number of vertices of the largest induced subforest with the same number of connected components of a graph. St001321The number of vertices of the largest induced subforest of a graph. St001322The size of a minimal independent dominating set in a graph. St001330The hat guessing number of a graph. St001337The upper domination number of a graph. St001338The upper irredundance number of a graph. St001339The irredundance number of a graph. St001342The number of vertices in the center of a graph. 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. St001378The product of the cohook lengths of the integer partition. St001380The number of monomer-dimer tilings of a Ferrers diagram. St001385The number of conjugacy classes of subgroups with connected subgroups of sizes prescribed by an integer partition. St001389The number of partitions of the same length below the given integer partition. St001441The number of non-empty connected induced subgraphs of a graph. St001463The number of distinct columns in the nullspace of a graph. St001474The evaluation of the Tutte polynomial of the graph at (x,y) equal to (2,-1). St001494The Alon-Tarsi number of a graph. St001527The cyclic permutation representation number of an integer partition. St001571The Cartan determinant of the integer partition. St001580The acyclic chromatic number of a graph. St001581The achromatic number of a graph. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001600The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple graphs. St001606The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on set partitions. St001607The number of coloured graphs such that the multiplicities of colours are given by a partition. St001608The number of coloured rooted trees such that the multiplicities of colours are given by a partition. St001611The number of multiset partitions such that the multiplicities of elements are given by a partition. St001612The number of coloured multisets of cycles such that the multiplicities of colours are given by a partition. St001616The number of neutral elements in a lattice. St001625The Möbius invariant of a lattice. St001627The number of coloured connected graphs such that the multiplicities of colours are given by a partition. St001628The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on simple connected graphs. St001642The Prague dimension of a graph. St001645The pebbling number of a connected graph. St001654The monophonic hull number of a graph. St001655The general position number of a graph. St001656The monophonic position number of a graph. St001659The number of ways to place as many non-attacking rooks as possible on a Ferrers board. St001670The connected partition number of a graph. St001672The restrained domination number of a graph. St001674The number of vertices of the largest induced star graph in the graph. St001679The number of subsets of a lattice whose meet is the bottom element. St001691The number of kings in a graph. St001707The length of a longest path in a graph such that the remaining vertices can be partitioned into two sets of the same size without edges between them. St001710The number of permutations such that conjugation with a permutation of given cycle type yields the inverse permutation. St001720The minimal length of a chain of small intervals in a lattice. St001725The harmonious chromatic number of a graph. St001746The coalition number of a graph. St001754The number of tolerances of a finite lattice. St001757The number of orbits of toric promotion on a graph. St001758The number of orbits of promotion on a graph. St001765The number of connected components of the friends and strangers graph. St001802The number of endomorphisms of a graph. 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. St001883The mutual visibility number of a graph. St001914The size of the orbit of an integer partition in Bulgarian solitaire. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001938The number of transitive monotone factorizations of genus zero of a permutation of given cycle type. St001963The tree-depth of a graph. St000063The number of linear extensions of a certain poset defined for an integer partition. St000108The number of partitions contained in the given partition. St000300The number of independent sets of vertices of a graph. St000301The number of facets of the stable set polytope of a graph. St000380Half of the maximal perimeter of a rectangle fitting into the diagram of an integer partition. St000474Dyson's crank of a partition. St000477The weight of a partition according to Alladi. St000532The total number of rook placements on a Ferrers board. St000668The least common multiple of the parts of the partition. 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. St000933The number of multipartitions of sizes given by an integer partition. St000937The number of positive values of the symmetric group character corresponding to the partition. St001279The sum of the parts of an integer partition that are at least two. St001400The total number of Littlewood-Richardson tableaux of given shape. St001619The number of non-isomorphic sublattices of a lattice. St001626The number of maximal proper sublattices of a lattice. St001666The number of non-isomorphic subposets of a lattice which are lattices. St001814The number of partitions interlacing the given partition. St001834The number of non-isomorphic minors of a graph. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000005The bounce statistic of a Dyck path. St000006The dinv of a Dyck path. St000008The major index of the composition. St000009The charge of a standard tableau. St000012The area of a Dyck path. St000016The number of attacking pairs of a standard tableau. St000024The number of double up and double down steps of a Dyck path. St000053The number of valleys of the Dyck path. St000120The number of left tunnels of a Dyck path. St000143The largest repeated part of a partition. St000150The floored half-sum of the multiplicities of a partition. St000185The weighted size of a partition. St000257The number of distinct parts of a partition that occur at least twice. St000306The bounce count of a Dyck path. St000329The number of evenly positioned ascents of the Dyck path, with the initial position equal to 1. St000331The number of upper interactions of a Dyck path. St000386The number of factors DDU in a Dyck path. St000394The sum of the heights of the peaks of a Dyck path minus the number of peaks. St000421The number of Dyck paths that are weakly below a Dyck path, except for the path itself. St000442The maximal area to the right of an up step of a Dyck path. St000481The number of upper covers of a partition in dominance order. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000645The sum of the areas of the rectangles formed by two consecutive peaks and the valley in between. St000658The number of rises of length 2 of a Dyck path. St000659The number of rises of length at least 2 of a Dyck path. St000683The number of points below the Dyck path such that the diagonal to the north-east hits the path between two down steps, and the diagonal to the north-west hits the path between two up steps. St000688The global dimension minus the dominant dimension of the LNakayama algebra associated to a Dyck path. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St000743The number of entries in a standard Young tableau such that the next integer is a neighbour. St000791The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. St000874The position of the last double rise in a Dyck path. St000877The depth of the binary word interpreted as a path. St000885The number of critical steps in the Catalan decomposition of a binary word. St000921The number of internal inversions of a binary word. St000954Number of times the corresponding LNakayama algebra has $Ext^i(D(A),A)=0$ for $i>0$. St000970Number of peaks minus the dominant dimension of the corresponding LNakayama algebra. St000976The sum of the positions of double up-steps of a Dyck path. St000984The number of boxes below precisely one peak. St001008Number of indecomposable injective modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. 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. St001011Number of simple modules of projective dimension 2 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. St001026The maximum of the projective dimensions of the indecomposable non-projective injective modules minus the minimum in the Nakayama algebra corresponding to the Dyck path. St001027Number of simple modules with projective dimension equal to injective dimension in the Nakayama algebra corresponding to the Dyck path. St001031The height of the bicoloured Motzkin path associated with the Dyck path. St001035The convexity degree of the parallelogram polyomino associated with the Dyck path. St001036The number of inner corners of the parallelogram polyomino associated with the Dyck path. St001067The number of simple modules of dominant dimension at least two in the corresponding Nakayama algebra. St001091The number of parts in an integer partition whose next smaller part has the same size. St001125The number of simple modules that satisfy the 2-regular condition in the corresponding Nakayama algebra. St001126Number of simple module that are 1-regular in the corresponding Nakayama algebra. St001139The number of occurrences of hills of size 2 in a Dyck path. St001142The projective dimension of the socle of the regular module as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001161The major index north count of a Dyck path. St001164Number of indecomposable injective modules whose socle has projective dimension at most g-1 (g the global dimension) minus the number of indecomposable projective-injective modules. St001169Number of simple modules with projective dimension at least two in the corresponding Nakayama algebra. St001176The size of a partition minus its first part. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path. St001189The number of simple modules with dominant and codominant dimension equal to zero in the Nakayama algebra corresponding to the Dyck path. St001192The maximal dimension of $Ext_A^2(S,A)$ for a simple module $S$ over the corresponding Nakayama algebra $A$. St001197The global 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$. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. 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. St001217The projective dimension of the indecomposable injective module I[n-2] in the corresponding Nakayama algebra with simples enumerated from 0 to n-1. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension 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. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001233The number of indecomposable 2-dimensional modules with projective dimension one. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001273The projective dimension of the first term in an injective coresolution of the regular module. St001274The number of indecomposable injective modules with projective dimension equal to two. St001276The number of 2-regular indecomposable modules in the corresponding Nakayama algebra. St001278The number of indecomposable modules that are fixed by $\tau \Omega^1$ composed with its inverse in the corresponding Nakayama algebra. St001294The maximal torsionfree index of a simple non-projective module in the corresponding Nakayama algebra. St001295Gives the vector space dimension of the homomorphism space between J^2 and J^2. St001296The maximal torsionfree index of an indecomposable non-projective module in the corresponding Nakayama algebra. St001418Half of the global dimension of the stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001424The number of distinct squares in a binary word. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001480The number of simple summands of the module J^2/J^3. St001502The global dimension minus the dominant dimension of magnitude 1 Nakayama algebras. St001506Half the projective dimension of the unique simple module with even projective dimension in a magnitude 1 Nakayama algebra. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001508The degree of the standard monomial associated to a Dyck path relative to the diagonal boundary. St001509The degree of the standard monomial associated to a Dyck path relative to the trivial lower boundary. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001594The number of indecomposable projective modules in the Nakayama algebra corresponding to the Dyck path such that the UC-condition is satisfied. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001718The number of non-empty open intervals in a poset. St001730The number of times the path corresponding to a binary word crosses the base line. St001777The number of weak descents in an integer composition. St001873For a Nakayama algebra corresponding to a Dyck path, we define the matrix C with entries the Hom-spaces between $e_i J$ and $e_j J$ (the radical of the indecomposable projective modules). St001931The weak major index of an integer composition regarded as a word. St001932The number of pairs of singleton blocks in the noncrossing set partition corresponding to a Dyck path, that can be merged to create another noncrossing set partition. St001955The number of natural descents for set-valued two row standard Young tableaux. St001961The sum of the greatest common divisors of all pairs of parts. St000010The length of the partition. St000011The number of touch points (or returns) of a Dyck path. St000013The height of a Dyck path. St000014The number of parking functions supported by a Dyck path. St000015The number of peaks of a Dyck path. St000025The number of initial rises of a Dyck path. St000026The position of the first return of a Dyck path. St000032The number of elements smaller than the given Dyck path in the Tamari Order. St000038The product of the heights of the descending steps of a Dyck path. St000048The multinomial of the parts of a partition. St000144The pyramid weight of the Dyck path. St000160The multiplicity of the smallest part of a partition. St000293The number of inversions of a binary word. St000327The number of cover relations in a poset. St000335The difference of lower and upper interactions. St000346The number of coarsenings of a partition. St000381The largest part of an integer composition. St000382The first part of an integer composition. St000383The last part of an integer composition. St000395The sum of the heights of the peaks of a Dyck path. St000418The number of Dyck paths that are weakly below a Dyck path. St000419The number of Dyck paths that are weakly above the Dyck path, except for the path itself. St000443The number of long tunnels of a Dyck path. St000444The length of the maximal rise of a Dyck path. St000445The number of rises of length 1 of a Dyck path. 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. St000507The number of ascents of a standard tableau. St000519The largest length of a factor maximising the subword complexity. St000548The number of different non-empty partial sums of an integer partition. St000617The number of global maxima of a Dyck path. St000631The number of distinct palindromic decompositions of a binary word. St000657The smallest part of an integer composition. St000676The number of odd rises of a Dyck path. 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. St000734The last entry in the first row of a standard tableau. St000757The length of the longest weakly inreasing subsequence of parts of an integer composition. St000765The number of weak records in an integer composition. St000808The number of up steps of the associated bargraph. 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. St000867The sum of the hook lengths in the first row of 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. St000922The minimal number such that all substrings of this length are unique. St000930The k-Gorenstein degree of the corresponding Nakayama algebra with linear quiver. St000947The major index east count of a Dyck path. St000952Gives the number of irreducible factors of the Coxeter polynomial of the Dyck path over the rational numbers. St000955Number of times one has $Ext^i(D(A),A)>0$ for $i>0$ for the corresponding LNakayama algebra. St000982The length of the longest constant subword. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001014Number of indecomposable injective modules with codominant dimension equal to the dominant dimension of the Nakayama algebra corresponding to the Dyck path. 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. St001018Sum of projective dimension of the indecomposable injective modules of 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. St001024Maximum of dominant dimensions of the simple modules in the Nakayama algebra corresponding to the Dyck path. St001034The area of the parallelogram polyomino associated with the Dyck path. St001068Number of torsionless simple modules in the corresponding Nakayama algebra. St001088Number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001102The number of words with multiplicities of the letters given by the composition, avoiding the consecutive pattern 132. St001103The number of words with multiplicities of the letters given by the partition, avoiding the consecutive pattern 123. 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. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. 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. St001183The maximum of $projdim(S)+injdim(S)$ over all simple modules in the Nakayama algebra corresponding to the Dyck path. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001202Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001203We associate to a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n-1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a Dyck path as follows: St001210Gives the maximal vector space dimension of the first Ext-group between an indecomposable module X and the regular module A, when A is the Nakayama algebra corresponding to the Dyck path. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. 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. St001235The global dimension of the corresponding Comp-Nakayama algebra. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001239The largest vector space dimension of the double dual of a simple module in the corresponding Nakayama algebra. St001241The number of non-zero radicals of the indecomposable projective modules that have injective dimension and projective dimension at most one. St001242The toal dimension of certain Sn modules determined by LLT polynomials associated with a Dyck path. St001243The sum of coefficients in the Schur basis of certain LLT polynomials associated with a Dyck path. 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. St001257The dominant dimension of the double dual of A/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. 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. St001299The product of all non-zero projective dimensions of simple modules of the corresponding Nakayama algebra. St001312Number of parabolic noncrossing partitions indexed by the composition. St001348The bounce of the parallelogram polyomino associated with the Dyck path. St001387Number of standard Young tableaux of the skew shape tracing the border of the given partition. St001416The length of a longest palindromic factor of a binary word. St001417The length of a longest palindromic subword of a binary word. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001462The number of factors of a standard tableaux under concatenation. St001471The magnitude of a Dyck path. St001486The number of corners of the ribbon associated with an integer composition. St001488The number of corners of a skew partition. St001498The normalised height of a Nakayama algebra with magnitude 1. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001515The vector space dimension of the socle of the first syzygy module of the regular module (as a bimodule). St001523The degree of symmetry of a Dyck path. St001526The Loewy length of the Auslander-Reiten translate of the regular module as a bimodule of the Nakayama algebra corresponding to the Dyck path. St001530The depth of a Dyck path. St001531Number of partial orders contained in the poset determined by the Dyck path. St001614The cyclic permutation representation number of a skew partition. St001637The number of (upper) dissectors of a poset. St001660The number of ways to place as many non-attacking rooks as possible on a skew Ferrers board. St001668The number of points of the poset minus the width of the poset. St001675The number of parts equal to the part in the reversed composition. St001688The sum of the squares of the heights of the peaks of a Dyck path. St001733The number of weak left to right maxima of a Dyck path. St001785The number of ways to obtain a partition as the multiset of antidiagonal lengths of the Ferrers diagram of a partition. St001800The number of 3-Catalan paths having this Dyck path as first and last coordinate projections. St001809The index of the step at the first peak of maximal height in a Dyck path. St001816Eigenvalues of the top-to-random operator acting on a simple module. St001929The number of meanders with top half given by the noncrossing matching corresponding to the Dyck path. St001933The largest multiplicity of a part in an integer partition. St001959The product of the heights of the peaks of a Dyck path. St000393The number of strictly increasing runs in a binary word. St000420The number of Dyck paths that are weakly above a Dyck path. St000439The position of the first down step of a Dyck path. 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. St000656The number of cuts of a poset. St000680The Grundy value for Hackendot on posets. St000717The number of ordinal summands of a poset. St000906The length of the shortest maximal chain in a poset. St000949Gives the number of generalised tilting modules of the corresponding LNakayama algebra. St000968We make a CNakayama algebra out of the LNakayama algebra (corresponding to the Dyck path) $[c_0,c_1,...,c_{n−1}]$ by adding $c_0$ to $c_{n−1}$. 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}$. 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. St001028Number of simple modules with injective dimension equal to the dominant dimension in the Nakayama algebra corresponding to the Dyck path. St001065Number of indecomposable reflexive modules in the corresponding Nakayama algebra. 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. 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. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St001237The number of simple modules with injective dimension at most one or dominant dimension at least one. St001240The number of indecomposable modules e_i J^2 that have injective dimension at most one in the corresponding Nakayama algebra St001267The length of the Lyndon factorization of the binary word. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St001437The flex of a binary word. 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. St001505The number of elements generated by the Dyck path as a map in the full transformation monoid. 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. St001808The box weight or horizontal decoration of a Dyck path. St000642The size of the smallest orbit of antichains under Panyushev complementation. St000643The size of the largest orbit of antichains under Panyushev complementation. St000967The value p(1) for the Coxeterpolynomial p of the corresponding LNakayama algebra. St001003The number of indecomposable modules with projective dimension at most 1 in 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. St001218Smallest index k greater than or equal to one such that the Coxeter matrix C of the corresponding Nakayama algebra has C^k=1. St001643The Frobenius dimension of the Nakayama algebra corresponding to the Dyck path. St001838The number of nonempty primitive factors of a binary word. St001213The number of indecomposable modules in the corresponding Nakayama algebra that have vanishing first Ext-group with the regular module. St000826The stopping time of the decimal representation of the binary word for the 3x+1 problem. St000100The number of linear extensions of a poset. St000282The size of the preimage of the map 'to poset' from Ordered trees to Posets. St000524The number of posets with the same order polynomial. St000525The number of posets with the same zeta polynomial. St000526The number of posets with combinatorially isomorphic order polytopes. St000633The size of the automorphism group of a poset. St000635The number of strictly order preserving maps of a poset into itself. St000640The rank of the largest boolean interval in a poset. St000910The number of maximal chains of minimal length in a poset. St000914The sum of the values of the Möbius function of a poset. St001105The number of greedy linear extensions of a poset. St001106The number of supergreedy linear extensions of a poset. St001632The number of indecomposable injective modules $I$ with $dim Ext^1(I,A)=1$ for the incidence algebra A of a poset. St001890The maximum magnitude of the Möbius function of a poset. St000281The size of the preimage of the map 'to poset' from Binary trees to Posets. 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. St001095The number of non-isomorphic posets with precisely one further covering relation. St000634The number of endomorphisms of a poset. St000639The number of relations in a poset. St000641The number of non-empty boolean intervals in a poset. St000284The Plancherel distribution on integer partitions. St000456The monochromatic index of a connected graph. St000509The diagonal index (content) of a partition. St000566The number of ways to select a row of a Ferrers shape and two cells in this row. St000621The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is even. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000706The product of the factorials of the multiplicities of an integer partition. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000927The alternating sum of the coefficients of the character polynomial of an integer partition. St000934The 2-degree of an integer partition. St000993The multiplicity of the largest part of an integer partition. St001118The acyclic chromatic index of a graph. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St001128The exponens consonantiae of a partition. St001281The normalized isoperimetric number of a graph. St001568The smallest positive integer that does not appear twice in the partition. St001592The maximal number of simple paths between any two different vertices of a graph. 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. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000379The number of Hamiltonian cycles in a graph. St000464The Schultz index of a connected graph. St000514The number of invariant simple graphs when acting with a permutation of given cycle type. St000515The number of invariant set partitions when acting with a permutation of given cycle type. St000567The sum of the products of all pairs of parts. St000699The toughness times the least common multiple of 1,. St000707The product of the factorials of the parts. St000929The constant term of the character polynomial of an integer partition. St000936The number of even values of the symmetric group character corresponding to the partition. St000938The number of zeros of the symmetric group character corresponding to the partition. St000940The number of characters of the symmetric group whose value on the partition is zero. St000941The number of characters of the symmetric group whose value on the partition is even. St000997The even-odd crank of an integer partition. St001097The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders. St001098The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for vertex labelled trees. St001099The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled binary trees. St001100The coefficient times the product of the factorials of the parts of the monomial symmetric function indexed by the partition in the formal group law for leaf labelled trees. 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. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001545The second Elser number of a connected graph. St001704The size of the largest multi-subset-intersection of the deck of a graph with the deck of another graph. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2. St000455The second largest eigenvalue of a graph if it is integral. St001875The number of simple modules with projective dimension at most 1. St000713The dimension of the irreducible representation of Sp(4) labelled by an integer partition. St000716The dimension of the irreducible representation of Sp(6) labelled by an integer partition. St000285The size of the preimage of the map 'to inverse des composition' from Parking functions to Integer compositions. St000675The number of centered multitunnels of a Dyck path. St000735The last entry on the main diagonal of a standard tableau. St000744The length of the path to the largest entry in a standard Young tableau. St000762The sum of the positions of the weak records of an integer composition. St000817The sum of the entries in the column specified by the composition of the change of basis matrix from dual immaculate quasisymmetric functions to monomial quasisymmetric functions. St000818The sum of the entries in the column specified by the composition of the change of basis matrix from quasisymmetric Schur functions to monomial quasisymmetric functions. St000932The number of occurrences of the pattern UDU in a Dyck path. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001204Call a CNakayama algebra (a Nakayama algebra with a cyclic quiver) with Kupisch series $L=[c_0,c_1,...,c_{n−1}]$ such that $n=c_0 < c_i$ for all $i > 0$ a special CNakayama algebra. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St000369The dinv deficit of a Dyck path. St000376The bounce deficit of a Dyck path. St000661The number of rises of length 3 of a Dyck path. St000674The number of hills of a Dyck path. St000678The number of up steps after the last double rise of a Dyck path. St000693The modular (standard) major index of a standard tableau. St000790The number of pairs of centered tunnels, one strictly containing the other, of a Dyck path. St000931The number of occurrences of the pattern UUU in a Dyck path. St000946The sum of the skew hook positions in a Dyck path. St000977MacMahon's equal index of a Dyck path. St000978The sum of the positions of double down-steps of a Dyck path. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St001032The number of horizontal steps in the bicoloured Motzkin path 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. 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. St001141The number of occurrences of hills of size 3 in a Dyck path. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. 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$. 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$. 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$. St001500The global dimension of magnitude 1 Nakayama algebras. St001501The dominant dimension of magnitude 1 Nakayama algebras. 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. St000438The position of the last up step in a Dyck path. St000806The semiperimeter of the associated bargraph. St001880The number of 2-Gorenstein indecomposable injective modules in the incidence algebra of the lattice. St000508Eigenvalues of the random-to-random operator acting on a simple module. St000981The length of the longest zigzag subpath. St000173The segment statistic of a semistandard tableau. St000112The sum of the entries reduced by the index of their row in a semistandard tableau. St000302The determinant of the distance matrix of a connected graph. St000467The hyper-Wiener index of a connected 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.