Your data matches 581 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Mp00199: Dyck paths prime Dyck pathDyck paths
St001137: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> 0
[1,0,1,0]
=> [1,1,0,1,0,0]
=> 0
[1,1,0,0]
=> [1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 0
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 0
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 0
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 0
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 0
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 0
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 0
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 0
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 0
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 0
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> 0
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> 0
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> 0
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> 0
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> 0
[1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> 0
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,1,0,0,1,0,0]
=> 0
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,1,0,0,0]
=> 0
[1,0,1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,1,1,0,0,1,0,0,0]
=> 0
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,1,0,0,0,1,1,0,0,0]
=> 0
[1,0,1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,1,1,0,0,0,0]
=> 0
[1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,1,0,0,1,0,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,1,1,0,0,0]
=> 0
[1,1,0,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,1,0,1,1,0,0,0,0]
=> 0
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,1,0,0]
=> 0
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,1,0,0,1,0,0]
=> 0
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [1,1,1,0,1,1,0,0,1,0,0,1,0,0]
=> 0
[1,1,0,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> 0
[1,1,1,0,0,1,0,0,1,1,0,0]
=> [1,1,1,1,0,0,1,0,0,1,1,0,0,0]
=> 0
[1,1,1,0,0,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,1,1,0,0,0,1,0,0]
=> 0
[]
=> [1,0]
=> 0
Description
Number of simple modules that are 3-regular in the corresponding Nakayama algebra.
Mp00199: Dyck paths prime Dyck pathDyck paths
St001932: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> 0
[1,0,1,0]
=> [1,1,0,1,0,0]
=> 0
[1,1,0,0]
=> [1,1,1,0,0,0]
=> 0
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 0
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 0
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> 0
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 0
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> 0
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 0
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 0
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> 0
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> 0
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 0
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> 0
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> 0
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> 0
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> 0
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> 0
[1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> 0
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,1,0,0,1,0,0]
=> 0
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,1,0,0,0]
=> 0
[1,0,1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,1,1,0,0,1,0,0,0]
=> 0
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,1,0,0,0,1,1,0,0,0]
=> 0
[1,0,1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,1,1,0,0,0,0]
=> 0
[1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,1,0,0,1,0,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,1,1,0,0,0]
=> 0
[1,1,0,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,1,0,1,1,0,0,0,0]
=> 0
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,1,0,0]
=> 0
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,1,0,0,1,0,0]
=> 0
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [1,1,1,0,1,1,0,0,1,0,0,1,0,0]
=> 0
[1,1,0,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> 0
[1,1,1,0,0,1,0,0,1,1,0,0]
=> [1,1,1,1,0,0,1,0,0,1,1,0,0,0]
=> 0
[1,1,1,0,0,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,1,1,0,0,0,1,0,0]
=> 0
[]
=> [1,0]
=> 0
Description
The 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. Let $D$ be a Dyck path, and let $P$ be the noncrossing set partition obtained by applying [[Mp00138]]. For each pair of singleton blocks $\{a\}, \{b\}$, let $P'$ be the set partition obtained from $P$ by merging the two blocks. This statistic enumerates the number of (unordered) pairs of singleton blocks such that $P'$ is noncrossing.
Mp00129: Dyck paths to 321-avoiding permutation (Billey-Jockusch-Stanley)Permutations
Mp00086: Permutations first fundamental transformationPermutations
St000366: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => 0
[1,0,1,0]
=> [2,1] => [2,1] => 0
[1,1,0,0]
=> [1,2] => [1,2] => 0
[1,0,1,0,1,0]
=> [2,3,1] => [3,2,1] => 1
[1,0,1,1,0,0]
=> [2,1,3] => [2,1,3] => 0
[1,1,0,0,1,0]
=> [1,3,2] => [1,3,2] => 0
[1,1,0,1,0,0]
=> [3,1,2] => [2,3,1] => 0
[1,1,1,0,0,0]
=> [1,2,3] => [1,2,3] => 0
[1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [2,1,4,3] => 0
[1,0,1,1,0,1,0,0]
=> [2,4,1,3] => [3,2,4,1] => 0
[1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [2,1,3,4] => 0
[1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [1,3,2,4] => 0
[1,1,0,1,0,0,1,0]
=> [3,1,4,2] => [3,4,1,2] => 0
[1,1,0,1,1,0,0,0]
=> [3,1,2,4] => [2,3,1,4] => 0
[1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [1,2,4,3] => 0
[1,1,1,0,0,1,0,0]
=> [1,4,2,3] => [1,3,4,2] => 0
[1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [2,1,4,3,5] => 0
[1,0,1,1,0,1,0,0,1,0]
=> [2,4,1,5,3] => [4,2,5,1,3] => 0
[1,0,1,1,0,1,1,0,0,0]
=> [2,4,1,3,5] => [3,2,4,1,5] => 0
[1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [2,1,3,5,4] => 0
[1,0,1,1,1,0,0,1,0,0]
=> [2,1,5,3,4] => [2,1,4,5,3] => 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [1,3,2,5,4] => 0
[1,1,0,0,1,1,0,1,0,0]
=> [1,3,5,2,4] => [1,4,3,5,2] => 0
[1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [1,3,2,4,5] => 0
[1,1,0,1,0,0,1,1,0,0]
=> [3,1,4,2,5] => [3,4,1,2,5] => 0
[1,1,0,1,1,0,0,0,1,0]
=> [3,1,2,5,4] => [2,3,1,5,4] => 0
[1,1,0,1,1,0,0,1,0,0]
=> [3,1,5,2,4] => [3,4,1,5,2] => 0
[1,1,1,0,0,0,1,1,0,0]
=> [1,2,4,3,5] => [1,2,4,3,5] => 0
[1,1,1,0,0,1,0,0,1,0]
=> [1,4,2,5,3] => [1,4,5,2,3] => 0
[1,1,1,0,0,1,1,0,0,0]
=> [1,4,2,3,5] => [1,3,4,2,5] => 0
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,6,5] => [2,1,4,3,6,5] => 0
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [2,1,4,6,3,5] => [2,1,5,4,6,3] => 0
[1,0,1,1,0,1,1,0,0,1,0,0]
=> [2,4,1,6,3,5] => [4,2,5,1,6,3] => 0
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [2,1,3,5,4,6] => [2,1,3,5,4,6] => 0
[1,0,1,1,1,0,0,1,1,0,0,0]
=> [2,1,5,3,4,6] => [2,1,4,5,3,6] => 0
[1,0,1,1,1,0,1,0,0,1,0,0]
=> [2,5,1,6,3,4] => [5,2,4,6,1,3] => 0
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4,6] => [1,3,2,5,4,6] => 0
[1,1,0,0,1,1,0,1,1,0,0,0]
=> [1,3,5,2,4,6] => [1,4,3,5,2,6] => 0
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,3,2,4,6,5] => [1,3,2,4,6,5] => 0
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [3,1,4,2,6,5] => [3,4,1,2,6,5] => 0
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [3,1,5,2,6,4] => [3,5,1,6,2,4] => 0
[1,1,0,1,1,0,1,0,0,0,1,0]
=> [3,5,1,2,6,4] => [2,5,3,6,1,4] => 0
[1,1,1,0,0,1,0,0,1,1,0,0]
=> [1,4,2,5,3,6] => [1,4,5,2,3,6] => 0
[1,1,1,0,0,1,1,0,0,0,1,0]
=> [1,4,2,3,6,5] => [1,3,4,2,6,5] => 0
[]
=> [] => [] => 0
Description
The number of double descents of a permutation. A double descent of a permutation $\pi$ is a position $i$ such that $\pi(i) > \pi(i+1) > \pi(i+2)$.
Mp00296: Dyck paths Knuth-KrattenthalerDyck paths
Mp00132: Dyck paths switch returns and last double riseDyck paths
St000660: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,0]
=> 0
[1,0,1,0]
=> [1,1,0,0]
=> [1,1,0,0]
=> 0
[1,1,0,0]
=> [1,0,1,0]
=> [1,0,1,0]
=> 0
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> 1
[1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> 0
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> 0
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> 0
[1,1,1,0,0,0]
=> [1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> 0
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> 0
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,0,0]
=> 0
[1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> 0
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0]
=> 0
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 0
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0]
=> 0
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> 0
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 0
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 0
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 0
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 0
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 0
[1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 0
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 0
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,1,0,0]
=> 0
[1,0,1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,1,1,0,0,0]
=> 0
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> 0
[1,0,1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> 0
[1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,1,1,0,0,0]
=> 0
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> 0
[1,1,0,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0,1,0]
=> 0
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 0
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 0
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 0
[1,1,0,1,1,0,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,0,1,0,0,0]
=> 0
[1,1,1,0,0,1,0,0,1,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> 0
[1,1,1,0,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 0
[]
=> []
=> []
=> 0
Description
The number of rises of length at least 3 of a Dyck path. The number of Dyck paths without such rises are counted by the Motzkin numbers [1].
Mp00296: Dyck paths Knuth-KrattenthalerDyck paths
Mp00025: Dyck paths to 132-avoiding permutationPermutations
St001087: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1] => 0
[1,0,1,0]
=> [1,1,0,0]
=> [1,2] => 0
[1,1,0,0]
=> [1,0,1,0]
=> [2,1] => 0
[1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [1,2,3] => 1
[1,0,1,1,0,0]
=> [1,1,0,1,0,0]
=> [2,1,3] => 0
[1,1,0,0,1,0]
=> [1,0,1,0,1,0]
=> [3,2,1] => 0
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [2,3,1] => 0
[1,1,1,0,0,0]
=> [1,1,0,0,1,0]
=> [3,1,2] => 0
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [3,2,1,4] => 0
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [2,3,1,4] => 0
[1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [3,1,2,4] => 0
[1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 0
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> [3,2,4,1] => 0
[1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0]
=> [3,4,2,1] => 0
[1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,0,1,0]
=> [4,2,1,3] => 0
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [4,3,1,2] => 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> [4,3,2,1,5] => 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [3,2,4,1,5] => 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> [3,4,2,1,5] => 0
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [4,2,1,3,5] => 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [4,3,1,2,5] => 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 0
[1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => 0
[1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => 0
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> [4,3,2,5,1] => 0
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => 0
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> [4,3,5,2,1] => 0
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [5,3,2,1,4] => 0
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => 0
[1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [5,4,2,1,3] => 0
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [5,4,3,2,1,6] => 0
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> [5,3,4,2,1,6] => 0
[1,0,1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,0,1,1,0,1,0,0,0]
=> [4,3,5,2,1,6] => 0
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,1,0,1,0,0,1,0,0]
=> [5,3,2,1,4,6] => 0
[1,0,1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [5,4,2,1,3,6] => 0
[1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [4,3,5,1,2,6] => 0
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,2,1] => 0
[1,1,0,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> [6,4,5,3,2,1] => 0
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,4,1] => 0
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [5,4,3,2,6,1] => 0
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [5,4,3,6,2,1] => 0
[1,1,0,1,1,0,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,1,1,0,0,0]
=> [4,5,3,6,2,1] => 0
[1,1,1,0,0,1,0,0,1,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,1,2] => 0
[1,1,1,0,0,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> [6,5,3,2,1,4] => 0
[]
=> []
=> [] => 0
Description
The number of occurrences of the vincular pattern |12-3 in a permutation. This is the number of occurrences of the pattern $123$, where the first matched entry is the first entry of the permutation and the other two matched entries are consecutive. In other words, this is the number of ascents whose bottom value is strictly larger than the first entry of the permutation.
Mp00099: Dyck paths bounce pathDyck paths
Mp00199: Dyck paths prime Dyck pathDyck paths
St000685: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1,1,0,0]
=> 1 = 0 + 1
[1,0,1,0]
=> [1,0,1,0]
=> [1,1,0,1,0,0]
=> 1 = 0 + 1
[1,1,0,0]
=> [1,1,0,0]
=> [1,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 2 = 1 + 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,1,1,0,0,1,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,1,1,0,0,1,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,1,0,0,1,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,0,1,1,0,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,1,0,0,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,1,1,0,0,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,1,0,0,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,1,1,1,0,0,0,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,1,0,0]
=> 1 = 0 + 1
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,1,0,0,1,0,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,1,0,0,1,0,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,1,0,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,1,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,1,1,0,0,0]
=> 1 = 0 + 1
[1,1,1,0,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,1,0,0]
=> 1 = 0 + 1
[]
=> []
=> [1,0]
=> 1 = 0 + 1
Description
The dominant dimension of the LNakayama algebra associated to a Dyck path. To every Dyck path there is an LNakayama algebra associated as described in [[St000684]].
Mp00199: Dyck paths prime Dyck pathDyck paths
Mp00143: Dyck paths inverse promotionDyck paths
St001063: Dyck paths ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1 = 0 + 1
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> 1 = 0 + 1
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,0,0,1,0]
=> 1 = 0 + 1
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> 2 = 1 + 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1 = 0 + 1
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1 = 0 + 1
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1 = 0 + 1
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 1 = 0 + 1
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,0,1,1,0,0,0,1,0]
=> 1 = 0 + 1
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> 1 = 0 + 1
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,0,1,1,0,0,0,1,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0,1,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,0,1,0,0,1,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0,1,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,0,0,1,1,0,1,0,0,1,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> 1 = 0 + 1
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,0,1,1,0,0,0,1,0,1,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,0,1,1,0,0,1,0,0,1,0]
=> 1 = 0 + 1
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [1,1,1,0,0,0,1,1,0,0,1,0]
=> 1 = 0 + 1
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> 1 = 0 + 1
[1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> [1,1,1,0,0,1,1,0,0,0,1,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> 1 = 0 + 1
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,0,0,1,1,0,1,0,0,1,0]
=> 1 = 0 + 1
[1,0,1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,1,1,0,0,1,0,0,0]
=> [1,0,1,1,0,1,1,0,0,1,0,0,1,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,1,0,0,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0,1,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,1,1,0,0,0,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0,1,0]
=> 1 = 0 + 1
[1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,1,0,0,1,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0,1,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,1,0,1,1,0,0,0,0]
=> [1,1,0,0,1,1,0,1,1,0,0,0,1,0]
=> 1 = 0 + 1
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,1,0,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0,1,0]
=> 1 = 0 + 1
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,1,0,0,1,0,1,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [1,1,1,0,1,1,0,0,1,0,0,1,0,0]
=> [1,1,0,1,1,0,0,1,0,0,1,0,1,0]
=> 1 = 0 + 1
[1,1,0,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0,1,0,1,0]
=> 1 = 0 + 1
[1,1,1,0,0,1,0,0,1,1,0,0]
=> [1,1,1,1,0,0,1,0,0,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0,1,1,0,0,1,0]
=> 1 = 0 + 1
[1,1,1,0,0,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0,1,0,1,0]
=> 1 = 0 + 1
[]
=> [1,0]
=> [1,0]
=> 1 = 0 + 1
Description
Numbers of 3-torsionfree simple modules in the corresponding Nakayama algebra.
Mp00025: Dyck paths to 132-avoiding permutationPermutations
Mp00149: Permutations Lehmer code rotationPermutations
Mp00062: Permutations Lehmer-code to major-code bijectionPermutations
St000002: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1] => [1] => [1] => 0
[1,0,1,0]
=> [2,1] => [1,2] => [1,2] => 0
[1,1,0,0]
=> [1,2] => [2,1] => [2,1] => 0
[1,0,1,0,1,0]
=> [3,2,1] => [1,2,3] => [1,2,3] => 1
[1,0,1,1,0,0]
=> [2,3,1] => [3,1,2] => [2,3,1] => 0
[1,1,0,0,1,0]
=> [3,1,2] => [1,3,2] => [3,1,2] => 0
[1,1,0,1,0,0]
=> [2,1,3] => [3,2,1] => [3,2,1] => 0
[1,1,1,0,0,0]
=> [1,2,3] => [2,3,1] => [1,3,2] => 0
[1,0,1,1,0,0,1,0]
=> [4,2,3,1] => [1,4,2,3] => [3,4,1,2] => 0
[1,0,1,1,0,1,0,0]
=> [3,2,4,1] => [4,3,1,2] => [3,4,2,1] => 0
[1,0,1,1,1,0,0,0]
=> [2,3,4,1] => [3,4,1,2] => [3,1,4,2] => 0
[1,1,0,0,1,1,0,0]
=> [3,4,1,2] => [4,1,3,2] => [4,2,3,1] => 0
[1,1,0,1,0,0,1,0]
=> [4,2,1,3] => [1,4,3,2] => [4,3,1,2] => 0
[1,1,0,1,1,0,0,0]
=> [2,3,1,4] => [3,4,2,1] => [1,4,3,2] => 0
[1,1,1,0,0,0,1,0]
=> [4,1,2,3] => [1,3,4,2] => [2,4,1,3] => 0
[1,1,1,0,0,1,0,0]
=> [3,1,2,4] => [4,2,3,1] => [2,4,3,1] => 0
[1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => [5,1,4,2,3] => [4,5,2,3,1] => 0
[1,0,1,1,0,1,0,0,1,0]
=> [5,3,2,4,1] => [1,5,4,2,3] => [4,5,3,1,2] => 0
[1,0,1,1,0,1,1,0,0,0]
=> [3,4,2,5,1] => [4,5,3,1,2] => [4,1,5,3,2] => 0
[1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => [1,4,5,2,3] => [4,2,5,1,3] => 0
[1,0,1,1,1,0,0,1,0,0]
=> [4,2,3,5,1] => [5,3,4,1,2] => [4,2,5,3,1] => 0
[1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => [1,5,2,4,3] => [5,3,4,1,2] => 0
[1,1,0,0,1,1,0,1,0,0]
=> [4,3,5,1,2] => [5,4,1,3,2] => [5,3,4,2,1] => 0
[1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => [4,5,1,3,2] => [5,3,1,4,2] => 0
[1,1,0,1,0,0,1,1,0,0]
=> [4,5,2,1,3] => [5,1,4,3,2] => [5,4,2,3,1] => 0
[1,1,0,1,1,0,0,0,1,0]
=> [5,2,3,1,4] => [1,4,5,3,2] => [2,5,4,1,3] => 0
[1,1,0,1,1,0,0,1,0,0]
=> [4,2,3,1,5] => [5,3,4,2,1] => [2,5,4,3,1] => 0
[1,1,1,0,0,0,1,1,0,0]
=> [4,5,1,2,3] => [5,1,3,4,2] => [3,5,2,4,1] => 0
[1,1,1,0,0,1,0,0,1,0]
=> [5,3,1,2,4] => [1,5,3,4,2] => [3,5,4,1,2] => 0
[1,1,1,0,0,1,1,0,0,0]
=> [3,4,1,2,5] => [4,5,2,3,1] => [3,1,5,4,2] => 0
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [6,4,5,2,3,1] => [1,6,2,5,3,4] => [5,6,3,4,1,2] => 0
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [5,4,6,2,3,1] => [6,5,1,4,2,3] => [5,6,3,4,2,1] => 0
[1,0,1,1,0,1,1,0,0,1,0,0]
=> [5,3,4,2,6,1] => [6,4,5,3,1,2] => [5,2,6,4,3,1] => 0
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [5,6,2,3,4,1] => [6,1,4,5,2,3] => [5,3,6,2,4,1] => 0
[1,0,1,1,1,0,0,1,1,0,0,0]
=> [4,5,2,3,6,1] => [5,6,3,4,1,2] => [5,3,1,6,4,2] => 0
[1,0,1,1,1,0,1,0,0,1,0,0]
=> [5,3,2,4,6,1] => [6,4,3,5,1,2] => [5,3,2,6,4,1] => 0
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [5,6,3,4,1,2] => [6,1,5,2,4,3] => [6,4,5,2,3,1] => 0
[1,1,0,0,1,1,0,1,1,0,0,0]
=> [4,5,3,6,1,2] => [5,6,4,1,3,2] => [6,4,1,5,3,2] => 0
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [6,3,4,5,1,2] => [1,5,6,2,4,3] => [6,4,2,5,1,3] => 0
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [6,4,5,2,1,3] => [1,6,2,5,4,3] => [6,5,3,4,1,2] => 0
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [6,4,2,3,1,5] => [1,6,4,5,3,2] => [3,6,5,4,1,2] => 0
[1,1,0,1,1,0,1,0,0,0,1,0]
=> [6,3,2,4,1,5] => [1,5,4,6,3,2] => [3,2,6,5,1,4] => 0
[1,1,1,0,0,1,0,0,1,1,0,0]
=> [5,6,3,1,2,4] => [6,1,5,3,4,2] => [4,6,5,2,3,1] => 0
[1,1,1,0,0,1,1,0,0,0,1,0]
=> [6,3,4,1,2,5] => [1,5,6,3,4,2] => [4,2,6,5,1,3] => 0
[]
=> [] => [] => [] => 0
Description
The number of occurrences of the pattern 123 in a permutation.
Matching statistic: St000121
Mp00199: Dyck paths prime Dyck pathDyck paths
Mp00228: Dyck paths reflect parallelogram polyominoDyck paths
Mp00034: Dyck paths to binary tree: up step, left tree, down step, right treeBinary trees
St000121: Binary trees ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,1,0,0]
=> [1,0,1,0]
=> [.,[.,.]]
=> 0
[1,0,1,0]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [.,[.,[.,.]]]
=> 0
[1,1,0,0]
=> [1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [[[.,.],.],.]
=> 0
[1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [.,[.,[.,[.,.]]]]
=> 1
[1,0,1,1,0,0]
=> [1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [.,[[[.,.],.],.]]
=> 0
[1,1,0,0,1,0]
=> [1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [[[.,.],.],[.,.]]
=> 0
[1,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [[[[.,.],.],.],.]
=> 0
[1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [[[.,[.,.]],.],.]
=> 0
[1,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [.,[[[.,.],.],[.,.]]]
=> 0
[1,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,1,0,0,0]
=> [1,0,1,1,1,1,0,0,0,0]
=> [.,[[[[.,.],.],.],.]]
=> 0
[1,0,1,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,0,0,0]
=> [.,[[[.,[.,.]],.],.]]
=> 0
[1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,0,0,1,1,0,0,0]
=> [[[.,.],[[.,.],.]],.]
=> 0
[1,1,0,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [[[[.,.],.],.],[.,.]]
=> 0
[1,1,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [[[[.,.],[.,.]],.],.]
=> 0
[1,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [[[.,[.,.]],.],[.,.]]
=> 0
[1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,0]
=> [[[.,[[.,.],.]],.],.]
=> 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0]
=> [.,[[[.,.],[[.,.],.]],.]]
=> 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,1,0,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,1,0,0,0,0,1,0]
=> [.,[[[[.,.],.],.],[.,.]]]
=> 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,1,0,1,1,0,1,1,0,0,0,0]
=> [1,0,1,1,1,1,0,0,1,0,0,0]
=> [.,[[[[.,.],[.,.]],.],.]]
=> 0
[1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,1,1,1,0,0,0,1,0,0]
=> [1,0,1,1,1,0,1,0,0,0,1,0]
=> [.,[[[.,[.,.]],.],[.,.]]]
=> 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,1,1,0,0,0,0]
=> [.,[[[.,[[.,.],.]],.],.]]
=> 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,0,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,1,0,0,0,1,0]
=> [[[.,.],[[.,.],.]],[.,.]]
=> 0
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [[[.,.],[[[.,.],.],.]],.]
=> 0
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0]
=> [[[.,.],[[.,[.,.]],.]],.]
=> 0
[1,1,0,1,0,0,1,1,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [[[[.,.],.],[[.,.],.]],.]
=> 0
[1,1,0,1,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> [[[[.,.],[.,.]],.],[.,.]]
=> 0
[1,1,0,1,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> [[[[.,.],[[.,.],.]],.],.]
=> 0
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0]
=> [1,1,1,0,1,0,0,1,1,0,0,0]
=> [[[.,[.,.]],[[.,.],.]],.]
=> 0
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,0,0,1,0]
=> [[[.,[[.,.],.]],.],[.,.]]
=> 0
[1,1,1,0,0,1,1,0,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0]
=> [[[.,[[.,.],[.,.]]],.],.]
=> 0
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,1,1,0,0,1,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,1,1,0,0,0,1,0]
=> [.,[[[.,.],[[.,.],.]],[.,.]]]
=> 0
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,1,1,0,0,1,1,0,1,0,0,0]
=> [1,0,1,1,1,0,0,1,1,1,0,0,0,0]
=> [.,[[[.,.],[[[.,.],.],.]],.]]
=> 0
[1,0,1,1,0,1,1,0,0,1,0,0]
=> [1,1,0,1,1,0,1,1,0,0,1,0,0,0]
=> [1,0,1,1,1,1,0,0,1,1,0,0,0,0]
=> [.,[[[[.,.],[[.,.],.]],.],.]]
=> 0
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,1,1,1,0,0,0,1,1,0,0,0]
=> [1,0,1,1,1,0,1,0,0,1,1,0,0,0]
=> [.,[[[.,[.,.]],[[.,.],.]],.]]
=> 0
[1,0,1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,1,1,1,0,0,1,1,0,0,0,0]
=> [1,0,1,1,1,0,1,1,0,0,1,0,0,0]
=> [.,[[[.,[[.,.],[.,.]]],.],.]]
=> 0
[1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,0,1,1,1,0,1,0,0,1,0,0,0]
=> [1,0,1,1,1,0,1,0,1,1,0,0,0,0]
=> [.,[[[.,[.,[[.,.],.]]],.],.]]
=> 0
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,1,0,0,1,1,0,0,1,1,0,0,0]
=> [1,1,1,0,0,1,1,0,0,1,1,0,0,0]
=> [[[.,.],[[.,.],[[.,.],.]]],.]
=> 0
[1,1,0,0,1,1,0,1,1,0,0,0]
=> [1,1,1,0,0,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,0,1,1,1,0,0,1,0,0,0]
=> [[[.,.],[[[.,.],[.,.]],.]],.]
=> 0
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,1,1,0,1,0,0,0,1,0]
=> [[[.,.],[[.,[.,.]],.]],[.,.]]
=> 0
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,1,1,0,1,0,0,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,0,1,1,0,0,0,1,0]
=> [[[[.,.],.],[[.,.],.]],[.,.]]
=> 0
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [1,1,1,0,1,1,0,0,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,1,0,0,0,0,1,0]
=> [[[[.,.],[[.,.],.]],.],[.,.]]
=> 0
[1,1,0,1,1,0,1,0,0,0,1,0]
=> [1,1,1,0,1,1,0,1,0,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,1,0,0,0,1,0]
=> [[[[.,.],[.,[.,.]]],.],[.,.]]
=> 0
[1,1,1,0,0,1,0,0,1,1,0,0]
=> [1,1,1,1,0,0,1,0,0,1,1,0,0,0]
=> [1,1,1,0,1,1,0,0,0,1,1,0,0,0]
=> [[[.,[[.,.],.]],[[.,.],.]],.]
=> 0
[1,1,1,0,0,1,1,0,0,0,1,0]
=> [1,1,1,1,0,0,1,1,0,0,0,1,0,0]
=> [1,1,1,0,1,1,0,0,1,0,0,0,1,0]
=> [[[.,[[.,.],[.,.]]],.],[.,.]]
=> 0
[]
=> [1,0]
=> [1,0]
=> [.,.]
=> 0
Description
The number of occurrences of the contiguous pattern {{{[.,[.,[.,[.,.]]]]}}} in a binary tree. [[oeis:A036765]] counts binary trees avoiding this pattern.
Mp00099: Dyck paths bounce pathDyck paths
Mp00129: Dyck paths to 321-avoiding permutation (Billey-Jockusch-Stanley)Permutations
Mp00149: Permutations Lehmer code rotationPermutations
St000217: Permutations ⟶ ℤResult quality: 100% values known / values provided: 100%distinct values known / distinct values provided: 100%
Values
[1,0]
=> [1,0]
=> [1] => [1] => 0
[1,0,1,0]
=> [1,0,1,0]
=> [2,1] => [1,2] => 0
[1,1,0,0]
=> [1,1,0,0]
=> [1,2] => [2,1] => 0
[1,0,1,0,1,0]
=> [1,0,1,0,1,0]
=> [2,3,1] => [3,1,2] => 1
[1,0,1,1,0,0]
=> [1,0,1,1,0,0]
=> [2,1,3] => [3,2,1] => 0
[1,1,0,0,1,0]
=> [1,1,0,0,1,0]
=> [1,3,2] => [2,1,3] => 0
[1,1,0,1,0,0]
=> [1,0,1,1,0,0]
=> [2,1,3] => [3,2,1] => 0
[1,1,1,0,0,0]
=> [1,1,1,0,0,0]
=> [1,2,3] => [2,3,1] => 0
[1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [3,2,1,4] => 0
[1,0,1,1,0,1,0,0]
=> [1,0,1,0,1,1,0,0]
=> [2,3,1,4] => [3,4,2,1] => 0
[1,0,1,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [3,2,4,1] => 0
[1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [2,4,3,1] => 0
[1,1,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,0]
=> [2,1,4,3] => [3,2,1,4] => 0
[1,1,0,1,1,0,0,0]
=> [1,0,1,1,1,0,0,0]
=> [2,1,3,4] => [3,2,4,1] => 0
[1,1,1,0,0,0,1,0]
=> [1,1,1,0,0,0,1,0]
=> [1,2,4,3] => [2,3,1,4] => 0
[1,1,1,0,0,1,0,0]
=> [1,1,0,0,1,1,0,0]
=> [1,3,2,4] => [2,4,3,1] => 0
[1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [3,2,5,4,1] => 0
[1,0,1,1,0,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => [3,4,2,1,5] => 0
[1,0,1,1,0,1,1,0,0,0]
=> [1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => [3,4,2,5,1] => 0
[1,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [3,2,4,1,5] => 0
[1,0,1,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [3,2,5,4,1] => 0
[1,1,0,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [2,4,3,1,5] => 0
[1,1,0,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => [2,4,5,3,1] => 0
[1,1,0,0,1,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [2,4,3,5,1] => 0
[1,1,0,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [3,2,5,4,1] => 0
[1,1,0,1,1,0,0,0,1,0]
=> [1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => [3,2,4,1,5] => 0
[1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => [3,2,5,4,1] => 0
[1,1,1,0,0,0,1,1,0,0]
=> [1,1,1,0,0,0,1,1,0,0]
=> [1,2,4,3,5] => [2,3,5,4,1] => 0
[1,1,1,0,0,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => [2,4,3,1,5] => 0
[1,1,1,0,0,1,1,0,0,0]
=> [1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => [2,4,3,5,1] => 0
[1,0,1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,6,5] => [3,2,5,4,1,6] => 0
[1,0,1,1,0,0,1,1,0,1,0,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> [2,1,4,5,3,6] => [3,2,5,6,4,1] => 0
[1,0,1,1,0,1,1,0,0,1,0,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> [2,3,1,5,4,6] => [3,4,2,6,5,1] => 0
[1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> [2,1,3,5,4,6] => [3,2,4,6,5,1] => 0
[1,0,1,1,1,0,0,1,1,0,0,0]
=> [1,0,1,1,0,0,1,1,1,0,0,0]
=> [2,1,4,3,5,6] => [3,2,5,4,6,1] => 0
[1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,0,1,1,1,0,0,0,1,1,0,0]
=> [2,1,3,5,4,6] => [3,2,4,6,5,1] => 0
[1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4,6] => [2,4,3,6,5,1] => 0
[1,1,0,0,1,1,0,1,1,0,0,0]
=> [1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,3,4,2,5,6] => [2,4,5,3,6,1] => 0
[1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,3,2,4,6,5] => [2,4,3,5,1,6] => 0
[1,1,0,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,6,5] => [3,2,5,4,1,6] => 0
[1,1,0,1,1,0,0,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> [2,1,4,3,6,5] => [3,2,5,4,1,6] => 0
[1,1,0,1,1,0,1,0,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,3,2,4,6,5] => [2,4,3,5,1,6] => 0
[1,1,1,0,0,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4,6] => [2,4,3,6,5,1] => 0
[1,1,1,0,0,1,1,0,0,0,1,0]
=> [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,3,2,4,6,5] => [2,4,3,5,1,6] => 0
[]
=> []
=> [] => [] => 0
Description
The number of occurrences of the pattern 312 in a permutation.
The following 571 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000218The number of occurrences of the pattern 213 in a permutation. St000220The number of occurrences of the pattern 132 in a permutation. St000356The number of occurrences of the pattern 13-2. St000359The number of occurrences of the pattern 23-1. St000648The number of 2-excedences of a permutation. St000731The number of double exceedences of a permutation. St001022Number of simple modules with projective dimension 3 in the Nakayama algebra corresponding to the Dyck path. St001025Number of simple modules with projective dimension 4 in the Nakayama algebra corresponding to the Dyck path. St001083The number of boxed occurrences of 132 in a permutation. St001084The number of occurrences of the vincular pattern |1-23 in a permutation. St001085The number of occurrences of the vincular pattern |21-3 in a permutation. St001086The number of occurrences of the consecutive pattern 132 in a permutation. St001141The number of occurrences of hills of size 3 in a Dyck path. St001167The number of simple modules that appear as the top of an indecomposable non-projective modules that is reflexive in the corresponding Nakayama algebra. St001253The number of non-projective indecomposable reflexive modules in the corresponding Nakayama algebra. St001525The number of symmetric hooks on the diagonal of a partition. St001803The maximal overlap of the cylindrical tableau associated with a tableau. St001846The number of elements which do not have a complement in the lattice. St000078The number of alternating sign matrices whose left key is the permutation. St000655The length of the minimal rise of a Dyck path. St000773The multiplicity of the largest Laplacian eigenvalue in a graph. St001064Number of simple modules in the corresponding Nakayama algebra that are 3-syzygy modules. St001066The number of simple reflexive modules in the corresponding Nakayama algebra. St001196The global dimension of $A$ minus the global dimension of $eAe$ for the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001800The number of 3-Catalan paths having this Dyck path as first and last coordinate projections. St001181Number of indecomposable injective modules with grade at least 3 in the corresponding Nakayama algebra. St000365The number of double ascents of a permutation. St001113Number of indecomposable projective non-injective modules with reflexive Auslander-Reiten sequences in the corresponding Nakayama algebra. St001163The number of simple modules with dominant dimension at least three in the corresponding Nakayama algebra. St001186Number of simple modules with grade at least 3 in the corresponding Nakayama algebra. St001219Number of simple modules S in the corresponding Nakayama algebra such that the Auslander-Reiten sequence ending at S has the property that all modules in the exact sequence are reflexive. St001231The number of simple modules that are non-projective and non-injective with the property that they have projective dimension equal to one and that also the Auslander-Reiten translates of the module and the inverse Auslander-Reiten translate of the module have the same projective dimension. St001234The number of indecomposable three dimensional modules with projective dimension one. St001264The smallest index i such that the i-th simple module has projective dimension equal to the global dimension of the corresponding Nakayama algebra. St001663The number of occurrences of the Hertzsprung pattern 132 in a permutation. St001728The number of invisible descents of a permutation. St001797The number of overfull subgraphs of a graph. 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. St000118The number of occurrences of the contiguous pattern [.,[.,[.,.]]] in a binary tree. St000303The determinant of the product of the incidence matrix and its transpose of a graph divided by $4$. St000317The cycle descent number of a permutation. St000355The number of occurrences of the pattern 21-3. St000357The number of occurrences of the pattern 12-3. St000358The number of occurrences of the pattern 31-2. St000367The number of simsun double descents of a permutation. St000372The number of mid points of increasing subsequences of length 3 in a permutation. St000423The number of occurrences of the pattern 123 or of the pattern 132 in a permutation. St000428The number of occurrences of the pattern 123 or of the pattern 213 in a permutation. St000478Another weight of a partition according to Alladi. St000546The number of global descents of a permutation. St000674The number of hills of a Dyck path. St000752The Grundy value for the game 'Couples are forever' on an integer partition. St000790The number of pairs of centered tunnels, one strictly containing the other, of a Dyck path. St000877The depth of the binary word interpreted as a path. St001033The normalized area of the parallelogram polyomino associated with the 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. St001172The number of 1-rises at odd height of a Dyck path. St001221The number of simple modules in the corresponding LNakayama algebra that have 2 dimensional second Extension group with the regular module. St001266The largest vector space dimension of an indecomposable non-projective module that is reflexive in the corresponding Nakayama algebra. St001423The number of distinct cubes in a binary word. St001682The number of distinct positions of the pattern letter 1 in occurrences of 123 in a permutation. St001683The number of distinct positions of the pattern letter 3 in occurrences of 132 in a permutation. St001685The number of distinct positions of the pattern letter 1 in occurrences of 132 in a permutation. St001687The number of distinct positions of the pattern letter 2 in occurrences of 213 in a permutation. St001730The number of times the path corresponding to a binary word crosses the base line. St001744The number of occurrences of the arrow pattern 1-2 with an arrow from 1 to 2 in a permutation. St001745The number of occurrences of the arrow pattern 13 with an arrow from 1 to 2 in a permutation. St001781The interlacing number of a set partition. St001810The number of fixed points of a permutation smaller than its largest moved point. St000079The number of alternating sign matrices for a given Dyck path. St000255The number of reduced Kogan faces with the permutation as type. St000701The protection number of a binary tree. St000776The maximal multiplicity of an eigenvalue in a graph. St000920The logarithmic height of a Dyck path. St001075The minimal size of a block of a set partition. St001385The number of conjugacy classes of subgroups with connected subgroups of sizes prescribed by an integer partition. St001483The number of simple module modules that appear in the socle of the regular module but have no nontrivial selfextensions with the regular module. St001501The dominant dimension of magnitude 1 Nakayama algebras. St001503The largest distance of a vertex to a vertex in a cycle in the resolution quiver of the corresponding Nakayama algebra. St001732The number of peaks visible from the left. St001934The number of monotone factorisations of genus zero of a permutation of given cycle type. St001130The number of two successive successions in a permutation. St000832The number of permutations obtained by reversing blocks of three consecutive numbers. St000379The number of Hamiltonian cycles in a graph. St000661The number of rises of length 3 of a Dyck path. St000931The number of occurrences of the pattern UUU in a Dyck path. St000290The major index of a binary word. St000291The number of descents of a binary word. St000292The number of ascents of a binary word. St000293The number of inversions of a binary word. St000347The inversion sum of a binary word. St000348The non-inversion sum of a binary word. St000582The number of occurrences of the pattern {{1,3},{2}} such that 1 is minimal, 3 is maximal, (1,3) are consecutive in a block. St000594The number of occurrences of the pattern {{1,3},{2}} such that 1,2 are minimal, (1,3) are consecutive in a block. St000613The number of occurrences of the pattern {{1,3},{2}} such that 2 is minimal, 3 is maximal, (1,3) are consecutive in a block. St000682The Grundy value of Welter's game on a binary word. St000732The number of double deficiencies of a permutation. St000791The number of pairs of left tunnels, one strictly containing the other, of a Dyck path. St000799The number of occurrences of the vincular pattern |213 in a permutation. St000800The number of occurrences of the vincular pattern |231 in a permutation. St000801The number of occurrences of the vincular pattern |312 in a permutation. St000802The number of occurrences of the vincular pattern |321 in a permutation. St000803The number of occurrences of the vincular pattern |132 in a permutation. St000804The number of occurrences of the vincular pattern |123 in a permutation. St000875The semilength of the longest Dyck word in the Catalan factorisation of a binary word. St001082The number of boxed occurrences of 123 in a permutation. St001355Number of non-empty prefixes of a binary word that contain equally many 0's and 1's. St001421Half the length of a longest factor which is its own reverse-complement and begins with a one of a binary word. St001436The index of a given binary word in the lex-order among all its cyclic shifts. St001485The modular major index of a binary word. St001552The number of inversions between excedances and fixed points of a permutation. St000326The position of the first one in a binary word after appending a 1 at the end. St000392The length of the longest run of ones in a binary word. St000627The exponent of a binary word. St000657The smallest part of an integer composition. St001081The number of minimal length factorizations of a permutation into star transpositions. St001313The number of Dyck paths above the lattice path given by a binary word. St000699The toughness times the least common multiple of 1,. St001198The number of simple modules in the algebra $eAe$ with projective dimension at most 1 in the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001206The maximal dimension of an indecomposable projective $eAe$-module (that is the height of the corresponding Dyck path) of the corresponding Nakayama algebra with minimal faithful projective-injective module $eA$. St001498The normalised height of a Nakayama algebra with magnitude 1. St000175Degree of the polynomial counting the number of semistandard Young tableaux when stretching the shape. St000205Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight. St000206Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and integer composition weight. St000225Difference between largest and smallest parts in a partition. St000296The length of the symmetric border of a binary word. St000319The spin of an integer partition. St000320The dinv adjustment of an integer partition. St000506The number of standard desarrangement tableaux of shape equal to the given partition. St000598The number of occurrences of the pattern {{1},{2,3}} such that 1,2 are minimal, 3 is maximal, (2,3) are consecutive in a block. St000607The number of occurrences of the pattern {{1},{2,3}} such that 2 is minimal, 3 is maximal, (2,3) are consecutive in a block. St000629The defect of a binary word. St000749The smallest integer d such that the restriction of the representation corresponding to a partition of n to the symmetric group on n-d letters has a constituent of odd degree. St000944The 3-degree of an integer partition. St000980The number of boxes weakly below the path and above the diagonal that lie below at least two peaks. St001175The size of a partition minus the hook length of the base cell. St001176The size of a partition minus its first part. St001177Twice the mean value of the major index among all standard Young tableaux of a partition. St001178Twelve times the variance of the major index among all standard Young tableaux of a partition. St001193The dimension of $Ext_A^1(A/AeA,A)$ in the corresponding Nakayama algebra $A$ such that $eA$ is a minimal faithful projective-injective module. St001248Sum of the even parts of a partition. St001279The sum of the parts of an integer partition that are at least two. St001280The number of parts of an integer partition that are at least two. St001371The length of the longest Yamanouchi prefix of a binary word. St001392The largest nonnegative integer which is not a part and is smaller than the largest part of the partition. St001440The number of standard Young tableaux whose major index is congruent one modulo the size of a given integer partition. St001541The Gini index of an integer partition. St001586The number of odd parts smaller than the largest even part in an integer partition. St001587Half of the largest even part of an integer partition. St001657The number of twos in an integer partition. St001714The number of subpartitions of an integer partition that do not dominate the conjugate subpartition. St001918The degree of the cyclic sieving polynomial corresponding to an integer partition. St001961The sum of the greatest common divisors of all pairs of parts. 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. St000455The second largest eigenvalue of a graph if it is integral. St000456The monochromatic index of a connected graph. St000618The number of self-evacuating tableaux of given shape. St000667The greatest common divisor of the parts of the partition. St000729The minimal arc length of a set partition. St000755The number of real roots of the characteristic polynomial of a linear recurrence associated with an integer partition. St000781The number of proper colouring schemes of a Ferrers diagram. St000847The number of standard Young tableaux whose descent set is the binary word. St001006Number of simple modules with projective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001118The acyclic chromatic index of a graph. St001199The dominant dimension of $eAe$ for the corresponding Nakayama algebra $A$ with minimal faithful projective-injective module $eA$. St001236The dominant dimension of the corresponding Comp-Nakayama algebra. St001256Number of simple reflexive modules that are 2-stable reflexive. St001281The normalized isoperimetric number of a graph. St001283The number of finite solvable groups that are realised by the given partition over the complex numbers. St001284The number of finite groups that are realised by the given partition over the complex numbers. St001389The number of partitions of the same length below the given integer partition. St001432The order dimension of the partition. St001442The number of standard Young tableaux whose major index is divisible by the size of a given integer partition. St001562The value of the complete homogeneous symmetric function evaluated at 1. St001563The value of the power-sum symmetric function evaluated at 1. St001564The value of the forgotten symmetric functions when all variables set to 1. St001571The Cartan determinant of the integer partition. St001592The maximal number of simple paths between any two different vertices of a graph. St001593This is the number of standard Young tableaux of the given shifted shape. St001599The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on rooted trees. St001601The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on trees. St001609The number of coloured trees such that the multiplicities of colours are given by a partition. St001722The number of minimal chains with small intervals between a binary word and the top element. St001780The order of promotion on the set of standard tableaux of given shape. St001899The total number of irreducible representations contained in the higher Lie character for an integer partition. St001900The number of distinct irreducible representations contained in the higher Lie character for an integer partition. St001901The largest multiplicity of an irreducible representation contained in the higher Lie character for an integer partition. St001908The number of semistandard tableaux of distinct weight whose maximal entry is the length of the partition. St001913The number of preimages of an integer partition in Bulgarian solitaire. St001924The number of cells in an integer partition whose arm and leg length coincide. St001933The largest multiplicity of a part in an integer partition. St001936The number of transitive factorisations of a permutation of given cycle type into star transpositions. St000464The Schultz index of a connected graph. St001235The global dimension of the corresponding Comp-Nakayama algebra. 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. St000264The girth of a graph, which is not a tree. St000687The dimension of $Hom(I,P)$ for the LNakayama algebra of a Dyck path. St000772The multiplicity of the largest distance Laplacian eigenvalue in a connected graph. St000929The constant term of the character polynomial of an integer partition. St000993The multiplicity of the largest part of an integer partition. St001568The smallest positive integer that does not appear twice in the partition. St000842The breadth of a permutation. St000664The number of right ropes of a permutation. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St001912The length of the preperiod in Bulgarian solitaire corresponding to an integer partition. St000706The product of the factorials of the multiplicities of an integer partition. St000219The number of occurrences of the pattern 231 in a permutation. St000404The number of occurrences of the pattern 3241 or of the pattern 4231 in a permutation. St000406The number of occurrences of the pattern 3241 in a permutation. St000477The weight of a partition according to Alladi. St000509The diagonal index (content) of a partition. St000510The number of invariant oriented cycles when acting with a permutation of given cycle type. St000698The number of 2-rim hooks removed from an integer partition to obtain its associated 2-core. St000928The sum of the coefficients of the character polynomial of an integer partition. St000934The 2-degree of an integer partition. St001162The minimum jump of a permutation. St001292The injective dimension of the tensor product of two copies of the dual of the Nakayama algebra associated to a Dyck path. St001465The number of adjacent transpositions in the cycle decomposition of a permutation. St001549The number of restricted non-inversions between exceedances. St001695The natural comajor index of a standard Young tableau. St001698The comajor index of a standard tableau minus the weighted size of its shape. St001699The major index of a standard tableau minus the weighted size of its shape. St001712The number of natural descents of a standard Young tableau. St001906Half of the difference between the total displacement and the number of inversions and the reflection length of a permutation. St000441The number of successions of a permutation. St000665The number of rafts of a permutation. St001652The length of a longest interval of consecutive numbers. St001662The length of the longest factor of consecutive numbers in a permutation. St001060The distinguishing index of a graph. 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. 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. St001001The number of indecomposable modules with projective and injective dimension equal to the global dimension of the Nakayama algebra corresponding to the Dyck path. St001124The multiplicity of the standard representation in the Kronecker square corresponding to a partition. St001876The number of 2-regular simple modules in the incidence algebra of the lattice. St001877Number of indecomposable injective modules with projective dimension 2. St000284The Plancherel distribution on integer partitions. St000620The number of standard tableaux of shape equal to the given partition such that the minimal cyclic descent is odd. St000668The least common multiple of the parts of the partition. St000704The number of semistandard tableaux on a given integer partition with minimal maximal entry. St000707The product of the factorials of the parts. St000708The product of the parts of an integer partition. St000770The major index of an integer partition when read from bottom to top. St000771The largest multiplicity of a distance Laplacian eigenvalue in a connected graph. St000815The number of semistandard Young tableaux of partition weight of given shape. St000901The cube of the number of standard Young tableaux with shape given by the partition. St000933The number of multipartitions of sizes given by an integer partition. St001128The exponens consonantiae of a partition. St001364The number of permutations whose cube equals a fixed permutation of given cycle type. St001878The projective dimension of the simple modules corresponding to the minimum of L in the incidence algebra of the lattice L. St000716The dimension of the irreducible representation of Sp(6) labelled by an integer partition. St000210Minimum over maximum difference of elements in cycles. St000214The number of adjacencies of a permutation. St000697The number of 3-rim hooks removed from an integer partition to obtain its associated 3-core. St000966Number of peaks minus the global dimension of the corresponding LNakayama algebra. St001140Number of indecomposable modules with projective and injective dimension at least two in the corresponding Nakayama algebra. St001214The aft of an integer partition. St001435The number of missing boxes in the first row. St001438The number of missing boxes of a skew partition. St001588The number of distinct odd parts smaller than the largest even part in an integer partition. St001631The number of simple modules $S$ with $dim Ext^1(S,A)=1$ in the incidence algebra $A$ of the poset. St000003The number of standard Young tableaux of the partition. St000049The number of set partitions whose sorted block sizes correspond to the partition. St000182The number of permutations whose cycle type is the given integer partition. St000275Number of permutations whose sorted list of non zero multiplicities of the Lehmer code is the given partition. St000278The size of the preimage of the map 'to partition' from Integer compositions to Integer partitions. St000517The Kreweras number of an integer partition. St000628The balance of a binary word. St000913The number of ways to refine the partition into singletons. St001011Number of simple modules of projective dimension 2 in 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. St001159Number of simple modules with dominant dimension equal to the global dimension 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. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St001481The minimal height of a peak of a Dyck path. St001487The number of inner corners of a skew partition. St001490The number of connected components of a skew partition. St001493The number of simple modules with maximal even projective dimension in the corresponding Nakayama algebra. St001507The sum of projective dimension of simple modules with even projective dimension divided by 2 in the LNakayama algebra corresponding to Dyck paths. St001711The number of permutations such that conjugation with a permutation of given cycle type yields the squared permutation. St000630The length of the shortest palindromic decomposition of a binary word. St001165Number of simple modules with even projective dimension in the corresponding Nakayama algebra. St001471The magnitude of a Dyck path. St000375The number of non weak exceedences of a permutation that are mid-points of a decreasing subsequence of length $3$. St000408The number of occurrences of the pattern 4231 in a permutation. St000954Number of times the corresponding LNakayama algebra has $Ext^i(D(A),A)=0$ for $i>0$. St001230The number of simple modules with injective dimension equal to the dominant dimension equal to one and the dual property. St001332The number of steps on the non-negative side of the walk associated with the permutation. St001847The number of occurrences of the pattern 1432 in a permutation. St000487The length of the shortest cycle of a permutation. 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. St001290The first natural number n such that the tensor product of n copies of D(A) is zero for the corresponding Nakayama algebra A. St000649The number of 3-excedences of a permutation. St000650The number of 3-rises of a permutation. 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. St000352The Elizalde-Pak rank of a permutation. St000541The number of indices greater than or equal to 2 of a permutation such that all smaller indices appear to its right. 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}$. St001859The number of factors of the Stanley symmetric function associated with a permutation. St000542The number of left-to-right-minima of a permutation. St000567The sum of the products of all pairs of parts. St000941The number of characters of the symmetric group whose value on the partition is even. 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. St001811The Castelnuovo-Mumford regularity of a permutation. St000813The number of zero-one matrices with weakly decreasing column sums and row sums given by the partition. 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. St001330The hat guessing number of a graph. St001604The multiplicity of the irreducible representation corresponding to a partition in the relabelling action on polygons. St000689The maximal n such that the minimal generator-cogenerator module in the LNakayama algebra of a Dyck path is n-rigid. St001491The number of indecomposable projective-injective modules in the algebra corresponding to a subset. St001603The number of colourings of a polygon such that the multiplicities of a colour are given by a partition. St001605The number of colourings of a cycle such that the multiplicities of colours are given by a partition. St001095The number of non-isomorphic posets with precisely one further covering relation. St001651The Frankl number of a lattice. St000914The sum of the values of the Möbius function of a poset. St001890The maximum magnitude of the Möbius function of a poset. St001232The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2. St001570The minimal number of edges to add to make a graph Hamiltonian. St000713The dimension of the irreducible representation of Sp(4) labelled by an integer partition. St000714The number of semistandard Young tableau of given shape, with entries at most 2. St000997The even-odd crank of an integer partition. St000681The Grundy value of Chomp on Ferrers diagrams. St001719The number of shortest chains of small intervals from the bottom to the top in a lattice. St000512The number of invariant subsets of size 3 when acting with a permutation of given cycle type. St000937The number of positive values of the symmetric group character corresponding to the partition. St001123The multiplicity of the dual of the standard representation in the Kronecker square corresponding to a partition. St000939The number of characters of the symmetric group whose value on the partition is positive. St000927The alternating sum of the coefficients of the character polynomial of an integer partition. St001964The interval resolution global dimension 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. St001195The global dimension of the algebra $A/AfA$ of the corresponding Nakayama algebra $A$ with minimal left faithful projective-injective module $Af$. 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$. St000058The order of a permutation. St000806The semiperimeter of the associated bargraph. St000666The number of right tethers of a permutation. St001008Number of indecomposable injective modules with projective dimension 1 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. St001208The number of connected components of the quiver of $A/T$ when $T$ is the 1-tilting module corresponding to the permutation in the Auslander algebra $A$ of $K[x]/(x^n)$. St001948The number of augmented double ascents of a permutation. St000816The number of standard composition tableaux of the composition. St000215The number of adjacencies of a permutation, zero appended. St000883The number of longest increasing subsequences of a permutation. St001431Half of the Loewy length minus one of a modified stable Auslander algebra of the Nakayama algebra corresponding to the Dyck path. St001630The global dimension of the incidence algebra of the lattice over the rational numbers. St000237The number of small exceedances. St000181The number of connected components of the Hasse diagram for the poset. St000583The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 1, 2 are maximal. St000588The number of occurrences of the pattern {{1},{2},{3}} such that 1,3 are minimal, 2 is maximal. St000608The number of occurrences of the pattern {{1},{2},{3}} such that 1,2 are minimal, 3 is maximal. St001882The number of occurrences of a type-B 231 pattern in a signed permutation. St000635The number of strictly order preserving maps of a poset into itself. St001720The minimal length of a chain of small intervals in a lattice. St001627The number of coloured connected graphs such that the multiplicities of colours are given by a partition. St001763The Hurwitz number of an integer partition. St001938The number of transitive monotone factorizations of genus zero of a permutation of given cycle type. St001875The number of simple modules with projective dimension at most 1. St000017The number of inversions of a standard tableau. St000405The number of occurrences of the pattern 1324 in a permutation. St000440The number of occurrences of the pattern 4132 or of the pattern 4231 in a permutation. St000488The number of cycles of a permutation of length at most 2. St000534The number of 2-rises of a permutation. St001061The number of indices that are both descents and recoils of a permutation. St001314The number of tilting modules of arbitrary projective dimension that have no simple modules as a direct summand in the corresponding Nakayama algebra. St001856The number of edges in the reduced word graph of a permutation. St001866The nesting alignments of a signed permutation. St001867The number of alignments of type EN of a signed permutation. St001960The number of descents of a permutation minus one if its first entry is not one. St000036The evaluation at 1 of the Kazhdan-Lusztig polynomial with parameters given by the identity and the permutation. St000153The number of adjacent cycles of a permutation. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St001591The number of graphs with the given composition of multiplicities of Laplacian eigenvalues. St001661Half the permanent of the Identity matrix plus the permutation matrix associated to the permutation. St001768The number of reduced words of a signed permutation. St000451The length of the longest pattern of the form k 1 2. St001857The number of edges in the reduced word graph of a signed permutation. St001344The neighbouring number of a permutation. St000023The number of inner peaks of a permutation. St000034The maximum defect over any reduced expression for a permutation and any subexpression. St000091The descent variation of a composition. St000122The number of occurrences of the contiguous pattern [.,[.,[[.,.],.]]] in a binary tree. St000130The number of occurrences of the contiguous pattern [.,[[.,.],[[.,.],.]]] in a binary tree. St000132The number of occurrences of the contiguous pattern [[.,.],[.,[[.,.],.]]] in a binary tree. St000241The number of cyclical small excedances. St000338The number of pixed points of a permutation. St000370The genus of a graph. St000407The number of occurrences of the pattern 2143 in a permutation. St000560The number of occurrences of the pattern {{1,2},{3,4}} in a set partition. St000562The number of internal points of a set partition. St000622The number of occurrences of the patterns 2143 or 4231 in a permutation. St000624The normalized sum of the minimal distances to a greater element. St000750The number of occurrences of the pattern 4213 in a permutation. St000751The number of occurrences of either of the pattern 2143 or 2143 in a permutation. St000779The tier of a permutation. St000872The number of very big descents of a permutation. St000873The aix statistic of a permutation. St000881The number of short braid edges in the graph of braid moves of a permutation. St001174The Gorenstein dimension of the algebra $A/I$ when $I$ is the tilting module corresponding to the permutation in the Auslander algebra of $K[x]/(x^n)$. St001301The first Betti number of the order complex associated with the poset. St001309The number of four-cliques in a graph. St001329The minimal number of occurrences of the outerplanar pattern in a linear ordering of the vertices of the graph. St001334The minimal number of occurrences of the 3-colorable pattern in a linear ordering of the vertices of the graph. St001411The number of patterns 321 or 3412 in a permutation. St001466The number of transpositions swapping cyclically adjacent numbers in a permutation. St001470The cyclic holeyness of a permutation. St001535The number of cyclic alignments of a permutation. St001537The number of cyclic crossings of a permutation. St001550The number of inversions between exceedances where the greater exceedance is linked. St001551The number of restricted non-inversions between exceedances where the rightmost exceedance is linked. St001559The number of transpositions that are smaller or equal to a permutation in Bruhat order while not being inversions. St001633The number of simple modules with projective dimension two in the incidence algebra of the poset. St001705The number of occurrences of the pattern 2413 in a permutation. St001715The number of non-records in a permutation. St001845The number of join irreducibles minus the rank of a lattice. St001871The number of triconnected components of a graph. St000099The number of valleys of a permutation, including the boundary. St000239The number of small weak excedances. St000243The number of cyclic valleys and cyclic peaks of a permutation. St000570The Edelman-Greene number of a permutation. St000880The number of connected components of long braid edges in the graph of braid moves of a permutation. St000887The maximal number of nonzero entries on a diagonal of a permutation matrix. St000908The length of the shortest maximal antichain in a poset. St001220The width of a permutation. St001413Half the length of the longest even length palindromic prefix of a binary word. St001499The number of indecomposable projective-injective modules of a magnitude 1 Nakayama algebra. St001582The grades of the simple modules corresponding to the points in the poset of the symmetric group under the Bruhat order. St001629The coefficient of the integer composition in the quasisymmetric expansion of the relabelling action of the symmetric group on cycles. St001634The trace of the Coxeter matrix of the incidence algebra of a poset. St001693The excess length of a longest path consisting of elements and blocks of a set partition. St001941The evaluation at 1 of the modified Kazhdan--Lusztig R polynomial (as in [1, Section 5. St000236The number of cyclical small weak excedances. St000248The number of anti-singletons of a set partition. St000249The number of singletons (St000247) plus the number of antisingletons (St000248) of a set partition. St000308The height of the tree associated to a permutation. St000504The cardinality of the first block of a set partition. St000636The hull number of a graph. St000907The number of maximal antichains of minimal length in a poset. St001062The maximal size of a block of a set partition. St001654The monophonic hull number of a graph. St000879The number of long braid edges in the graph of braid moves of a permutation. 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)$. St001624The breadth of a lattice. St000882The number of connected components of short braid edges in the graph of braid moves of a permutation. St000022The number of fixed points of a permutation. St000039The number of crossings of a permutation. St000089The absolute variation of a composition. St000090The variation of a composition. St000133The "bounce" of a permutation. St000188The area of the Dyck path corresponding to a parking function and the total displacement of a parking function. St000195The number of secondary dinversion pairs of the dyck path corresponding to a parking function. St000221The number of strong fixed points of a permutation. St000233The number of nestings of a set partition. St000234The number of global ascents of a permutation. St000247The number of singleton blocks of a set partition. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000274The number of perfect matchings of a graph. St000279The size of the preimage of the map 'cycle-as-one-line notation' from Permutations to Permutations. St000295The length of the border of a binary word. St000310The minimal degree of a vertex of a graph. St000322The skewness of a graph. St000360The number of occurrences of the pattern 32-1. St000373The number of weak exceedences of a permutation that are also mid-points of a decreasing subsequence of length $3$. St000447The number of pairs of vertices of a graph with distance 3. St000449The number of pairs of vertices of a graph with distance 4. St000461The rix statistic of a permutation. St000462The major index minus the number of excedences of a permutation. St000486The number of cycles of length at least 3 of a permutation. St000496The rcs statistic of a set partition. St000516The number of stretching pairs of a permutation. St000557The number of occurrences of the pattern {{1},{2},{3}} in a set partition. St000559The number of occurrences of the pattern {{1,3},{2,4}} in a set partition. St000561The number of occurrences of the pattern {{1,2,3}} in a set partition. St000563The number of overlapping pairs of blocks of a set partition. St000573The number of occurrences of the pattern {{1},{2}} such that 1 is a singleton and 2 a maximal element. St000575The number of occurrences of the pattern {{1},{2}} such that 1 is a maximal element and 2 a singleton. St000578The number of occurrences of the pattern {{1},{2}} such that 1 is a singleton. St000580The number of occurrences of the pattern {{1},{2},{3}} such that 2 is minimal, 3 is maximal. St000584The number of occurrences of the pattern {{1},{2},{3}} such that 1 is minimal, 3 is maximal. St000587The number of occurrences of the pattern {{1},{2},{3}} such that 1 is minimal. St000591The number of occurrences of the pattern {{1},{2},{3}} such that 2 is maximal. St000592The number of occurrences of the pattern {{1},{2},{3}} such that 1 is maximal. St000593The number of occurrences of the pattern {{1},{2},{3}} such that 1,2 are minimal. St000596The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 1 is maximal. St000603The number of occurrences of the pattern {{1},{2},{3}} such that 2,3 are minimal. St000604The number of occurrences of the pattern {{1},{2},{3}} such that 3 is minimal, 2 is maximal. St000615The number of occurrences of the pattern {{1},{2},{3}} such that 1,3 are maximal. St000623The number of occurrences of the pattern 52341 in a permutation. St000663The number of right floats of a permutation. St000709The number of occurrences of 14-2-3 or 14-3-2. St000943The number of spots the most unlucky car had to go further in a parking function. St000962The 3-shifted major index of a permutation. St000989The number of final rises of a permutation. St001021Sum of the differences between projective and codominant dimension of the non-projective indecomposable injective modules in the Nakayama algebra corresponding to the Dyck path. St001059Number of occurrences of the patterns 41352,42351,51342,52341 in a permutation. St001089Number of indecomposable projective non-injective modules minus the number of indecomposable projective non-injective modules with dominant dimension equal to the injective dimension in the corresponding Nakayama algebra. St001171The vector space dimension of $Ext_A^1(I_o,A)$ when $I_o$ is the tilting module corresponding to the permutation $o$ in the Auslander algebra $A$ of $K[x]/(x^n)$. St001185The number of indecomposable injective modules of grade at least 2 in the corresponding Nakayama algebra. St001229The vector space dimension of the first extension group between the Jacobson radical J and J^2. St001381The fertility of a permutation. St001402The number of separators in a permutation. St001403The number of vertical separators in a permutation. St001513The number of nested exceedences of a permutation. St001524The degree of symmetry of a binary word. St001536The number of cyclic misalignments of a permutation. St001577The minimal number of edges to add or remove to make a graph a cograph. St001578The minimal number of edges to add or remove to make a graph a line graph. St001771The number of occurrences of the signed pattern 1-2 in a signed permutation. St001816Eigenvalues of the top-to-random operator acting on a simple module. St001868The number of alignments of type NE of a signed permutation. St001870The number of positive entries followed by a negative entry in a signed permutation. St001895The oddness of a signed permutation. St001903The number of fixed points of a parking function. St000021The number of descents of a permutation. St000056The decomposition (or block) number of a permutation. St000154The sum of the descent bottoms of a permutation. St000253The crossing number of a set partition. St000260The radius of a connected graph. St000286The number of connected components of the complement of a graph. St000314The number of left-to-right-maxima of a permutation. St000333The dez statistic, the number of descents of a permutation after replacing fixed points by zeros. St000374The number of exclusive right-to-left minima of a permutation. St000654The first descent of a permutation. St000694The number of affine bounded permutations that project to a given permutation. St000740The last entry of a permutation. St000756The sum of the positions of the left to right maxima of a permutation. St000864The number of circled entries of the shifted recording tableau of a permutation. St000952Gives the number of irreducible factors of the Coxeter polynomial of the Dyck path over the rational numbers. St000991The number of right-to-left minima of a permutation. St001052The length of the exterior of a permutation. St001096The size of the overlap set of a permutation. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001257The dominant dimension of the double dual of A/J when A is the corresponding Nakayama algebra with Jacobson radical J. St001273The projective dimension of the first term in an injective coresolution of the regular module. St001289The vector space dimension of the n-fold tensor product of D(A), where n is maximal such that this n-fold tensor product is nonzero. St001359The number of permutations in the equivalence class of a permutation obtained by taking inverses of cycles. St001461The number of topologically connected components of the chord diagram of a permutation. St001462The number of factors of a standard tableaux under concatenation. St001514The dimension of the top of the Auslander-Reiten translate of the regular modules as a bimodule. St001518The number of graphs with the same ordinary spectrum as the given graph. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St001665The number of pure excedances of a permutation. St001729The number of visible descents of a permutation. St001737The number of descents of type 2 in a permutation. St001778The largest greatest common divisor of an element and its image in a permutation. St001806The upper middle entry of a permutation. St001884The number of borders of a binary word. St001889The size of the connectivity set of a signed permutation. St001928The number of non-overlapping descents in a permutation. St000084The number of subtrees. St000105The number of blocks in the set partition. St000325The width of the tree associated to a permutation. St000328The maximum number of child nodes in a tree. St000401The size of the symmetry class of a permutation. St000417The size of the automorphism group of the ordered tree. St000470The number of runs in a permutation. St000485The length of the longest cycle of a permutation. St000793The length of the longest partition in the vacillating tableau corresponding to a set partition. St000823The number of unsplittable factors of the set partition. St001005The number of indices for a permutation that are either left-to-right maxima or right-to-left minima but not both. St001051The depth of the label 1 in the decreasing labelled unordered tree associated with the set partition. St001058The breadth of the ordered tree. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation.