searching the database
Your data matches 9 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
(click to perform a complete search on your data)
Matching statistic: St000392
Mp00317: Integer partitions —odd parts⟶ Binary words
Mp00105: Binary words —complement⟶ Binary words
Mp00224: Binary words —runsort⟶ Binary words
St000392: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00105: Binary words —complement⟶ Binary words
Mp00224: Binary words —runsort⟶ Binary words
St000392: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> 1 => 0 => 0 => 0
[2]
=> 0 => 1 => 1 => 1
[1,1]
=> 11 => 00 => 00 => 0
[3]
=> 1 => 0 => 0 => 0
[2,1]
=> 01 => 10 => 01 => 1
[1,1,1]
=> 111 => 000 => 000 => 0
[4]
=> 0 => 1 => 1 => 1
[3,1]
=> 11 => 00 => 00 => 0
[2,2]
=> 00 => 11 => 11 => 2
[2,1,1]
=> 011 => 100 => 001 => 1
[1,1,1,1]
=> 1111 => 0000 => 0000 => 0
[5]
=> 1 => 0 => 0 => 0
[4,1]
=> 01 => 10 => 01 => 1
[3,2]
=> 10 => 01 => 01 => 1
[3,1,1]
=> 111 => 000 => 000 => 0
[2,2,1]
=> 001 => 110 => 011 => 2
[2,1,1,1]
=> 0111 => 1000 => 0001 => 1
[1,1,1,1,1]
=> 11111 => 00000 => 00000 => 0
[6]
=> 0 => 1 => 1 => 1
[5,1]
=> 11 => 00 => 00 => 0
[4,2]
=> 00 => 11 => 11 => 2
[4,1,1]
=> 011 => 100 => 001 => 1
[3,3]
=> 11 => 00 => 00 => 0
[3,2,1]
=> 101 => 010 => 001 => 1
[3,1,1,1]
=> 1111 => 0000 => 0000 => 0
[2,2,2]
=> 000 => 111 => 111 => 3
[2,2,1,1]
=> 0011 => 1100 => 0011 => 2
[2,1,1,1,1]
=> 01111 => 10000 => 00001 => 1
[1,1,1,1,1,1]
=> 111111 => 000000 => 000000 => 0
[7]
=> 1 => 0 => 0 => 0
[6,1]
=> 01 => 10 => 01 => 1
[5,2]
=> 10 => 01 => 01 => 1
[5,1,1]
=> 111 => 000 => 000 => 0
[4,3]
=> 01 => 10 => 01 => 1
[4,2,1]
=> 001 => 110 => 011 => 2
[4,1,1,1]
=> 0111 => 1000 => 0001 => 1
[3,3,1]
=> 111 => 000 => 000 => 0
[3,2,2]
=> 100 => 011 => 011 => 2
[3,2,1,1]
=> 1011 => 0100 => 0001 => 1
[3,1,1,1,1]
=> 11111 => 00000 => 00000 => 0
[2,2,2,1]
=> 0001 => 1110 => 0111 => 3
[2,2,1,1,1]
=> 00111 => 11000 => 00011 => 2
[2,1,1,1,1,1]
=> 011111 => 100000 => 000001 => 1
[1,1,1,1,1,1,1]
=> 1111111 => 0000000 => 0000000 => 0
[8]
=> 0 => 1 => 1 => 1
[7,1]
=> 11 => 00 => 00 => 0
[6,2]
=> 00 => 11 => 11 => 2
[6,1,1]
=> 011 => 100 => 001 => 1
[5,3]
=> 11 => 00 => 00 => 0
[5,2,1]
=> 101 => 010 => 001 => 1
Description
The length of the longest run of ones in a binary word.
Matching statistic: St000877
Mp00317: Integer partitions —odd parts⟶ Binary words
Mp00104: Binary words —reverse⟶ Binary words
Mp00224: Binary words —runsort⟶ Binary words
St000877: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00104: Binary words —reverse⟶ Binary words
Mp00224: Binary words —runsort⟶ Binary words
St000877: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> 1 => 1 => 1 => 0
[2]
=> 0 => 0 => 0 => 1
[1,1]
=> 11 => 11 => 11 => 0
[3]
=> 1 => 1 => 1 => 0
[2,1]
=> 01 => 10 => 01 => 1
[1,1,1]
=> 111 => 111 => 111 => 0
[4]
=> 0 => 0 => 0 => 1
[3,1]
=> 11 => 11 => 11 => 0
[2,2]
=> 00 => 00 => 00 => 2
[2,1,1]
=> 011 => 110 => 011 => 1
[1,1,1,1]
=> 1111 => 1111 => 1111 => 0
[5]
=> 1 => 1 => 1 => 0
[4,1]
=> 01 => 10 => 01 => 1
[3,2]
=> 10 => 01 => 01 => 1
[3,1,1]
=> 111 => 111 => 111 => 0
[2,2,1]
=> 001 => 100 => 001 => 2
[2,1,1,1]
=> 0111 => 1110 => 0111 => 1
[1,1,1,1,1]
=> 11111 => 11111 => 11111 => 0
[6]
=> 0 => 0 => 0 => 1
[5,1]
=> 11 => 11 => 11 => 0
[4,2]
=> 00 => 00 => 00 => 2
[4,1,1]
=> 011 => 110 => 011 => 1
[3,3]
=> 11 => 11 => 11 => 0
[3,2,1]
=> 101 => 101 => 011 => 1
[3,1,1,1]
=> 1111 => 1111 => 1111 => 0
[2,2,2]
=> 000 => 000 => 000 => 3
[2,2,1,1]
=> 0011 => 1100 => 0011 => 2
[2,1,1,1,1]
=> 01111 => 11110 => 01111 => 1
[1,1,1,1,1,1]
=> 111111 => 111111 => 111111 => 0
[7]
=> 1 => 1 => 1 => 0
[6,1]
=> 01 => 10 => 01 => 1
[5,2]
=> 10 => 01 => 01 => 1
[5,1,1]
=> 111 => 111 => 111 => 0
[4,3]
=> 01 => 10 => 01 => 1
[4,2,1]
=> 001 => 100 => 001 => 2
[4,1,1,1]
=> 0111 => 1110 => 0111 => 1
[3,3,1]
=> 111 => 111 => 111 => 0
[3,2,2]
=> 100 => 001 => 001 => 2
[3,2,1,1]
=> 1011 => 1101 => 0111 => 1
[3,1,1,1,1]
=> 11111 => 11111 => 11111 => 0
[2,2,2,1]
=> 0001 => 1000 => 0001 => 3
[2,2,1,1,1]
=> 00111 => 11100 => 00111 => 2
[2,1,1,1,1,1]
=> 011111 => 111110 => 011111 => 1
[1,1,1,1,1,1,1]
=> 1111111 => 1111111 => 1111111 => 0
[8]
=> 0 => 0 => 0 => 1
[7,1]
=> 11 => 11 => 11 => 0
[6,2]
=> 00 => 00 => 00 => 2
[6,1,1]
=> 011 => 110 => 011 => 1
[5,3]
=> 11 => 11 => 11 => 0
[5,2,1]
=> 101 => 101 => 011 => 1
Description
The depth of the binary word interpreted as a path.
This is the maximal value of the number of zeros minus the number of ones occurring in a prefix of the binary word, see [1, sec.9.1.2].
The number of binary words of length $n$ with depth $k$ is $\binom{n}{\lfloor\frac{(n+1) - (-1)^{n-k}(k+1)}{2}\rfloor}$, see [2].
Matching statistic: St001372
Mp00317: Integer partitions —odd parts⟶ Binary words
Mp00105: Binary words —complement⟶ Binary words
Mp00224: Binary words —runsort⟶ Binary words
St001372: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00105: Binary words —complement⟶ Binary words
Mp00224: Binary words —runsort⟶ Binary words
St001372: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> 1 => 0 => 0 => 0
[2]
=> 0 => 1 => 1 => 1
[1,1]
=> 11 => 00 => 00 => 0
[3]
=> 1 => 0 => 0 => 0
[2,1]
=> 01 => 10 => 01 => 1
[1,1,1]
=> 111 => 000 => 000 => 0
[4]
=> 0 => 1 => 1 => 1
[3,1]
=> 11 => 00 => 00 => 0
[2,2]
=> 00 => 11 => 11 => 2
[2,1,1]
=> 011 => 100 => 001 => 1
[1,1,1,1]
=> 1111 => 0000 => 0000 => 0
[5]
=> 1 => 0 => 0 => 0
[4,1]
=> 01 => 10 => 01 => 1
[3,2]
=> 10 => 01 => 01 => 1
[3,1,1]
=> 111 => 000 => 000 => 0
[2,2,1]
=> 001 => 110 => 011 => 2
[2,1,1,1]
=> 0111 => 1000 => 0001 => 1
[1,1,1,1,1]
=> 11111 => 00000 => 00000 => 0
[6]
=> 0 => 1 => 1 => 1
[5,1]
=> 11 => 00 => 00 => 0
[4,2]
=> 00 => 11 => 11 => 2
[4,1,1]
=> 011 => 100 => 001 => 1
[3,3]
=> 11 => 00 => 00 => 0
[3,2,1]
=> 101 => 010 => 001 => 1
[3,1,1,1]
=> 1111 => 0000 => 0000 => 0
[2,2,2]
=> 000 => 111 => 111 => 3
[2,2,1,1]
=> 0011 => 1100 => 0011 => 2
[2,1,1,1,1]
=> 01111 => 10000 => 00001 => 1
[1,1,1,1,1,1]
=> 111111 => 000000 => 000000 => 0
[7]
=> 1 => 0 => 0 => 0
[6,1]
=> 01 => 10 => 01 => 1
[5,2]
=> 10 => 01 => 01 => 1
[5,1,1]
=> 111 => 000 => 000 => 0
[4,3]
=> 01 => 10 => 01 => 1
[4,2,1]
=> 001 => 110 => 011 => 2
[4,1,1,1]
=> 0111 => 1000 => 0001 => 1
[3,3,1]
=> 111 => 000 => 000 => 0
[3,2,2]
=> 100 => 011 => 011 => 2
[3,2,1,1]
=> 1011 => 0100 => 0001 => 1
[3,1,1,1,1]
=> 11111 => 00000 => 00000 => 0
[2,2,2,1]
=> 0001 => 1110 => 0111 => 3
[2,2,1,1,1]
=> 00111 => 11000 => 00011 => 2
[2,1,1,1,1,1]
=> 011111 => 100000 => 000001 => 1
[1,1,1,1,1,1,1]
=> 1111111 => 0000000 => 0000000 => 0
[8]
=> 0 => 1 => 1 => 1
[7,1]
=> 11 => 00 => 00 => 0
[6,2]
=> 00 => 11 => 11 => 2
[6,1,1]
=> 011 => 100 => 001 => 1
[5,3]
=> 11 => 00 => 00 => 0
[5,2,1]
=> 101 => 010 => 001 => 1
Description
The length of a longest cyclic run of ones of a binary word.
Consider the binary word as a cyclic arrangement of ones and zeros. Then this statistic is the length of the longest continuous sequence of ones in this arrangement.
Matching statistic: St000326
Mp00317: Integer partitions —odd parts⟶ Binary words
Mp00104: Binary words —reverse⟶ Binary words
Mp00224: Binary words —runsort⟶ Binary words
St000326: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00104: Binary words —reverse⟶ Binary words
Mp00224: Binary words —runsort⟶ Binary words
St000326: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
=> 1 => 1 => 1 => 1 = 0 + 1
[2]
=> 0 => 0 => 0 => 2 = 1 + 1
[1,1]
=> 11 => 11 => 11 => 1 = 0 + 1
[3]
=> 1 => 1 => 1 => 1 = 0 + 1
[2,1]
=> 01 => 10 => 01 => 2 = 1 + 1
[1,1,1]
=> 111 => 111 => 111 => 1 = 0 + 1
[4]
=> 0 => 0 => 0 => 2 = 1 + 1
[3,1]
=> 11 => 11 => 11 => 1 = 0 + 1
[2,2]
=> 00 => 00 => 00 => 3 = 2 + 1
[2,1,1]
=> 011 => 110 => 011 => 2 = 1 + 1
[1,1,1,1]
=> 1111 => 1111 => 1111 => 1 = 0 + 1
[5]
=> 1 => 1 => 1 => 1 = 0 + 1
[4,1]
=> 01 => 10 => 01 => 2 = 1 + 1
[3,2]
=> 10 => 01 => 01 => 2 = 1 + 1
[3,1,1]
=> 111 => 111 => 111 => 1 = 0 + 1
[2,2,1]
=> 001 => 100 => 001 => 3 = 2 + 1
[2,1,1,1]
=> 0111 => 1110 => 0111 => 2 = 1 + 1
[1,1,1,1,1]
=> 11111 => 11111 => 11111 => 1 = 0 + 1
[6]
=> 0 => 0 => 0 => 2 = 1 + 1
[5,1]
=> 11 => 11 => 11 => 1 = 0 + 1
[4,2]
=> 00 => 00 => 00 => 3 = 2 + 1
[4,1,1]
=> 011 => 110 => 011 => 2 = 1 + 1
[3,3]
=> 11 => 11 => 11 => 1 = 0 + 1
[3,2,1]
=> 101 => 101 => 011 => 2 = 1 + 1
[3,1,1,1]
=> 1111 => 1111 => 1111 => 1 = 0 + 1
[2,2,2]
=> 000 => 000 => 000 => 4 = 3 + 1
[2,2,1,1]
=> 0011 => 1100 => 0011 => 3 = 2 + 1
[2,1,1,1,1]
=> 01111 => 11110 => 01111 => 2 = 1 + 1
[1,1,1,1,1,1]
=> 111111 => 111111 => 111111 => 1 = 0 + 1
[7]
=> 1 => 1 => 1 => 1 = 0 + 1
[6,1]
=> 01 => 10 => 01 => 2 = 1 + 1
[5,2]
=> 10 => 01 => 01 => 2 = 1 + 1
[5,1,1]
=> 111 => 111 => 111 => 1 = 0 + 1
[4,3]
=> 01 => 10 => 01 => 2 = 1 + 1
[4,2,1]
=> 001 => 100 => 001 => 3 = 2 + 1
[4,1,1,1]
=> 0111 => 1110 => 0111 => 2 = 1 + 1
[3,3,1]
=> 111 => 111 => 111 => 1 = 0 + 1
[3,2,2]
=> 100 => 001 => 001 => 3 = 2 + 1
[3,2,1,1]
=> 1011 => 1101 => 0111 => 2 = 1 + 1
[3,1,1,1,1]
=> 11111 => 11111 => 11111 => 1 = 0 + 1
[2,2,2,1]
=> 0001 => 1000 => 0001 => 4 = 3 + 1
[2,2,1,1,1]
=> 00111 => 11100 => 00111 => 3 = 2 + 1
[2,1,1,1,1,1]
=> 011111 => 111110 => 011111 => 2 = 1 + 1
[1,1,1,1,1,1,1]
=> 1111111 => 1111111 => 1111111 => 1 = 0 + 1
[8]
=> 0 => 0 => 0 => 2 = 1 + 1
[7,1]
=> 11 => 11 => 11 => 1 = 0 + 1
[6,2]
=> 00 => 00 => 00 => 3 = 2 + 1
[6,1,1]
=> 011 => 110 => 011 => 2 = 1 + 1
[5,3]
=> 11 => 11 => 11 => 1 = 0 + 1
[5,2,1]
=> 101 => 101 => 011 => 2 = 1 + 1
Description
The position of the first one in a binary word after appending a 1 at the end.
Regarding the binary word as a subset of $\{1,\dots,n,n+1\}$ that contains $n+1$, this is the minimal element of the set.
Matching statistic: St000149
Mp00312: Integer partitions —Glaisher-Franklin⟶ Integer partitions
Mp00044: Integer partitions —conjugate⟶ Integer partitions
St000149: Integer partitions ⟶ ℤResult quality: 42% ●values known / values provided: 42%●distinct values known / distinct values provided: 100%
Mp00044: Integer partitions —conjugate⟶ Integer partitions
St000149: Integer partitions ⟶ ℤResult quality: 42% ●values known / values provided: 42%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1]
=> [1]
=> 0
[2]
=> [1,1]
=> [2]
=> 1
[1,1]
=> [2]
=> [1,1]
=> 0
[3]
=> [3]
=> [1,1,1]
=> 0
[2,1]
=> [1,1,1]
=> [3]
=> 1
[1,1,1]
=> [2,1]
=> [2,1]
=> 0
[4]
=> [2,2]
=> [2,2]
=> 1
[3,1]
=> [3,1]
=> [2,1,1]
=> 0
[2,2]
=> [1,1,1,1]
=> [4]
=> 2
[2,1,1]
=> [2,1,1]
=> [3,1]
=> 1
[1,1,1,1]
=> [4]
=> [1,1,1,1]
=> 0
[5]
=> [5]
=> [1,1,1,1,1]
=> 0
[4,1]
=> [2,2,1]
=> [3,2]
=> 1
[3,2]
=> [3,1,1]
=> [3,1,1]
=> 1
[3,1,1]
=> [3,2]
=> [2,2,1]
=> 0
[2,2,1]
=> [1,1,1,1,1]
=> [5]
=> 2
[2,1,1,1]
=> [2,1,1,1]
=> [4,1]
=> 1
[1,1,1,1,1]
=> [4,1]
=> [2,1,1,1]
=> 0
[6]
=> [3,3]
=> [2,2,2]
=> 1
[5,1]
=> [5,1]
=> [2,1,1,1,1]
=> 0
[4,2]
=> [2,2,1,1]
=> [4,2]
=> 2
[4,1,1]
=> [2,2,2]
=> [3,3]
=> 1
[3,3]
=> [6]
=> [1,1,1,1,1,1]
=> 0
[3,2,1]
=> [3,1,1,1]
=> [4,1,1]
=> 1
[3,1,1,1]
=> [3,2,1]
=> [3,2,1]
=> 0
[2,2,2]
=> [1,1,1,1,1,1]
=> [6]
=> 3
[2,2,1,1]
=> [2,1,1,1,1]
=> [5,1]
=> 2
[2,1,1,1,1]
=> [4,1,1]
=> [3,1,1,1]
=> 1
[1,1,1,1,1,1]
=> [4,2]
=> [2,2,1,1]
=> 0
[7]
=> [7]
=> [1,1,1,1,1,1,1]
=> 0
[6,1]
=> [3,3,1]
=> [3,2,2]
=> 1
[5,2]
=> [5,1,1]
=> [3,1,1,1,1]
=> 1
[5,1,1]
=> [5,2]
=> [2,2,1,1,1]
=> 0
[4,3]
=> [3,2,2]
=> [3,3,1]
=> 1
[4,2,1]
=> [2,2,1,1,1]
=> [5,2]
=> 2
[4,1,1,1]
=> [2,2,2,1]
=> [4,3]
=> 1
[3,3,1]
=> [6,1]
=> [2,1,1,1,1,1]
=> 0
[3,2,2]
=> [3,1,1,1,1]
=> [5,1,1]
=> 2
[3,2,1,1]
=> [3,2,1,1]
=> [4,2,1]
=> 1
[3,1,1,1,1]
=> [4,3]
=> [2,2,2,1]
=> 0
[2,2,2,1]
=> [1,1,1,1,1,1,1]
=> [7]
=> 3
[2,2,1,1,1]
=> [2,1,1,1,1,1]
=> [6,1]
=> 2
[2,1,1,1,1,1]
=> [4,1,1,1]
=> [4,1,1,1]
=> 1
[1,1,1,1,1,1,1]
=> [4,2,1]
=> [3,2,1,1]
=> 0
[8]
=> [4,4]
=> [2,2,2,2]
=> 1
[7,1]
=> [7,1]
=> [2,1,1,1,1,1,1]
=> 0
[6,2]
=> [3,3,1,1]
=> [4,2,2]
=> 2
[6,1,1]
=> [3,3,2]
=> [3,3,2]
=> 1
[5,3]
=> [5,3]
=> [2,2,2,1,1]
=> 0
[5,2,1]
=> [5,1,1,1]
=> [4,1,1,1,1]
=> 1
[7,2,1,1]
=> [7,2,1,1]
=> [4,2,1,1,1,1,1]
=> ? = 1
[4,3,2,2]
=> [3,2,2,1,1,1,1]
=> [7,3,1]
=> ? = 3
[7,3,1,1]
=> [7,3,2]
=> [3,3,2,1,1,1,1]
=> ? = 0
[7,1,1,1,1,1]
=> [7,4,1]
=> [3,2,2,2,1,1,1]
=> ? = 0
[5,2,2,1,1,1]
=> [5,2,1,1,1,1,1]
=> [7,2,1,1,1]
=> ? = 2
[4,3,3,1,1]
=> [6,2,2,2]
=> [4,4,1,1,1,1]
=> ? = 1
[3,3,3,1,1,1]
=> [6,3,2,1]
=> [4,3,2,1,1,1]
=> ? = 0
[3,3,2,1,1,1,1]
=> [6,4,1,1]
=> [4,2,2,2,1,1]
=> ? = 1
[3,2,1,1,1,1,1,1,1]
=> [4,3,2,1,1,1]
=> [6,3,2,1]
=> ? = 1
[10,2,1]
=> [5,5,1,1,1]
=> [5,2,2,2,2]
=> ? = 2
[10,1,1,1]
=> [5,5,2,1]
=> [4,3,2,2,2]
=> ? = 1
[9,2,2]
=> [9,1,1,1,1]
=> [5,1,1,1,1,1,1,1,1]
=> ? = 2
[9,2,1,1]
=> [9,2,1,1]
=> [4,2,1,1,1,1,1,1,1]
=> ? = 1
[7,6]
=> [7,3,3]
=> [3,3,3,1,1,1,1]
=> ? = 1
[7,4,1,1]
=> [7,2,2,2]
=> [4,4,1,1,1,1,1]
=> ? = 1
[7,3,1,1,1]
=> [7,3,2,1]
=> [4,3,2,1,1,1,1]
=> ? = 0
[7,2,2,1,1]
=> [7,2,1,1,1,1]
=> [6,2,1,1,1,1,1]
=> ? = 2
[7,2,1,1,1,1]
=> [7,4,1,1]
=> [4,2,2,2,1,1,1]
=> ? = 1
[6,3,3,1]
=> [6,3,3,1]
=> [4,3,3,1,1,1]
=> ? = 1
[5,5,2,1]
=> [10,1,1,1]
=> [4,1,1,1,1,1,1,1,1,1]
=> ? = 1
[5,4,4]
=> [5,2,2,2,2]
=> [5,5,1,1,1]
=> ? = 2
[5,4,2,2]
=> [5,2,2,1,1,1,1]
=> [7,3,1,1,1]
=> ? = 3
[5,4,2,1,1]
=> [5,2,2,2,1,1]
=> [6,4,1,1,1]
=> ? = 2
[5,3,2,2,1]
=> [5,3,1,1,1,1,1]
=> [7,2,2,1,1]
=> ? = 2
[5,3,2,1,1,1]
=> [5,3,2,1,1,1]
=> [6,3,2,1,1]
=> ? = 1
[5,2,2,2,2]
=> [5,1,1,1,1,1,1,1,1]
=> [9,1,1,1,1]
=> ? = 4
[5,2,2,2,1,1]
=> [5,2,1,1,1,1,1,1]
=> [8,2,1,1,1]
=> ? = 3
[5,1,1,1,1,1,1,1,1]
=> [8,5]
=> [2,2,2,2,2,1,1,1]
=> ? = 0
[4,3,3,3]
=> [6,3,2,2]
=> [4,4,2,1,1,1]
=> ? = 1
[4,3,2,2,2]
=> [3,2,2,1,1,1,1,1,1]
=> [9,3,1]
=> ? = 4
[4,2,2,2,2,1]
=> [2,2,1,1,1,1,1,1,1,1,1]
=> [11,2]
=> ? = 5
[4,1,1,1,1,1,1,1,1,1]
=> [8,2,2,1]
=> [4,3,1,1,1,1,1,1]
=> ? = 1
[3,3,2,2,2,1]
=> [6,1,1,1,1,1,1,1]
=> [8,1,1,1,1,1]
=> ? = 3
[3,3,1,1,1,1,1,1,1]
=> [6,4,2,1]
=> [4,3,2,2,1,1]
=> ? = 0
[3,2,2,2,2,2]
=> [3,1,1,1,1,1,1,1,1,1,1]
=> [11,1,1]
=> ? = 5
[3,2,2,2,2,1,1]
=> [3,2,1,1,1,1,1,1,1,1]
=> [10,2,1]
=> ? = 4
[3,2,2,2,1,1,1,1]
=> [4,3,1,1,1,1,1,1]
=> [8,2,2,1]
=> ? = 3
[3,2,1,1,1,1,1,1,1,1]
=> [8,3,1,1]
=> [4,2,2,1,1,1,1,1]
=> ? = 1
[2,2,2,2,1,1,1,1,1]
=> [4,1,1,1,1,1,1,1,1,1]
=> [10,1,1,1]
=> ? = 4
[12,2]
=> [6,6,1,1]
=> [4,2,2,2,2,2]
=> ? = 2
[11,2,1]
=> [11,1,1,1]
=> [4,1,1,1,1,1,1,1,1,1,1]
=> ? = 1
[11,1,1,1]
=> [11,2,1]
=> [3,2,1,1,1,1,1,1,1,1,1]
=> ? = 0
[10,4]
=> [5,5,2,2]
=> [4,4,2,2,2]
=> ? = 2
[10,3,1]
=> [5,5,3,1]
=> [4,3,3,2,2]
=> ? = 1
[9,5]
=> [9,5]
=> [2,2,2,2,2,1,1,1,1]
=> ? = 0
[9,4,1]
=> [9,2,2,1]
=> [4,3,1,1,1,1,1,1,1]
=> ? = 1
[9,3,2]
=> [9,3,1,1]
=> [4,2,2,1,1,1,1,1,1]
=> ? = 1
[9,3,1,1]
=> [9,3,2]
=> [3,3,2,1,1,1,1,1,1]
=> ? = 0
[9,2,1,1,1]
=> [9,2,1,1,1]
=> [5,2,1,1,1,1,1,1,1]
=> ? = 1
[9,1,1,1,1,1]
=> [9,4,1]
=> [3,2,2,2,1,1,1,1,1]
=> ? = 0
Description
The number of cells of the partition whose leg is zero and arm is odd.
This statistic is equidistributed with [[St000143]], see [1].
Matching statistic: St000389
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00045: Integer partitions —reading tableau⟶ Standard tableaux
Mp00084: Standard tableaux —conjugate⟶ Standard tableaux
Mp00134: Standard tableaux —descent word⟶ Binary words
St000389: Binary words ⟶ ℤResult quality: 13% ●values known / values provided: 13%●distinct values known / distinct values provided: 78%
Mp00084: Standard tableaux —conjugate⟶ Standard tableaux
Mp00134: Standard tableaux —descent word⟶ Binary words
St000389: Binary words ⟶ ℤResult quality: 13% ●values known / values provided: 13%●distinct values known / distinct values provided: 78%
Values
[1]
=> [[1]]
=> [[1]]
=> => ? = 0
[2]
=> [[1,2]]
=> [[1],[2]]
=> 1 => 1
[1,1]
=> [[1],[2]]
=> [[1,2]]
=> 0 => 0
[3]
=> [[1,2,3]]
=> [[1],[2],[3]]
=> 11 => 0
[2,1]
=> [[1,3],[2]]
=> [[1,2],[3]]
=> 01 => 1
[1,1,1]
=> [[1],[2],[3]]
=> [[1,2,3]]
=> 00 => 0
[4]
=> [[1,2,3,4]]
=> [[1],[2],[3],[4]]
=> 111 => 1
[3,1]
=> [[1,3,4],[2]]
=> [[1,2],[3],[4]]
=> 011 => 0
[2,2]
=> [[1,2],[3,4]]
=> [[1,3],[2,4]]
=> 101 => 2
[2,1,1]
=> [[1,4],[2],[3]]
=> [[1,2,3],[4]]
=> 001 => 1
[1,1,1,1]
=> [[1],[2],[3],[4]]
=> [[1,2,3,4]]
=> 000 => 0
[5]
=> [[1,2,3,4,5]]
=> [[1],[2],[3],[4],[5]]
=> 1111 => 0
[4,1]
=> [[1,3,4,5],[2]]
=> [[1,2],[3],[4],[5]]
=> 0111 => 1
[3,2]
=> [[1,2,5],[3,4]]
=> [[1,3],[2,4],[5]]
=> 1011 => 1
[3,1,1]
=> [[1,4,5],[2],[3]]
=> [[1,2,3],[4],[5]]
=> 0011 => 0
[2,2,1]
=> [[1,3],[2,5],[4]]
=> [[1,2,4],[3,5]]
=> 0101 => 2
[2,1,1,1]
=> [[1,5],[2],[3],[4]]
=> [[1,2,3,4],[5]]
=> 0001 => 1
[1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> [[1,2,3,4,5]]
=> 0000 => 0
[6]
=> [[1,2,3,4,5,6]]
=> [[1],[2],[3],[4],[5],[6]]
=> 11111 => 1
[5,1]
=> [[1,3,4,5,6],[2]]
=> [[1,2],[3],[4],[5],[6]]
=> 01111 => 0
[4,2]
=> [[1,2,5,6],[3,4]]
=> [[1,3],[2,4],[5],[6]]
=> 10111 => 2
[4,1,1]
=> [[1,4,5,6],[2],[3]]
=> [[1,2,3],[4],[5],[6]]
=> 00111 => 1
[3,3]
=> [[1,2,3],[4,5,6]]
=> [[1,4],[2,5],[3,6]]
=> 11011 => 0
[3,2,1]
=> [[1,3,6],[2,5],[4]]
=> [[1,2,4],[3,5],[6]]
=> 01011 => 1
[3,1,1,1]
=> [[1,5,6],[2],[3],[4]]
=> [[1,2,3,4],[5],[6]]
=> 00011 => 0
[2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [[1,3,5],[2,4,6]]
=> 10101 => 3
[2,2,1,1]
=> [[1,4],[2,6],[3],[5]]
=> [[1,2,3,5],[4,6]]
=> 00101 => 2
[2,1,1,1,1]
=> [[1,6],[2],[3],[4],[5]]
=> [[1,2,3,4,5],[6]]
=> 00001 => 1
[1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> [[1,2,3,4,5,6]]
=> 00000 => 0
[7]
=> [[1,2,3,4,5,6,7]]
=> [[1],[2],[3],[4],[5],[6],[7]]
=> 111111 => 0
[6,1]
=> [[1,3,4,5,6,7],[2]]
=> [[1,2],[3],[4],[5],[6],[7]]
=> 011111 => 1
[5,2]
=> [[1,2,5,6,7],[3,4]]
=> [[1,3],[2,4],[5],[6],[7]]
=> 101111 => 1
[5,1,1]
=> [[1,4,5,6,7],[2],[3]]
=> [[1,2,3],[4],[5],[6],[7]]
=> 001111 => 0
[4,3]
=> [[1,2,3,7],[4,5,6]]
=> [[1,4],[2,5],[3,6],[7]]
=> 110111 => 1
[4,2,1]
=> [[1,3,6,7],[2,5],[4]]
=> [[1,2,4],[3,5],[6],[7]]
=> 010111 => 2
[4,1,1,1]
=> [[1,5,6,7],[2],[3],[4]]
=> [[1,2,3,4],[5],[6],[7]]
=> 000111 => 1
[3,3,1]
=> [[1,3,4],[2,6,7],[5]]
=> [[1,2,5],[3,6],[4,7]]
=> 011011 => 0
[3,2,2]
=> [[1,2,7],[3,4],[5,6]]
=> [[1,3,5],[2,4,6],[7]]
=> 101011 => 2
[3,2,1,1]
=> [[1,4,7],[2,6],[3],[5]]
=> [[1,2,3,5],[4,6],[7]]
=> 001011 => 1
[3,1,1,1,1]
=> [[1,6,7],[2],[3],[4],[5]]
=> [[1,2,3,4,5],[6],[7]]
=> 000011 => 0
[2,2,2,1]
=> [[1,3],[2,5],[4,7],[6]]
=> [[1,2,4,6],[3,5,7]]
=> 010101 => 3
[2,2,1,1,1]
=> [[1,5],[2,7],[3],[4],[6]]
=> [[1,2,3,4,6],[5,7]]
=> 000101 => 2
[2,1,1,1,1,1]
=> [[1,7],[2],[3],[4],[5],[6]]
=> [[1,2,3,4,5,6],[7]]
=> 000001 => 1
[1,1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6],[7]]
=> [[1,2,3,4,5,6,7]]
=> 000000 => 0
[8]
=> [[1,2,3,4,5,6,7,8]]
=> [[1],[2],[3],[4],[5],[6],[7],[8]]
=> 1111111 => 1
[7,1]
=> [[1,3,4,5,6,7,8],[2]]
=> [[1,2],[3],[4],[5],[6],[7],[8]]
=> 0111111 => 0
[6,2]
=> [[1,2,5,6,7,8],[3,4]]
=> [[1,3],[2,4],[5],[6],[7],[8]]
=> 1011111 => 2
[6,1,1]
=> [[1,4,5,6,7,8],[2],[3]]
=> [[1,2,3],[4],[5],[6],[7],[8]]
=> 0011111 => 1
[5,3]
=> [[1,2,3,7,8],[4,5,6]]
=> [[1,4],[2,5],[3,6],[7],[8]]
=> 1101111 => 0
[5,2,1]
=> [[1,3,6,7,8],[2,5],[4]]
=> [[1,2,4],[3,5],[6],[7],[8]]
=> 0101111 => 1
[5,1,1,1]
=> [[1,5,6,7,8],[2],[3],[4]]
=> [[1,2,3,4],[5],[6],[7],[8]]
=> 0001111 => 0
[11]
=> [[1,2,3,4,5,6,7,8,9,10,11]]
=> [[1],[2],[3],[4],[5],[6],[7],[8],[9],[10],[11]]
=> ? => ? = 0
[10,1]
=> [[1,3,4,5,6,7,8,9,10,11],[2]]
=> [[1,2],[3],[4],[5],[6],[7],[8],[9],[10],[11]]
=> ? => ? = 1
[9,2]
=> [[1,2,5,6,7,8,9,10,11],[3,4]]
=> [[1,3],[2,4],[5],[6],[7],[8],[9],[10],[11]]
=> ? => ? = 1
[9,1,1]
=> [[1,4,5,6,7,8,9,10,11],[2],[3]]
=> ?
=> ? => ? = 0
[8,3]
=> [[1,2,3,7,8,9,10,11],[4,5,6]]
=> [[1,4],[2,5],[3,6],[7],[8],[9],[10],[11]]
=> ? => ? = 1
[8,2,1]
=> [[1,3,6,7,8,9,10,11],[2,5],[4]]
=> ?
=> ? => ? = 2
[8,1,1,1]
=> [[1,5,6,7,8,9,10,11],[2],[3],[4]]
=> ?
=> ? => ? = 1
[7,4]
=> [[1,2,3,4,9,10,11],[5,6,7,8]]
=> ?
=> ? => ? = 1
[7,3,1]
=> [[1,3,4,8,9,10,11],[2,6,7],[5]]
=> ?
=> ? => ? = 0
[7,2,2]
=> [[1,2,7,8,9,10,11],[3,4],[5,6]]
=> [[1,3,5],[2,4,6],[7],[8],[9],[10],[11]]
=> ? => ? = 2
[7,2,1,1]
=> [[1,4,7,8,9,10,11],[2,6],[3],[5]]
=> ?
=> ? => ? = 1
[7,1,1,1,1]
=> [[1,6,7,8,9,10,11],[2],[3],[4],[5]]
=> ?
=> ? => ? = 0
[6,5]
=> [[1,2,3,4,5,11],[6,7,8,9,10]]
=> [[1,6],[2,7],[3,8],[4,9],[5,10],[11]]
=> ? => ? = 1
[6,4,1]
=> [[1,3,4,5,10,11],[2,7,8,9],[6]]
=> ?
=> ? => ? = 2
[6,3,2]
=> [[1,2,5,9,10,11],[3,4,8],[6,7]]
=> ?
=> ? => ? = 2
[6,3,1,1]
=> [[1,4,5,9,10,11],[2,7,8],[3],[6]]
=> ?
=> ? => ? = 1
[6,2,2,1]
=> [[1,3,8,9,10,11],[2,5],[4,7],[6]]
=> ?
=> ? => ? = 3
[6,2,1,1,1]
=> [[1,5,8,9,10,11],[2,7],[3],[4],[6]]
=> [[1,2,3,4,6],[5,7],[8],[9],[10],[11]]
=> ? => ? = 2
[6,1,1,1,1,1]
=> [[1,7,8,9,10,11],[2],[3],[4],[5],[6]]
=> ?
=> ? => ? = 1
[5,5,1]
=> [[1,3,4,5,6],[2,8,9,10,11],[7]]
=> [[1,2,7],[3,8],[4,9],[5,10],[6,11]]
=> ? => ? = 0
[5,4,2]
=> [[1,2,5,6,11],[3,4,9,10],[7,8]]
=> [[1,3,7],[2,4,8],[5,9],[6,10],[11]]
=> 1011101111 => ? = 2
[5,4,1,1]
=> [[1,4,5,6,11],[2,8,9,10],[3],[7]]
=> [[1,2,3,7],[4,8],[5,9],[6,10],[11]]
=> 0011101111 => ? = 1
[5,3,3]
=> [[1,2,3,10,11],[4,5,6],[7,8,9]]
=> [[1,4,7],[2,5,8],[3,6,9],[10],[11]]
=> 1101101111 => ? = 0
[5,3,2,1]
=> [[1,3,6,10,11],[2,5,9],[4,8],[7]]
=> [[1,2,4,7],[3,5,8],[6,9],[10],[11]]
=> 0101101111 => ? = 1
[5,2,2,2]
=> [[1,2,9,10,11],[3,4],[5,6],[7,8]]
=> [[1,3,5,7],[2,4,6,8],[9],[10],[11]]
=> 1010101111 => ? = 3
[5,2,1,1,1,1]
=> [[1,6,9,10,11],[2,8],[3],[4],[5],[7]]
=> [[1,2,3,4,5,7],[6,8],[9],[10],[11]]
=> ? => ? = 1
[5,1,1,1,1,1,1]
=> [[1,8,9,10,11],[2],[3],[4],[5],[6],[7]]
=> ?
=> ? => ? = 0
[4,4,3]
=> [[1,2,3,7],[4,5,6,11],[8,9,10]]
=> [[1,4,8],[2,5,9],[3,6,10],[7,11]]
=> 1101110111 => ? = 2
[4,4,2,1]
=> [[1,3,6,7],[2,5,10,11],[4,9],[8]]
=> [[1,2,4,8],[3,5,9],[6,10],[7,11]]
=> 0101110111 => ? = 3
[4,3,3,1]
=> [[1,3,4,11],[2,6,7],[5,9,10],[8]]
=> [[1,2,5,8],[3,6,9],[4,7,10],[11]]
=> 0110110111 => ? = 1
[4,3,2,2]
=> [[1,2,7,11],[3,4,10],[5,6],[8,9]]
=> [[1,3,5,8],[2,4,6,9],[7,10],[11]]
=> 1010110111 => ? = 3
[4,3,2,1,1]
=> [[1,4,7,11],[2,6,10],[3,9],[5],[8]]
=> [[1,2,3,5,8],[4,6,9],[7,10],[11]]
=> 0010110111 => ? = 2
[4,3,1,1,1,1]
=> [[1,6,7,11],[2,9,10],[3],[4],[5],[8]]
=> ?
=> ? => ? = 1
[4,2,2,2,1]
=> [[1,3,10,11],[2,5],[4,7],[6,9],[8]]
=> [[1,2,4,6,8],[3,5,7,9],[10],[11]]
=> 0101010111 => ? = 4
[4,2,2,1,1,1]
=> [[1,5,10,11],[2,7],[3,9],[4],[6],[8]]
=> ?
=> ? => ? = 3
[4,2,1,1,1,1,1]
=> [[1,7,10,11],[2,9],[3],[4],[5],[6],[8]]
=> ?
=> ? => ? = 2
[4,1,1,1,1,1,1,1]
=> [[1,9,10,11],[2],[3],[4],[5],[6],[7],[8]]
=> ?
=> ? => ? = 1
[3,3,3,2]
=> [[1,2,5],[3,4,8],[6,7,11],[9,10]]
=> [[1,3,6,9],[2,4,7,10],[5,8,11]]
=> 1011011011 => ? = 1
[3,3,3,1,1]
=> [[1,4,5],[2,7,8],[3,10,11],[6],[9]]
=> [[1,2,3,6,9],[4,7,10],[5,8,11]]
=> 0011011011 => ? = 0
[3,3,2,2,1]
=> [[1,3,8],[2,5,11],[4,7],[6,10],[9]]
=> [[1,2,4,6,9],[3,5,7,10],[8,11]]
=> 0101011011 => ? = 2
[3,3,2,1,1,1]
=> [[1,5,8],[2,7,11],[3,10],[4],[6],[9]]
=> ?
=> ? => ? = 1
[3,3,1,1,1,1,1]
=> [[1,7,8],[2,10,11],[3],[4],[5],[6],[9]]
=> [[1,2,3,4,5,6,9],[7,10],[8,11]]
=> ? => ? = 0
[3,2,2,2,2]
=> [[1,2,11],[3,4],[5,6],[7,8],[9,10]]
=> [[1,3,5,7,9],[2,4,6,8,10],[11]]
=> ? => ? = 4
[3,2,2,2,1,1]
=> [[1,4,11],[2,6],[3,8],[5,10],[7],[9]]
=> ?
=> ? => ? = 3
[3,2,2,1,1,1,1]
=> [[1,6,11],[2,8],[3,10],[4],[5],[7],[9]]
=> ?
=> ? => ? = 2
[3,2,1,1,1,1,1,1]
=> [[1,8,11],[2,10],[3],[4],[5],[6],[7],[9]]
=> ?
=> ? => ? = 1
[3,1,1,1,1,1,1,1,1]
=> [[1,10,11],[2],[3],[4],[5],[6],[7],[8],[9]]
=> ?
=> ? => ? = 0
[2,2,2,2,2,1]
=> [[1,3],[2,5],[4,7],[6,9],[8,11],[10]]
=> [[1,2,4,6,8,10],[3,5,7,9,11]]
=> ? => ? = 5
[2,2,2,2,1,1,1]
=> [[1,5],[2,7],[3,9],[4,11],[6],[8],[10]]
=> ?
=> ? => ? = 4
Description
The number of runs of ones of odd length in a binary word.
Matching statistic: St000237
(load all 3 compositions to match this statistic)
(load all 3 compositions to match this statistic)
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000237: Permutations ⟶ ℤResult quality: 12% ●values known / values provided: 12%●distinct values known / distinct values provided: 100%
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000237: Permutations ⟶ ℤResult quality: 12% ●values known / values provided: 12%●distinct values known / distinct values provided: 100%
Values
[1]
=> [1,0]
=> [1,0]
=> [1] => 0
[2]
=> [1,0,1,0]
=> [1,1,0,0]
=> [2,1] => 1
[1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> [1,2] => 0
[3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> [3,2,1] => 0
[2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> [2,1,3] => 1
[1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> [1,2,3] => 0
[4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> [4,3,2,1] => 1
[3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 0
[2,2]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> [2,3,1] => 2
[2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 1
[1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> [1,2,3,4] => 0
[5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> [5,4,3,2,1] => 0
[4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> [4,3,2,1,5] => 1
[3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> [3,2,4,1] => 1
[3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => 0
[2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> [2,3,1,4] => 2
[2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 1
[1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5] => 0
[6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> [6,5,4,3,2,1] => 1
[5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> [5,4,3,2,1,6] => 0
[4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> [4,3,2,5,1] => 2
[4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> [4,3,2,1,5,6] => 1
[3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> [4,2,3,1] => 0
[3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> [3,2,4,1,5] => 1
[3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> [3,2,1,4,5,6] => 0
[2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> [2,3,4,1] => 3
[2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> [2,3,1,4,5] => 2
[2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,3,4,5,6] => 1
[1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6] => 0
[7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> [7,6,5,4,3,2,1] => 0
[6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> [6,5,4,3,2,1,7] => 1
[5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> [5,4,3,2,6,1] => 1
[5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> [5,4,3,2,1,6,7] => 0
[4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> [5,3,2,4,1] => 1
[4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> [4,3,2,5,1,6] => 2
[4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> [4,3,2,1,5,6,7] => 1
[3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> [4,2,3,1,5] => 0
[3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> [3,2,4,5,1] => 2
[3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> [3,2,4,1,5,6] => 1
[3,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0]
=> [3,2,1,4,5,6,7] => 0
[2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> [2,3,4,1,5] => 3
[2,2,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6] => 2
[2,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> [2,1,3,4,5,6,7] => 1
[1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6,7] => 0
[8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> [8,7,6,5,4,3,2,1] => 1
[7,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [7,6,5,4,3,2,1,8] => 0
[6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> [6,5,4,3,2,7,1] => ? = 2
[6,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0]
=> [6,5,4,3,2,1,7,8] => 1
[5,3]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> [6,4,3,2,5,1] => 0
[5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0,1,0]
=> [5,4,3,2,6,1,7] => 1
[5,1,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0]
=> [5,4,3,2,1,6,7,8] => 0
[4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0,1,0]
=> [4,3,2,5,1,6,7] => ? = 2
[3,2,1,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0,1,0]
=> [3,2,4,1,5,6,7] => ? = 1
[6,3]
=> [1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,1,0,0,0]
=> [7,5,4,3,2,6,1] => ? = 1
[6,2,1]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0,1,0]
=> [6,5,4,3,2,7,1,8] => ? = 2
[5,2,2]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,1,0,0]
=> [5,4,3,2,6,7,1] => ? = 2
[5,2,1,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0,1,0,1,0]
=> [5,4,3,2,6,1,7,8] => ? = 1
[4,3,1,1]
=> [1,0,1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0,1,0]
=> [5,3,2,4,1,6,7] => ? = 1
[4,2,2,1]
=> [1,0,1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0,1,0]
=> [4,3,2,5,6,1,7] => ? = 3
[4,2,1,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0,1,0,1,0]
=> [4,3,2,5,1,6,7,8] => ? = 2
[3,3,1,1,1]
=> [1,1,1,0,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0,1,0,1,0]
=> [4,2,3,1,5,6,7] => ? = 0
[3,2,2,1,1]
=> [1,0,1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0,1,0]
=> [3,2,4,5,1,6,7] => ? = 2
[3,2,1,1,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0,1,0,1,0]
=> [3,2,4,1,5,6,7,8] => ? = 1
[2,2,1,1,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6,7,8] => ? = 2
[8,2]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0,0]
=> [8,7,6,5,4,3,2,9,1] => ? = 2
[7,3]
=> [1,0,1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,1,0,0,0]
=> [8,6,5,4,3,2,7,1] => ? = 0
[7,2,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,1,0,0,1,0]
=> [7,6,5,4,3,2,8,1,9] => ? = 1
[6,4]
=> [1,0,1,0,1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,1,1,0,0,0,1,0,0,0,0]
=> [7,5,4,3,6,2,1] => ? = 2
[6,3,1]
=> [1,0,1,0,1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,1,0,0,0,1,0]
=> [7,5,4,3,2,6,1,8] => ? = 1
[6,2,2]
=> [1,0,1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,1,0,0]
=> [6,5,4,3,2,7,8,1] => ? = 3
[6,2,1,1]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0,1,0,1,0]
=> [6,5,4,3,2,7,1,8,9] => ? = 2
[5,3,2]
=> [1,0,1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,1,0,0]
=> [6,4,3,2,5,7,1] => ? = 1
[5,3,1,1]
=> [1,0,1,0,1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0,1,0,1,0]
=> [6,4,3,2,5,1,7,8] => ? = 0
[5,2,2,1]
=> [1,0,1,0,1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,1,0,0,1,0]
=> [5,4,3,2,6,7,1,8] => ? = 2
[5,2,1,1,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0,1,0,1,0,1,0]
=> [5,4,3,2,6,1,7,8,9] => ? = 1
[4,4,1,1]
=> [1,1,1,0,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,1,0,0,0,0,1,0,1,0]
=> [5,3,4,2,1,6,7] => ? = 2
[4,3,2,1]
=> [1,0,1,1,1,0,1,1,0,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,1,0,0,1,0]
=> [5,3,2,4,6,1,7] => ? = 2
[4,3,1,1,1]
=> [1,0,1,1,1,0,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0,1,0,1,0]
=> [5,3,2,4,1,6,7,8] => ? = 1
[4,2,2,1,1]
=> [1,0,1,0,1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0,1,0,1,0]
=> [4,3,2,5,6,1,7,8] => ? = 3
[4,2,1,1,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0,1,0,1,0,1,0]
=> [4,3,2,5,1,6,7,8,9] => ? = 2
[3,3,2,1,1]
=> [1,1,1,0,1,1,0,0,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,1,0,0,1,0,1,0]
=> [4,2,3,5,1,6,7] => ? = 1
[3,3,1,1,1,1]
=> [1,1,1,0,1,0,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0,1,0,1,0,1,0]
=> [4,2,3,1,5,6,7,8] => ? = 0
[3,2,2,2,1]
=> [1,0,1,1,1,1,0,1,0,0,0,1,0,0]
=> [1,1,1,0,0,1,0,1,0,1,0,0,1,0]
=> [3,2,4,5,6,1,7] => ? = 3
[3,2,2,1,1,1]
=> [1,0,1,1,1,1,0,0,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0,1,0,1,0]
=> [3,2,4,5,1,6,7,8] => ? = 2
[3,2,1,1,1,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> [3,2,4,1,5,6,7,8,9] => ? = 1
[2,2,2,1,1,1,1]
=> [1,1,1,1,0,0,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> [2,3,4,1,5,6,7,8] => ? = 3
[2,2,1,1,1,1,1,1]
=> [1,1,1,0,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,0,1,0,1,0,1,0]
=> [2,3,1,4,5,6,7,8,9] => ? = 2
[11]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0]
=> [11,10,9,8,7,6,5,4,3,2,1] => ? = 0
[9,2]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0,0]
=> [9,8,7,6,5,4,3,2,10,1] => ? = 1
[9,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,1,0,1,0]
=> [9,8,7,6,5,4,3,2,1,10,11] => ? = 0
[8,3]
=> [1,0,1,0,1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,1,0,0,0]
=> [9,7,6,5,4,3,2,8,1] => ? = 1
[8,2,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0,0,1,0]
=> [8,7,6,5,4,3,2,9,1,10] => ? = 2
[8,1,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0,1,0,1,0]
=> ? => ? = 1
[7,4]
=> [1,0,1,0,1,0,1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,1,0,0,0,0]
=> [8,6,5,4,3,7,2,1] => ? = 1
[7,3,1]
=> [1,0,1,0,1,0,1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,1,0,0,0,1,0]
=> ? => ? = 0
[7,2,2]
=> [1,0,1,0,1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0,0]
=> [7,6,5,4,3,2,8,9,1] => ? = 2
[7,2,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,1,0,0,1,0,1,0]
=> ? => ? = 1
[7,1,1,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0,1,0,1,0,1,0]
=> ? => ? = 0
[6,5]
=> [1,0,1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,1,1,1,1,0,0,1,0,0,0,0,0]
=> [7,6,4,3,5,2,1] => ? = 1
[6,3,2]
=> [1,0,1,0,1,0,1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,1,0,0,1,0,0]
=> [7,5,4,3,2,6,8,1] => ? = 2
Description
The number of small exceedances.
This is the number of indices $i$ such that $\pi_i=i+1$.
Matching statistic: St001465
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00042: Integer partitions —initial tableau⟶ Standard tableaux
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
Mp00064: Permutations —reverse⟶ Permutations
St001465: Permutations ⟶ ℤResult quality: 7% ●values known / values provided: 7%●distinct values known / distinct values provided: 78%
Mp00081: Standard tableaux —reading word permutation⟶ Permutations
Mp00064: Permutations —reverse⟶ Permutations
St001465: Permutations ⟶ ℤResult quality: 7% ●values known / values provided: 7%●distinct values known / distinct values provided: 78%
Values
[1]
=> [[1]]
=> [1] => [1] => 0
[2]
=> [[1,2]]
=> [1,2] => [2,1] => 1
[1,1]
=> [[1],[2]]
=> [2,1] => [1,2] => 0
[3]
=> [[1,2,3]]
=> [1,2,3] => [3,2,1] => 0
[2,1]
=> [[1,2],[3]]
=> [3,1,2] => [2,1,3] => 1
[1,1,1]
=> [[1],[2],[3]]
=> [3,2,1] => [1,2,3] => 0
[4]
=> [[1,2,3,4]]
=> [1,2,3,4] => [4,3,2,1] => 1
[3,1]
=> [[1,2,3],[4]]
=> [4,1,2,3] => [3,2,1,4] => 0
[2,2]
=> [[1,2],[3,4]]
=> [3,4,1,2] => [2,1,4,3] => 2
[2,1,1]
=> [[1,2],[3],[4]]
=> [4,3,1,2] => [2,1,3,4] => 1
[1,1,1,1]
=> [[1],[2],[3],[4]]
=> [4,3,2,1] => [1,2,3,4] => 0
[5]
=> [[1,2,3,4,5]]
=> [1,2,3,4,5] => [5,4,3,2,1] => 0
[4,1]
=> [[1,2,3,4],[5]]
=> [5,1,2,3,4] => [4,3,2,1,5] => 1
[3,2]
=> [[1,2,3],[4,5]]
=> [4,5,1,2,3] => [3,2,1,5,4] => 1
[3,1,1]
=> [[1,2,3],[4],[5]]
=> [5,4,1,2,3] => [3,2,1,4,5] => 0
[2,2,1]
=> [[1,2],[3,4],[5]]
=> [5,3,4,1,2] => [2,1,4,3,5] => 2
[2,1,1,1]
=> [[1,2],[3],[4],[5]]
=> [5,4,3,1,2] => [2,1,3,4,5] => 1
[1,1,1,1,1]
=> [[1],[2],[3],[4],[5]]
=> [5,4,3,2,1] => [1,2,3,4,5] => 0
[6]
=> [[1,2,3,4,5,6]]
=> [1,2,3,4,5,6] => [6,5,4,3,2,1] => 1
[5,1]
=> [[1,2,3,4,5],[6]]
=> [6,1,2,3,4,5] => [5,4,3,2,1,6] => 0
[4,2]
=> [[1,2,3,4],[5,6]]
=> [5,6,1,2,3,4] => [4,3,2,1,6,5] => 2
[4,1,1]
=> [[1,2,3,4],[5],[6]]
=> [6,5,1,2,3,4] => [4,3,2,1,5,6] => 1
[3,3]
=> [[1,2,3],[4,5,6]]
=> [4,5,6,1,2,3] => [3,2,1,6,5,4] => 0
[3,2,1]
=> [[1,2,3],[4,5],[6]]
=> [6,4,5,1,2,3] => [3,2,1,5,4,6] => 1
[3,1,1,1]
=> [[1,2,3],[4],[5],[6]]
=> [6,5,4,1,2,3] => [3,2,1,4,5,6] => 0
[2,2,2]
=> [[1,2],[3,4],[5,6]]
=> [5,6,3,4,1,2] => [2,1,4,3,6,5] => 3
[2,2,1,1]
=> [[1,2],[3,4],[5],[6]]
=> [6,5,3,4,1,2] => [2,1,4,3,5,6] => 2
[2,1,1,1,1]
=> [[1,2],[3],[4],[5],[6]]
=> [6,5,4,3,1,2] => [2,1,3,4,5,6] => 1
[1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6]]
=> [6,5,4,3,2,1] => [1,2,3,4,5,6] => 0
[7]
=> [[1,2,3,4,5,6,7]]
=> [1,2,3,4,5,6,7] => [7,6,5,4,3,2,1] => 0
[6,1]
=> [[1,2,3,4,5,6],[7]]
=> [7,1,2,3,4,5,6] => [6,5,4,3,2,1,7] => 1
[5,2]
=> [[1,2,3,4,5],[6,7]]
=> [6,7,1,2,3,4,5] => [5,4,3,2,1,7,6] => 1
[5,1,1]
=> [[1,2,3,4,5],[6],[7]]
=> [7,6,1,2,3,4,5] => [5,4,3,2,1,6,7] => 0
[4,3]
=> [[1,2,3,4],[5,6,7]]
=> [5,6,7,1,2,3,4] => [4,3,2,1,7,6,5] => ? = 1
[4,2,1]
=> [[1,2,3,4],[5,6],[7]]
=> [7,5,6,1,2,3,4] => [4,3,2,1,6,5,7] => ? = 2
[4,1,1,1]
=> [[1,2,3,4],[5],[6],[7]]
=> [7,6,5,1,2,3,4] => [4,3,2,1,5,6,7] => 1
[3,3,1]
=> [[1,2,3],[4,5,6],[7]]
=> [7,4,5,6,1,2,3] => [3,2,1,6,5,4,7] => ? = 0
[3,2,2]
=> [[1,2,3],[4,5],[6,7]]
=> [6,7,4,5,1,2,3] => [3,2,1,5,4,7,6] => ? = 2
[3,2,1,1]
=> [[1,2,3],[4,5],[6],[7]]
=> [7,6,4,5,1,2,3] => [3,2,1,5,4,6,7] => ? = 1
[3,1,1,1,1]
=> [[1,2,3],[4],[5],[6],[7]]
=> [7,6,5,4,1,2,3] => [3,2,1,4,5,6,7] => 0
[2,2,2,1]
=> [[1,2],[3,4],[5,6],[7]]
=> [7,5,6,3,4,1,2] => [2,1,4,3,6,5,7] => ? = 3
[2,2,1,1,1]
=> [[1,2],[3,4],[5],[6],[7]]
=> [7,6,5,3,4,1,2] => [2,1,4,3,5,6,7] => ? = 2
[2,1,1,1,1,1]
=> [[1,2],[3],[4],[5],[6],[7]]
=> [7,6,5,4,3,1,2] => [2,1,3,4,5,6,7] => 1
[1,1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6],[7]]
=> [7,6,5,4,3,2,1] => [1,2,3,4,5,6,7] => 0
[8]
=> [[1,2,3,4,5,6,7,8]]
=> [1,2,3,4,5,6,7,8] => [8,7,6,5,4,3,2,1] => 1
[7,1]
=> [[1,2,3,4,5,6,7],[8]]
=> [8,1,2,3,4,5,6,7] => [7,6,5,4,3,2,1,8] => 0
[6,2]
=> [[1,2,3,4,5,6],[7,8]]
=> [7,8,1,2,3,4,5,6] => [6,5,4,3,2,1,8,7] => 2
[6,1,1]
=> [[1,2,3,4,5,6],[7],[8]]
=> [8,7,1,2,3,4,5,6] => [6,5,4,3,2,1,7,8] => 1
[5,3]
=> [[1,2,3,4,5],[6,7,8]]
=> [6,7,8,1,2,3,4,5] => [5,4,3,2,1,8,7,6] => 0
[5,2,1]
=> [[1,2,3,4,5],[6,7],[8]]
=> [8,6,7,1,2,3,4,5] => [5,4,3,2,1,7,6,8] => ? = 1
[5,1,1,1]
=> [[1,2,3,4,5],[6],[7],[8]]
=> [8,7,6,1,2,3,4,5] => [5,4,3,2,1,6,7,8] => 0
[4,4]
=> [[1,2,3,4],[5,6,7,8]]
=> [5,6,7,8,1,2,3,4] => [4,3,2,1,8,7,6,5] => 2
[4,3,1]
=> [[1,2,3,4],[5,6,7],[8]]
=> [8,5,6,7,1,2,3,4] => [4,3,2,1,7,6,5,8] => ? = 1
[4,2,2]
=> [[1,2,3,4],[5,6],[7,8]]
=> [7,8,5,6,1,2,3,4] => [4,3,2,1,6,5,8,7] => 3
[4,2,1,1]
=> [[1,2,3,4],[5,6],[7],[8]]
=> [8,7,5,6,1,2,3,4] => [4,3,2,1,6,5,7,8] => ? = 2
[4,1,1,1,1]
=> [[1,2,3,4],[5],[6],[7],[8]]
=> [8,7,6,5,1,2,3,4] => [4,3,2,1,5,6,7,8] => 1
[3,3,2]
=> [[1,2,3],[4,5,6],[7,8]]
=> [7,8,4,5,6,1,2,3] => [3,2,1,6,5,4,8,7] => ? = 1
[3,3,1,1]
=> [[1,2,3],[4,5,6],[7],[8]]
=> [8,7,4,5,6,1,2,3] => [3,2,1,6,5,4,7,8] => ? = 0
[3,2,2,1]
=> [[1,2,3],[4,5],[6,7],[8]]
=> [8,6,7,4,5,1,2,3] => [3,2,1,5,4,7,6,8] => ? = 2
[3,2,1,1,1]
=> [[1,2,3],[4,5],[6],[7],[8]]
=> [8,7,6,4,5,1,2,3] => [3,2,1,5,4,6,7,8] => ? = 1
[3,1,1,1,1,1]
=> [[1,2,3],[4],[5],[6],[7],[8]]
=> [8,7,6,5,4,1,2,3] => [3,2,1,4,5,6,7,8] => 0
[2,2,2,2]
=> [[1,2],[3,4],[5,6],[7,8]]
=> [7,8,5,6,3,4,1,2] => [2,1,4,3,6,5,8,7] => 4
[2,2,2,1,1]
=> [[1,2],[3,4],[5,6],[7],[8]]
=> [8,7,5,6,3,4,1,2] => [2,1,4,3,6,5,7,8] => ? = 3
[2,2,1,1,1,1]
=> [[1,2],[3,4],[5],[6],[7],[8]]
=> [8,7,6,5,3,4,1,2] => [2,1,4,3,5,6,7,8] => ? = 2
[2,1,1,1,1,1,1]
=> [[1,2],[3],[4],[5],[6],[7],[8]]
=> [8,7,6,5,4,3,1,2] => [2,1,3,4,5,6,7,8] => 1
[1,1,1,1,1,1,1,1]
=> [[1],[2],[3],[4],[5],[6],[7],[8]]
=> [8,7,6,5,4,3,2,1] => [1,2,3,4,5,6,7,8] => 0
[7,2]
=> [[1,2,3,4,5,6,7],[8,9]]
=> [8,9,1,2,3,4,5,6,7] => [7,6,5,4,3,2,1,9,8] => ? = 1
[6,3]
=> [[1,2,3,4,5,6],[7,8,9]]
=> [7,8,9,1,2,3,4,5,6] => [6,5,4,3,2,1,9,8,7] => ? = 1
[6,2,1]
=> [[1,2,3,4,5,6],[7,8],[9]]
=> [9,7,8,1,2,3,4,5,6] => [6,5,4,3,2,1,8,7,9] => ? = 2
[5,4]
=> [[1,2,3,4,5],[6,7,8,9]]
=> [6,7,8,9,1,2,3,4,5] => [5,4,3,2,1,9,8,7,6] => ? = 1
[5,3,1]
=> [[1,2,3,4,5],[6,7,8],[9]]
=> [9,6,7,8,1,2,3,4,5] => [5,4,3,2,1,8,7,6,9] => ? = 0
[5,2,2]
=> [[1,2,3,4,5],[6,7],[8,9]]
=> [8,9,6,7,1,2,3,4,5] => [5,4,3,2,1,7,6,9,8] => ? = 2
[5,2,1,1]
=> [[1,2,3,4,5],[6,7],[8],[9]]
=> [9,8,6,7,1,2,3,4,5] => [5,4,3,2,1,7,6,8,9] => ? = 1
[4,4,1]
=> [[1,2,3,4],[5,6,7,8],[9]]
=> [9,5,6,7,8,1,2,3,4] => [4,3,2,1,8,7,6,5,9] => ? = 2
[4,3,2]
=> [[1,2,3,4],[5,6,7],[8,9]]
=> [8,9,5,6,7,1,2,3,4] => [4,3,2,1,7,6,5,9,8] => ? = 2
[4,3,1,1]
=> [[1,2,3,4],[5,6,7],[8],[9]]
=> [9,8,5,6,7,1,2,3,4] => [4,3,2,1,7,6,5,8,9] => ? = 1
[4,2,2,1]
=> [[1,2,3,4],[5,6],[7,8],[9]]
=> [9,7,8,5,6,1,2,3,4] => [4,3,2,1,6,5,8,7,9] => ? = 3
[4,2,1,1,1]
=> [[1,2,3,4],[5,6],[7],[8],[9]]
=> [9,8,7,5,6,1,2,3,4] => [4,3,2,1,6,5,7,8,9] => ? = 2
[3,3,3]
=> [[1,2,3],[4,5,6],[7,8,9]]
=> [7,8,9,4,5,6,1,2,3] => [3,2,1,6,5,4,9,8,7] => ? = 0
[3,3,2,1]
=> [[1,2,3],[4,5,6],[7,8],[9]]
=> [9,7,8,4,5,6,1,2,3] => [3,2,1,6,5,4,8,7,9] => ? = 1
[3,3,1,1,1]
=> [[1,2,3],[4,5,6],[7],[8],[9]]
=> [9,8,7,4,5,6,1,2,3] => [3,2,1,6,5,4,7,8,9] => ? = 0
[3,2,2,2]
=> [[1,2,3],[4,5],[6,7],[8,9]]
=> [8,9,6,7,4,5,1,2,3] => [3,2,1,5,4,7,6,9,8] => ? = 3
[3,2,2,1,1]
=> [[1,2,3],[4,5],[6,7],[8],[9]]
=> [9,8,6,7,4,5,1,2,3] => [3,2,1,5,4,7,6,8,9] => ? = 2
[3,2,1,1,1,1]
=> [[1,2,3],[4,5],[6],[7],[8],[9]]
=> [9,8,7,6,4,5,1,2,3] => [3,2,1,5,4,6,7,8,9] => ? = 1
[2,2,2,2,1]
=> [[1,2],[3,4],[5,6],[7,8],[9]]
=> [9,7,8,5,6,3,4,1,2] => [2,1,4,3,6,5,8,7,9] => ? = 4
[2,2,2,1,1,1]
=> [[1,2],[3,4],[5,6],[7],[8],[9]]
=> [9,8,7,5,6,3,4,1,2] => [2,1,4,3,6,5,7,8,9] => ? = 3
[2,2,1,1,1,1,1]
=> [[1,2],[3,4],[5],[6],[7],[8],[9]]
=> [9,8,7,6,5,3,4,1,2] => [2,1,4,3,5,6,7,8,9] => ? = 2
[7,3]
=> [[1,2,3,4,5,6,7],[8,9,10]]
=> [8,9,10,1,2,3,4,5,6,7] => [7,6,5,4,3,2,1,10,9,8] => ? = 0
[7,2,1]
=> [[1,2,3,4,5,6,7],[8,9],[10]]
=> [10,8,9,1,2,3,4,5,6,7] => [7,6,5,4,3,2,1,9,8,10] => ? = 1
[6,3,1]
=> [[1,2,3,4,5,6],[7,8,9],[10]]
=> [10,7,8,9,1,2,3,4,5,6] => [6,5,4,3,2,1,9,8,7,10] => ? = 1
[6,2,1,1]
=> [[1,2,3,4,5,6],[7,8],[9],[10]]
=> [10,9,7,8,1,2,3,4,5,6] => [6,5,4,3,2,1,8,7,9,10] => ? = 2
[5,5]
=> [[1,2,3,4,5],[6,7,8,9,10]]
=> [6,7,8,9,10,1,2,3,4,5] => [5,4,3,2,1,10,9,8,7,6] => ? = 0
[5,4,1]
=> [[1,2,3,4,5],[6,7,8,9],[10]]
=> [10,6,7,8,9,1,2,3,4,5] => [5,4,3,2,1,9,8,7,6,10] => ? = 1
[5,3,2]
=> [[1,2,3,4,5],[6,7,8],[9,10]]
=> [9,10,6,7,8,1,2,3,4,5] => [5,4,3,2,1,8,7,6,10,9] => ? = 1
[5,3,1,1]
=> [[1,2,3,4,5],[6,7,8],[9],[10]]
=> [10,9,6,7,8,1,2,3,4,5] => [5,4,3,2,1,8,7,6,9,10] => ? = 0
[5,2,2,1]
=> [[1,2,3,4,5],[6,7],[8,9],[10]]
=> [10,8,9,6,7,1,2,3,4,5] => [5,4,3,2,1,7,6,9,8,10] => ? = 2
[5,2,1,1,1]
=> [[1,2,3,4,5],[6,7],[8],[9],[10]]
=> [10,9,8,6,7,1,2,3,4,5] => [5,4,3,2,1,7,6,8,9,10] => ? = 1
[4,4,1,1]
=> [[1,2,3,4],[5,6,7,8],[9],[10]]
=> [10,9,5,6,7,8,1,2,3,4] => [4,3,2,1,8,7,6,5,9,10] => ? = 2
[4,3,3]
=> [[1,2,3,4],[5,6,7],[8,9,10]]
=> [8,9,10,5,6,7,1,2,3,4] => [4,3,2,1,7,6,5,10,9,8] => ? = 1
[4,3,2,1]
=> [[1,2,3,4],[5,6,7],[8,9],[10]]
=> [10,8,9,5,6,7,1,2,3,4] => [4,3,2,1,7,6,5,9,8,10] => ? = 2
Description
The number of adjacent transpositions in the cycle decomposition of a permutation.
Matching statistic: St001232
Mp00044: Integer partitions —conjugate⟶ Integer partitions
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001232: Dyck paths ⟶ ℤResult quality: 3% ●values known / values provided: 3%●distinct values known / distinct values provided: 78%
Mp00230: Integer partitions —parallelogram polyomino⟶ Dyck paths
Mp00227: Dyck paths —Delest-Viennot-inverse⟶ Dyck paths
St001232: Dyck paths ⟶ ℤResult quality: 3% ●values known / values provided: 3%●distinct values known / distinct values provided: 78%
Values
[1]
=> [1]
=> [1,0]
=> [1,0]
=> 0
[2]
=> [1,1]
=> [1,1,0,0]
=> [1,0,1,0]
=> 1
[1,1]
=> [2]
=> [1,0,1,0]
=> [1,1,0,0]
=> 0
[3]
=> [1,1,1]
=> [1,1,0,1,0,0]
=> [1,0,1,0,1,0]
=> ? = 0
[2,1]
=> [2,1]
=> [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
[1,1,1]
=> [3]
=> [1,0,1,0,1,0]
=> [1,1,1,0,0,0]
=> 0
[4]
=> [1,1,1,1]
=> [1,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0]
=> ? = 1
[3,1]
=> [2,1,1]
=> [1,0,1,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0]
=> ? = 0
[2,2]
=> [2,2]
=> [1,1,1,0,0,0]
=> [1,1,0,1,0,0]
=> 2
[2,1,1]
=> [3,1]
=> [1,0,1,0,1,1,0,0]
=> [1,1,1,0,0,0,1,0]
=> 1
[1,1,1,1]
=> [4]
=> [1,0,1,0,1,0,1,0]
=> [1,1,1,1,0,0,0,0]
=> 0
[5]
=> [1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0]
=> ? = 0
[4,1]
=> [2,1,1,1]
=> [1,0,1,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> ? = 1
[3,2]
=> [2,2,1]
=> [1,1,1,0,0,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> ? = 1
[3,1,1]
=> [3,1,1]
=> [1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0]
=> ? = 0
[2,2,1]
=> [3,2]
=> [1,0,1,1,1,0,0,0]
=> [1,1,1,0,0,1,0,0]
=> 2
[2,1,1,1]
=> [4,1]
=> [1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0]
=> 1
[1,1,1,1,1]
=> [5]
=> [1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,0,0,0,0]
=> 0
[6]
=> [1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1
[5,1]
=> [2,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> ? = 0
[4,2]
=> [2,2,1,1]
=> [1,1,1,0,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> ? = 2
[4,1,1]
=> [3,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0]
=> ? = 1
[3,3]
=> [2,2,2]
=> [1,1,1,1,0,0,0,0]
=> [1,1,0,1,0,1,0,0]
=> ? = 0
[3,2,1]
=> [3,2,1]
=> [1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0]
=> ? = 1
[3,1,1,1]
=> [4,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0]
=> ? = 0
[2,2,2]
=> [3,3]
=> [1,1,1,0,1,0,0,0]
=> [1,1,1,0,1,0,0,0]
=> 3
[2,2,1,1]
=> [4,2]
=> [1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,0,0,0,1,0,0]
=> 2
[2,1,1,1,1]
=> [5,1]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0]
=> 1
[1,1,1,1,1,1]
=> [6]
=> [1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0]
=> 0
[7]
=> [1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 0
[6,1]
=> [2,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1
[5,2]
=> [2,2,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0]
=> ? = 1
[5,1,1]
=> [3,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0]
=> ? = 0
[4,3]
=> [2,2,2,1]
=> [1,1,1,1,0,0,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> ? = 1
[4,2,1]
=> [3,2,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0]
=> ? = 2
[4,1,1,1]
=> [4,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0]
=> ? = 1
[3,3,1]
=> [3,2,2]
=> [1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,0,0,1,0,1,0,0]
=> ? = 0
[3,2,2]
=> [3,3,1]
=> [1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0]
=> ? = 2
[3,2,1,1]
=> [4,2,1]
=> [1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0]
=> ? = 1
[3,1,1,1,1]
=> [5,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0]
=> ? = 0
[2,2,2,1]
=> [4,3]
=> [1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,0,0,1,0,0,0]
=> 3
[2,2,1,1,1]
=> [5,2]
=> [1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0]
=> 2
[2,1,1,1,1,1]
=> [6,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0]
=> 1
[1,1,1,1,1,1,1]
=> [7]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> 0
[8]
=> [1,1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1
[7,1]
=> [2,1,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 0
[6,2]
=> [2,2,1,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0]
=> ? = 2
[6,1,1]
=> [3,1,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1
[5,3]
=> [2,2,2,1,1]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0]
=> ? = 0
[5,2,1]
=> [3,2,1,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0,1,0]
=> ? = 1
[5,1,1,1]
=> [4,1,1,1,1]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0]
=> ? = 0
[4,4]
=> [2,2,2,2]
=> [1,1,1,1,0,1,0,0,0,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> ? = 2
[4,3,1]
=> [3,2,2,1]
=> [1,0,1,1,1,1,0,0,0,1,0,0]
=> [1,1,1,0,0,1,0,1,0,0,1,0]
=> ? = 1
[4,2,2]
=> [3,3,1,1]
=> [1,1,1,0,1,0,0,1,0,1,0,0]
=> [1,1,1,0,1,0,0,0,1,0,1,0]
=> ? = 3
[4,2,1,1]
=> [4,2,1,1]
=> [1,0,1,0,1,1,1,0,0,1,0,1,0,0]
=> [1,1,1,1,0,0,0,1,0,0,1,0,1,0]
=> ? = 2
[4,1,1,1,1]
=> [5,1,1,1]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0]
=> ? = 1
[3,3,2]
=> [3,3,2]
=> [1,1,1,0,1,1,0,0,0,0]
=> [1,1,1,0,1,0,0,1,0,0]
=> ? = 1
[3,3,1,1]
=> [4,2,2]
=> [1,0,1,0,1,1,1,1,0,0,0,0]
=> [1,1,1,1,0,0,0,1,0,1,0,0]
=> ? = 0
[3,2,2,1]
=> [4,3,1]
=> [1,0,1,1,1,0,1,0,0,1,0,0]
=> [1,1,1,1,0,0,1,0,0,0,1,0]
=> ? = 2
[3,2,1,1,1]
=> [5,2,1]
=> [1,0,1,0,1,0,1,1,1,0,0,1,0,0]
=> [1,1,1,1,1,0,0,0,0,1,0,0,1,0]
=> ? = 1
[3,1,1,1,1,1]
=> [6,1,1]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0]
=> ? = 0
[2,2,2,2]
=> [4,4]
=> [1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,0,1,0,0,0,0]
=> 4
[2,2,2,1,1]
=> [5,3]
=> [1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,1,0,0,0,1,0,0,0]
=> 3
[2,2,1,1,1,1]
=> [6,2]
=> [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,0,1,0,0]
=> 2
[2,1,1,1,1,1,1]
=> [7,1]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> ? = 1
[1,1,1,1,1,1,1,1]
=> [8]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> ? = 0
[9]
=> [1,1,1,1,1,1,1,1,1]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 0
[8,1]
=> [2,1,1,1,1,1,1,1]
=> [1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1
[7,2]
=> [2,2,1,1,1,1,1]
=> [1,1,1,0,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1
[7,1,1]
=> [3,1,1,1,1,1,1]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 0
[6,3]
=> [2,2,2,1,1,1]
=> [1,1,1,1,0,0,0,1,0,1,0,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0,1,0,1,0]
=> ? = 1
[6,2,1]
=> [3,2,1,1,1,1]
=> [1,0,1,1,1,0,0,1,0,1,0,1,0,1,0,0]
=> [1,1,1,0,0,1,0,0,1,0,1,0,1,0,1,0]
=> ? = 2
[2,2,2,2,1]
=> [5,4]
=> [1,0,1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,1,0,0,1,0,0,0,0]
=> 4
[2,2,2,1,1,1]
=> [6,3]
=> [1,0,1,0,1,0,1,1,1,0,1,0,0,0]
=> [1,1,1,1,1,1,0,0,0,0,1,0,0,0]
=> 3
[2,2,2,2,2]
=> [5,5]
=> [1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,1,1,1,0,1,0,0,0,0,0]
=> 5
[2,2,2,2,1,1]
=> [6,4]
=> [1,0,1,0,1,1,1,0,1,0,1,0,0,0]
=> [1,1,1,1,1,1,0,0,0,1,0,0,0,0]
=> 4
[2,2,2,2,2,1]
=> [6,5]
=> [1,0,1,1,1,0,1,0,1,0,1,0,0,0]
=> [1,1,1,1,1,1,0,0,1,0,0,0,0,0]
=> 5
[2,2,2,2,2,2]
=> [6,6]
=> [1,1,1,0,1,0,1,0,1,0,1,0,0,0]
=> [1,1,1,1,1,1,0,1,0,0,0,0,0,0]
=> 6
Description
The number of indecomposable modules with projective dimension 2 for Nakayama algebras with global dimension at most 2.
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!