Your data matches 52 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000382
(load all 2 compositions to match this statistic)
Mapping
Mp00178: Binary words —to composition⟶ Integer compositions
St000382: Integer compositions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
0 => [2] => 2
1 => [1,1] => 1
00 => [3] => 3
01 => [2,1] => 2
10 => [1,2] => 1
11 => [1,1,1] => 1
000 => [4] => 4
001 => [3,1] => 3
010 => [2,2] => 2
011 => [2,1,1] => 2
100 => [1,3] => 1
101 => [1,2,1] => 1
110 => [1,1,2] => 1
111 => [1,1,1,1] => 1
0000 => [5] => 5
0001 => [4,1] => 4
0010 => [3,2] => 3
0011 => [3,1,1] => 3
0100 => [2,3] => 2
0101 => [2,2,1] => 2
0110 => [2,1,2] => 2
0111 => [2,1,1,1] => 2
1000 => [1,4] => 1
1001 => [1,3,1] => 1
1010 => [1,2,2] => 1
1011 => [1,2,1,1] => 1
1100 => [1,1,3] => 1
1101 => [1,1,2,1] => 1
1110 => [1,1,1,2] => 1
1111 => [1,1,1,1,1] => 1
00000 => [6] => 6
00001 => [5,1] => 5
00010 => [4,2] => 4
00011 => [4,1,1] => 4
00100 => [3,3] => 3
00101 => [3,2,1] => 3
00110 => [3,1,2] => 3
00111 => [3,1,1,1] => 3
01000 => [2,4] => 2
01001 => [2,3,1] => 2
01010 => [2,2,2] => 2
01011 => [2,2,1,1] => 2
01100 => [2,1,3] => 2
01101 => [2,1,2,1] => 2
01110 => [2,1,1,2] => 2
01111 => [2,1,1,1,1] => 2
10000 => [1,5] => 1
10001 => [1,4,1] => 1
10010 => [1,3,2] => 1
10011 => [1,3,1,1] => 1
Description
The first part of an integer composition.
Matching statistic: St000054
(load all 2 compositions to match this statistic)
Mapping
Mp00178: Binary words —to composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00119: Dyck paths —to 321-avoiding permutation (Krattenthaler)⟶ Permutations
St000054: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
0 => [2] => [1,1,0,0]
 => [2,1] => 2
1 => [1,1] => [1,0,1,0]
 => [1,2] => 1
00 => [3] => [1,1,1,0,0,0]
 => [3,1,2] => 3
01 => [2,1] => [1,1,0,0,1,0]
 => [2,1,3] => 2
10 => [1,2] => [1,0,1,1,0,0]
 => [1,3,2] => 1
11 => [1,1,1] => [1,0,1,0,1,0]
 => [1,2,3] => 1
000 => [4] => [1,1,1,1,0,0,0,0]
 => [4,1,2,3] => 4
001 => [3,1] => [1,1,1,0,0,0,1,0]
 => [3,1,2,4] => 3
010 => [2,2] => [1,1,0,0,1,1,0,0]
 => [2,1,4,3] => 2
011 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => [2,1,3,4] => 2
100 => [1,3] => [1,0,1,1,1,0,0,0]
 => [1,4,2,3] => 1
101 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => [1,3,2,4] => 1
110 => [1,1,2] => [1,0,1,0,1,1,0,0]
 => [1,2,4,3] => 1
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => [1,2,3,4] => 1
0000 => [5] => [1,1,1,1,1,0,0,0,0,0]
 => [5,1,2,3,4] => 5
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => [4,1,2,3,5] => 4
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0]
 => [3,1,2,5,4] => 3
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => [3,1,2,4,5] => 3
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => [2,1,5,3,4] => 2
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => [2,1,4,3,5] => 2
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => [2,1,3,5,4] => 2
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => [2,1,3,4,5] => 2
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => [1,5,2,3,4] => 1
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => [1,4,2,3,5] => 1
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => [1,3,2,5,4] => 1
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => [1,3,2,4,5] => 1
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
 => [1,2,5,3,4] => 1
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => [1,2,4,3,5] => 1
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
 => [1,2,3,5,4] => 1
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => [1,2,3,4,5] => 1
00000 => [6] => [1,1,1,1,1,1,0,0,0,0,0,0]
 => [6,1,2,3,4,5] => 6
00001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [5,1,2,3,4,6] => 5
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
 => [4,1,2,3,6,5] => 4
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
 => [4,1,2,3,5,6] => 4
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
 => [3,1,2,6,4,5] => 3
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
 => [3,1,2,5,4,6] => 3
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0]
 => [3,1,2,4,6,5] => 3
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
 => [3,1,2,4,5,6] => 3
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
 => [2,1,6,3,4,5] => 2
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
 => [2,1,5,3,4,6] => 2
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [2,1,4,3,6,5] => 2
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
 => [2,1,4,3,5,6] => 2
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
 => [2,1,3,6,4,5] => 2
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
 => [2,1,3,5,4,6] => 2
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
 => [2,1,3,4,6,5] => 2
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
 => [2,1,3,4,5,6] => 2
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
 => [1,6,2,3,4,5] => 1
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
 => [1,5,2,3,4,6] => 1
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
 => [1,4,2,3,6,5] => 1
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
 => [1,4,2,3,5,6] => 1
Description
The first entry of the permutation. This can be described as 1 plus the number of occurrences of the vincular pattern ([2,1], {(0,0),(0,1),(0,2)}), i.e., the first column is shaded, see [1]. This statistic is related to the number of deficiencies [[St000703]] as follows: consider the arc diagram of a permutation $\pi$ of $n$, together with its rotations, obtained by conjugating with the long cycle $(1,\dots,n)$. Drawing the labels $1$ to $n$ in this order on a circle, and the arcs $(i, \pi(i))$ as straight lines, the rotation of $\pi$ is obtained by replacing each number $i$ by $(i\bmod n) +1$. Then, $\pi(1)-1$ is the number of rotations of $\pi$ where the arc $(1, \pi(1))$ is a deficiency. In particular, if $O(\pi)$ is the orbit of rotations of $\pi$, then the number of deficiencies of $\pi$ equals $$ \frac{1}{|O(\pi)|}\sum_{\sigma\in O(\pi)} (\sigma(1)-1). $$
Matching statistic: St000326
(load all 5 compositions to match this statistic)
Mapping
St000326: Binary words ⟶ ℤResult quality: 99% ●values known / values provided: 99%●distinct values known / distinct values provided: 100%
Values
0 => 2
1 => 1
00 => 3
01 => 2
10 => 1
11 => 1
000 => 4
001 => 3
010 => 2
011 => 2
100 => 1
101 => 1
110 => 1
111 => 1
0000 => 5
0001 => 4
0010 => 3
0011 => 3
0100 => 2
0101 => 2
0110 => 2
0111 => 2
1000 => 1
1001 => 1
1010 => 1
1011 => 1
1100 => 1
1101 => 1
1110 => 1
1111 => 1
00000 => 6
00001 => 5
00010 => 4
00011 => 4
00100 => 3
00101 => 3
00110 => 3
00111 => 3
01000 => 2
01001 => 2
01010 => 2
01011 => 2
01100 => 2
01101 => 2
01110 => 2
01111 => 2
10000 => 1
10001 => 1
10010 => 1
10011 => 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: St000297
(load all 5 compositions to match this statistic)
Mapping
Mp00105: Binary words —complement⟶ Binary words
St000297: Binary words ⟶ ℤResult quality: 99% ●values known / values provided: 99%●distinct values known / distinct values provided: 100%
Values
0 => 1 => 1 = 2 - 1
1 => 0 => 0 = 1 - 1
00 => 11 => 2 = 3 - 1
01 => 10 => 1 = 2 - 1
10 => 01 => 0 = 1 - 1
11 => 00 => 0 = 1 - 1
000 => 111 => 3 = 4 - 1
001 => 110 => 2 = 3 - 1
010 => 101 => 1 = 2 - 1
011 => 100 => 1 = 2 - 1
100 => 011 => 0 = 1 - 1
101 => 010 => 0 = 1 - 1
110 => 001 => 0 = 1 - 1
111 => 000 => 0 = 1 - 1
0000 => 1111 => 4 = 5 - 1
0001 => 1110 => 3 = 4 - 1
0010 => 1101 => 2 = 3 - 1
0011 => 1100 => 2 = 3 - 1
0100 => 1011 => 1 = 2 - 1
0101 => 1010 => 1 = 2 - 1
0110 => 1001 => 1 = 2 - 1
0111 => 1000 => 1 = 2 - 1
1000 => 0111 => 0 = 1 - 1
1001 => 0110 => 0 = 1 - 1
1010 => 0101 => 0 = 1 - 1
1011 => 0100 => 0 = 1 - 1
1100 => 0011 => 0 = 1 - 1
1101 => 0010 => 0 = 1 - 1
1110 => 0001 => 0 = 1 - 1
1111 => 0000 => 0 = 1 - 1
00000 => 11111 => 5 = 6 - 1
00001 => 11110 => 4 = 5 - 1
00010 => 11101 => 3 = 4 - 1
00011 => 11100 => 3 = 4 - 1
00100 => 11011 => 2 = 3 - 1
00101 => 11010 => 2 = 3 - 1
00110 => 11001 => 2 = 3 - 1
00111 => 11000 => 2 = 3 - 1
01000 => 10111 => 1 = 2 - 1
01001 => 10110 => 1 = 2 - 1
01010 => 10101 => 1 = 2 - 1
01011 => 10100 => 1 = 2 - 1
01100 => 10011 => 1 = 2 - 1
01101 => 10010 => 1 = 2 - 1
01110 => 10001 => 1 = 2 - 1
01111 => 10000 => 1 = 2 - 1
10000 => 01111 => 0 = 1 - 1
10001 => 01110 => 0 = 1 - 1
10010 => 01101 => 0 = 1 - 1
10011 => 01100 => 0 = 1 - 1
=> => ? = 1 - 1
Description
The number of leading ones in a binary word.
Matching statistic: St000439
(load all 2 compositions to match this statistic)
Mapping
Mp00178: Binary words —to composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000439: Dyck paths ⟶ ℤResult quality: 94% ●values known / values provided: 94%●distinct values known / distinct values provided: 100%
Values
0 => [2] => [1,1,0,0]
 => 3 = 2 + 1
1 => [1,1] => [1,0,1,0]
 => 2 = 1 + 1
00 => [3] => [1,1,1,0,0,0]
 => 4 = 3 + 1
01 => [2,1] => [1,1,0,0,1,0]
 => 3 = 2 + 1
10 => [1,2] => [1,0,1,1,0,0]
 => 2 = 1 + 1
11 => [1,1,1] => [1,0,1,0,1,0]
 => 2 = 1 + 1
000 => [4] => [1,1,1,1,0,0,0,0]
 => 5 = 4 + 1
001 => [3,1] => [1,1,1,0,0,0,1,0]
 => 4 = 3 + 1
010 => [2,2] => [1,1,0,0,1,1,0,0]
 => 3 = 2 + 1
011 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 3 = 2 + 1
100 => [1,3] => [1,0,1,1,1,0,0,0]
 => 2 = 1 + 1
101 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 2 = 1 + 1
110 => [1,1,2] => [1,0,1,0,1,1,0,0]
 => 2 = 1 + 1
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 2 = 1 + 1
0000 => [5] => [1,1,1,1,1,0,0,0,0,0]
 => 6 = 5 + 1
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => 5 = 4 + 1
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0]
 => 4 = 3 + 1
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => 4 = 3 + 1
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => 3 = 2 + 1
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 3 = 2 + 1
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 3 = 2 + 1
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 3 = 2 + 1
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => 2 = 1 + 1
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2 = 1 + 1
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 2 = 1 + 1
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 2 = 1 + 1
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
 => 2 = 1 + 1
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => 2 = 1 + 1
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
 => 2 = 1 + 1
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => 2 = 1 + 1
00000 => [6] => [1,1,1,1,1,1,0,0,0,0,0,0]
 => 7 = 6 + 1
00001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 6 = 5 + 1
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
 => 5 = 4 + 1
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
 => 5 = 4 + 1
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
 => 4 = 3 + 1
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
 => 4 = 3 + 1
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0]
 => 4 = 3 + 1
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
 => 4 = 3 + 1
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
 => 3 = 2 + 1
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
 => 3 = 2 + 1
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
 => 3 = 2 + 1
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
 => 3 = 2 + 1
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
 => 3 = 2 + 1
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
 => 3 = 2 + 1
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
 => 3 = 2 + 1
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
 => 3 = 2 + 1
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
 => 2 = 1 + 1
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
 => 2 = 1 + 1
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
 => 2 = 1 + 1
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
 => 2 = 1 + 1
0000011 => [6,1,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0]
 => ? = 6 + 1
0000110 => [5,1,2] => [1,1,1,1,1,0,0,0,0,0,1,0,1,1,0,0]
 => ? = 5 + 1
0000111 => [5,1,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0]
 => ? = 5 + 1
0011100 => [3,1,1,3] => [1,1,1,0,0,0,1,0,1,0,1,1,1,0,0,0]
 => ? = 3 + 1
00000011 => [7,1,1] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0,1,0]
 => ? = 7 + 1
11111111 => [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,1,0]
 => ? = 1 + 1
010101010 => [2,2,2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => ? = 2 + 1
111111111 => [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,1,0,1,0]
 => ? = 1 + 1
01010101010 => [2,2,2,2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0]
 => ? = 2 + 1
Description
The position of the first down step of a Dyck path.
Matching statistic: St000011
Mapping
Mp00178: Binary words —to composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00101: Dyck paths —decomposition reverse⟶ Dyck paths
St000011: Dyck paths ⟶ ℤResult quality: 94% ●values known / values provided: 94%●distinct values known / distinct values provided: 100%
Values
0 => [2] => [1,1,0,0]
 => [1,0,1,0]
 => 2
1 => [1,1] => [1,0,1,0]
 => [1,1,0,0]
 => 1
00 => [3] => [1,1,1,0,0,0]
 => [1,0,1,0,1,0]
 => 3
01 => [2,1] => [1,1,0,0,1,0]
 => [1,1,0,0,1,0]
 => 2
10 => [1,2] => [1,0,1,1,0,0]
 => [1,1,0,1,0,0]
 => 1
11 => [1,1,1] => [1,0,1,0,1,0]
 => [1,1,1,0,0,0]
 => 1
000 => [4] => [1,1,1,1,0,0,0,0]
 => [1,0,1,0,1,0,1,0]
 => 4
001 => [3,1] => [1,1,1,0,0,0,1,0]
 => [1,1,0,0,1,0,1,0]
 => 3
010 => [2,2] => [1,1,0,0,1,1,0,0]
 => [1,1,0,1,0,0,1,0]
 => 2
011 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => [1,1,1,0,0,0,1,0]
 => 2
100 => [1,3] => [1,0,1,1,1,0,0,0]
 => [1,1,0,1,0,1,0,0]
 => 1
101 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => [1,1,1,0,0,1,0,0]
 => 1
110 => [1,1,2] => [1,0,1,0,1,1,0,0]
 => [1,1,1,0,1,0,0,0]
 => 1
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => [1,1,1,1,0,0,0,0]
 => 1
0000 => [5] => [1,1,1,1,1,0,0,0,0,0]
 => [1,0,1,0,1,0,1,0,1,0]
 => 5
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,0,1,0,1,0,1,0]
 => 4
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0]
 => [1,1,0,1,0,0,1,0,1,0]
 => 3
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => [1,1,1,0,0,0,1,0,1,0]
 => 3
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => [1,1,0,1,0,1,0,0,1,0]
 => 2
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => [1,1,1,0,0,1,0,0,1,0]
 => 2
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => [1,1,1,0,1,0,0,0,1,0]
 => 2
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => [1,1,1,1,0,0,0,0,1,0]
 => 2
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 1
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => [1,1,1,0,0,1,0,1,0,0]
 => 1
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => [1,1,1,0,1,0,0,1,0,0]
 => 1
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => [1,1,1,1,0,0,0,1,0,0]
 => 1
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
 => [1,1,1,0,1,0,1,0,0,0]
 => 1
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => [1,1,1,1,0,0,1,0,0,0]
 => 1
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
 => [1,1,1,1,0,1,0,0,0,0]
 => 1
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => 1
00000 => [6] => [1,1,1,1,1,1,0,0,0,0,0,0]
 => [1,0,1,0,1,0,1,0,1,0,1,0]
 => 6
00001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,0,0,1,0,1,0,1,0,1,0]
 => 5
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
 => [1,1,0,1,0,0,1,0,1,0,1,0]
 => 4
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
 => [1,1,1,0,0,0,1,0,1,0,1,0]
 => 4
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
 => [1,1,0,1,0,1,0,0,1,0,1,0]
 => 3
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
 => [1,1,1,0,0,1,0,0,1,0,1,0]
 => 3
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0]
 => [1,1,1,0,1,0,0,0,1,0,1,0]
 => 3
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
 => [1,1,1,1,0,0,0,0,1,0,1,0]
 => 3
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
 => [1,1,0,1,0,1,0,1,0,0,1,0]
 => 2
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
 => [1,1,1,0,0,1,0,1,0,0,1,0]
 => 2
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,1,1,0,1,0,0,1,0,0,1,0]
 => 2
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
 => [1,1,1,1,0,0,0,1,0,0,1,0]
 => 2
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
 => [1,1,1,0,1,0,1,0,0,0,1,0]
 => 2
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
 => [1,1,1,1,0,0,1,0,0,0,1,0]
 => 2
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
 => [1,1,1,1,0,1,0,0,0,0,1,0]
 => 2
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 2
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
 => [1,1,0,1,0,1,0,1,0,1,0,0]
 => 1
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
 => [1,1,1,0,0,1,0,1,0,1,0,0]
 => 1
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
 => [1,1,1,0,1,0,0,1,0,1,0,0]
 => 1
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
 => [1,1,1,1,0,0,0,1,0,1,0,0]
 => 1
0001010 => [4,2,2] => [1,1,1,1,0,0,0,0,1,1,0,0,1,1,0,0]
 => [1,1,1,0,1,0,0,1,0,0,1,0,1,0,1,0]
 => ? = 4
0011100 => [3,1,1,3] => [1,1,1,0,0,0,1,0,1,0,1,1,1,0,0,0]
 => [1,1,1,1,0,1,0,1,0,0,0,0,1,0,1,0]
 => ? = 3
0101000 => [2,2,4] => [1,1,0,0,1,1,0,0,1,1,1,1,0,0,0,0]
 => [1,1,1,0,1,0,1,0,1,0,0,1,0,0,1,0]
 => ? = 2
1000101 => [1,4,2,1] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0,1,0]
 => [1,1,1,1,0,0,1,0,0,1,0,1,0,1,0,0]
 => ? = 1
1001001 => [1,3,3,1] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0,1,0]
 => [1,1,1,1,0,0,1,0,1,0,0,1,0,1,0,0]
 => ? = 1
1001101 => [1,3,1,2,1] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0,1,0]
 => [1,1,1,1,1,0,0,1,0,0,0,1,0,1,0,0]
 => ? = 1
1010011 => [1,2,3,1,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0,1,0]
 => [1,1,1,1,1,0,0,0,1,0,1,0,0,1,0,0]
 => ? = 1
1010100 => [1,2,2,3] => [1,0,1,1,0,0,1,1,0,0,1,1,1,0,0,0]
 => [1,1,1,1,0,1,0,1,0,0,1,0,0,1,0,0]
 => ? = 1
1010101 => [1,2,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0,1,0]
 => [1,1,1,1,1,0,0,1,0,0,1,0,0,1,0,0]
 => ? = 1
Description
The number of touch points (or returns) of a Dyck path. This is the number of points, excluding the origin, where the Dyck path has height 0.
Matching statistic: St000383
(load all 7 compositions to match this statistic)
Mapping
Mp00104: Binary words —reverse⟶ Binary words
Mp00178: Binary words —to composition⟶ Integer compositions
St000383: Integer compositions ⟶ ℤResult quality: 81% ●values known / values provided: 81%●distinct values known / distinct values provided: 100%
Values
0 => 0 => [2] => 2
1 => 1 => [1,1] => 1
00 => 00 => [3] => 3
01 => 10 => [1,2] => 2
10 => 01 => [2,1] => 1
11 => 11 => [1,1,1] => 1
000 => 000 => [4] => 4
001 => 100 => [1,3] => 3
010 => 010 => [2,2] => 2
011 => 110 => [1,1,2] => 2
100 => 001 => [3,1] => 1
101 => 101 => [1,2,1] => 1
110 => 011 => [2,1,1] => 1
111 => 111 => [1,1,1,1] => 1
0000 => 0000 => [5] => 5
0001 => 1000 => [1,4] => 4
0010 => 0100 => [2,3] => 3
0011 => 1100 => [1,1,3] => 3
0100 => 0010 => [3,2] => 2
0101 => 1010 => [1,2,2] => 2
0110 => 0110 => [2,1,2] => 2
0111 => 1110 => [1,1,1,2] => 2
1000 => 0001 => [4,1] => 1
1001 => 1001 => [1,3,1] => 1
1010 => 0101 => [2,2,1] => 1
1011 => 1101 => [1,1,2,1] => 1
1100 => 0011 => [3,1,1] => 1
1101 => 1011 => [1,2,1,1] => 1
1110 => 0111 => [2,1,1,1] => 1
1111 => 1111 => [1,1,1,1,1] => 1
00000 => 00000 => [6] => 6
00001 => 10000 => [1,5] => 5
00010 => 01000 => [2,4] => 4
00011 => 11000 => [1,1,4] => 4
00100 => 00100 => [3,3] => 3
00101 => 10100 => [1,2,3] => 3
00110 => 01100 => [2,1,3] => 3
00111 => 11100 => [1,1,1,3] => 3
01000 => 00010 => [4,2] => 2
01001 => 10010 => [1,3,2] => 2
01010 => 01010 => [2,2,2] => 2
01011 => 11010 => [1,1,2,2] => 2
01100 => 00110 => [3,1,2] => 2
01101 => 10110 => [1,2,1,2] => 2
01110 => 01110 => [2,1,1,2] => 2
01111 => 11110 => [1,1,1,1,2] => 2
10000 => 00001 => [5,1] => 1
10001 => 10001 => [1,4,1] => 1
10010 => 01001 => [2,3,1] => 1
10011 => 11001 => [1,1,3,1] => 1
0000000 => 0000000 => [8] => ? = 8
0000010 => 0100000 => [2,6] => ? = 6
0000011 => 1100000 => [1,1,6] => ? = 6
0000110 => 0110000 => [2,1,5] => ? = 5
0000111 => 1110000 => [1,1,1,5] => ? = 5
0001010 => 0101000 => [2,2,4] => ? = 4
0100000 => 0000010 => [6,2] => ? = 2
0101000 => 0001010 => [4,2,2] => ? = 2
0110000 => 0000110 => [5,1,2] => ? = 2
0111111 => 1111110 => [1,1,1,1,1,1,2] => ? = 2
1000111 => 1110001 => [1,1,1,4,1] => ? = 1
1011100 => 0011101 => [3,1,1,2,1] => ? = 1
1110001 => 1000111 => [1,4,1,1,1] => ? = 1
1110100 => 0010111 => [3,2,1,1,1] => ? = 1
1111100 => 0011111 => [3,1,1,1,1,1] => ? = 1
1111110 => 0111111 => [2,1,1,1,1,1,1] => ? = 1
00000000 => 00000000 => [9] => ? = 9
00000010 => 01000000 => [2,7] => ? = 7
00000011 => 11000000 => [1,1,7] => ? = 7
01000000 => 00000010 => [7,2] => ? = 2
01111111 => 11111110 => [1,1,1,1,1,1,1,2] => ? = 2
11111110 => 01111111 => [2,1,1,1,1,1,1,1] => ? = 1
11111111 => 11111111 => [1,1,1,1,1,1,1,1,1] => ? = 1
000000000 => 000000000 => [10] => ? = 10
010101010 => 010101010 => [2,2,2,2,2] => ? = 2
011111111 => 111111110 => [1,1,1,1,1,1,1,1,2] => ? = 2
111111110 => 011111111 => [2,1,1,1,1,1,1,1,1] => ? = 1
1111111110 => 0111111111 => [2,1,1,1,1,1,1,1,1,1] => ? = 1
Description
The last part of an integer composition.
Matching statistic: St000617
Mapping
Mp00178: Binary words —to composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
St000617: Dyck paths ⟶ ℤResult quality: 77% ●values known / values provided: 77%●distinct values known / distinct values provided: 100%
Values
0 => [2] => [1,1,0,0]
 => [1,0,1,0]
 => 2
1 => [1,1] => [1,0,1,0]
 => [1,1,0,0]
 => 1
00 => [3] => [1,1,1,0,0,0]
 => [1,0,1,0,1,0]
 => 3
01 => [2,1] => [1,1,0,0,1,0]
 => [1,1,0,1,0,0]
 => 2
10 => [1,2] => [1,0,1,1,0,0]
 => [1,0,1,1,0,0]
 => 1
11 => [1,1,1] => [1,0,1,0,1,0]
 => [1,1,1,0,0,0]
 => 1
000 => [4] => [1,1,1,1,0,0,0,0]
 => [1,0,1,0,1,0,1,0]
 => 4
001 => [3,1] => [1,1,1,0,0,0,1,0]
 => [1,1,0,1,0,1,0,0]
 => 3
010 => [2,2] => [1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,1,0,0]
 => 2
011 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => [1,1,1,0,1,0,0,0]
 => 2
100 => [1,3] => [1,0,1,1,1,0,0,0]
 => [1,0,1,0,1,1,0,0]
 => 1
101 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => [1,1,0,1,1,0,0,0]
 => 1
110 => [1,1,2] => [1,0,1,0,1,1,0,0]
 => [1,0,1,1,1,0,0,0]
 => 1
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => [1,1,1,1,0,0,0,0]
 => 1
0000 => [5] => [1,1,1,1,1,0,0,0,0,0]
 => [1,0,1,0,1,0,1,0,1,0]
 => 5
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,0,1,0,0]
 => 4
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0]
 => [1,0,1,1,0,1,0,1,0,0]
 => 3
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => [1,1,1,0,1,0,1,0,0,0]
 => 3
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => [1,0,1,0,1,1,0,1,0,0]
 => 2
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => [1,1,0,1,1,0,1,0,0,0]
 => 2
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => [1,0,1,1,1,0,1,0,0,0]
 => 2
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => [1,1,1,1,0,1,0,0,0,0]
 => 2
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => [1,0,1,0,1,0,1,1,0,0]
 => 1
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,0,0]
 => 1
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,1,1,0,0,0]
 => 1
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => [1,1,1,0,1,1,0,0,0,0]
 => 1
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
 => [1,0,1,0,1,1,1,0,0,0]
 => 1
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => [1,1,0,1,1,1,0,0,0,0]
 => 1
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
 => [1,0,1,1,1,1,0,0,0,0]
 => 1
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => [1,1,1,1,1,0,0,0,0,0]
 => 1
00000 => [6] => [1,1,1,1,1,1,0,0,0,0,0,0]
 => [1,0,1,0,1,0,1,0,1,0,1,0]
 => 6
00001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
 => [1,1,0,1,0,1,0,1,0,1,0,0]
 => 5
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
 => [1,0,1,1,0,1,0,1,0,1,0,0]
 => 4
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
 => [1,1,1,0,1,0,1,0,1,0,0,0]
 => 4
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
 => [1,0,1,0,1,1,0,1,0,1,0,0]
 => 3
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
 => [1,1,0,1,1,0,1,0,1,0,0,0]
 => 3
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0]
 => [1,0,1,1,1,0,1,0,1,0,0,0]
 => 3
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
 => [1,1,1,1,0,1,0,1,0,0,0,0]
 => 3
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
 => [1,0,1,0,1,0,1,1,0,1,0,0]
 => 2
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,1,0,0,0]
 => 2
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,1,1,0,1,0,0,0]
 => 2
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
 => [1,1,1,0,1,1,0,1,0,0,0,0]
 => 2
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
 => [1,0,1,0,1,1,1,0,1,0,0,0]
 => 2
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
 => [1,1,0,1,1,1,0,1,0,0,0,0]
 => 2
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
 => [1,0,1,1,1,1,0,1,0,0,0,0]
 => 2
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
 => [1,1,1,1,1,0,1,0,0,0,0,0]
 => 2
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
 => [1,0,1,0,1,0,1,0,1,1,0,0]
 => 1
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,0,1,1,0,0,0]
 => 1
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
 => [1,0,1,1,0,1,0,1,1,0,0,0]
 => 1
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
 => [1,1,1,0,1,0,1,1,0,0,0,0]
 => 1
000000 => [7] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0]
 => [1,0,1,0,1,0,1,0,1,0,1,0,1,0]
 => ? = 7
000110 => [4,1,2] => [1,1,1,1,0,0,0,0,1,0,1,1,0,0]
 => [1,0,1,1,1,0,1,0,1,0,1,0,0,0]
 => ? = 4
011000 => [2,1,4] => [1,1,0,0,1,0,1,1,1,1,0,0,0,0]
 => [1,0,1,0,1,0,1,1,1,0,1,0,0,0]
 => ? = 2
0000000 => [8] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
 => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
 => ? = 8
0000010 => [6,2] => [1,1,1,1,1,1,0,0,0,0,0,0,1,1,0,0]
 => [1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,0]
 => ? = 6
0000110 => [5,1,2] => [1,1,1,1,1,0,0,0,0,0,1,0,1,1,0,0]
 => [1,0,1,1,1,0,1,0,1,0,1,0,1,0,0,0]
 => ? = 5
0000111 => [5,1,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0]
 => [1,1,1,1,0,1,0,1,0,1,0,1,0,0,0,0]
 => ? = 5
0001000 => [4,4] => [1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0]
 => [1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0]
 => ? = 4
0001010 => [4,2,2] => [1,1,1,1,0,0,0,0,1,1,0,0,1,1,0,0]
 => [1,0,1,1,0,1,1,0,1,0,1,0,1,0,0,0]
 => ? = 4
0011100 => [3,1,1,3] => [1,1,1,0,0,0,1,0,1,0,1,1,1,0,0,0]
 => [1,0,1,0,1,1,1,1,0,1,0,1,0,0,0,0]
 => ? = 3
0100010 => [2,4,2] => [1,1,0,0,1,1,1,1,0,0,0,0,1,1,0,0]
 => [1,0,1,1,0,1,0,1,0,1,1,0,1,0,0,0]
 => ? = 2
0101000 => [2,2,4] => [1,1,0,0,1,1,0,0,1,1,1,1,0,0,0,0]
 => [1,0,1,0,1,0,1,1,0,1,1,0,1,0,0,0]
 => ? = 2
0110000 => [2,1,5] => [1,1,0,0,1,0,1,1,1,1,1,0,0,0,0,0]
 => [1,0,1,0,1,0,1,0,1,1,1,0,1,0,0,0]
 => ? = 2
1000101 => [1,4,2,1] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0,1,0]
 => [1,1,0,1,1,0,1,0,1,0,1,1,0,0,0,0]
 => ? = 1
1000111 => [1,4,1,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0,1,0]
 => [1,1,1,1,0,1,0,1,0,1,1,0,0,0,0,0]
 => ? = 1
1001001 => [1,3,3,1] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0,1,0]
 => [1,1,0,1,0,1,1,0,1,0,1,1,0,0,0,0]
 => ? = 1
1001100 => [1,3,1,3] => [1,0,1,1,1,0,0,0,1,0,1,1,1,0,0,0]
 => [1,0,1,0,1,1,1,0,1,0,1,1,0,0,0,0]
 => ? = 1
1001101 => [1,3,1,2,1] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0,1,0]
 => [1,1,0,1,1,1,0,1,0,1,1,0,0,0,0,0]
 => ? = 1
1010000 => [1,2,5] => [1,0,1,1,0,0,1,1,1,1,1,0,0,0,0,0]
 => [1,0,1,0,1,0,1,0,1,1,0,1,1,0,0,0]
 => ? = 1
1010001 => [1,2,4,1] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,0,1,1,0,1,1,0,0,0,0]
 => ? = 1
1010011 => [1,2,3,1,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0,1,0]
 => [1,1,1,0,1,0,1,1,0,1,1,0,0,0,0,0]
 => ? = 1
1010100 => [1,2,2,3] => [1,0,1,1,0,0,1,1,0,0,1,1,1,0,0,0]
 => [1,0,1,0,1,1,0,1,1,0,1,1,0,0,0,0]
 => ? = 1
1010101 => [1,2,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0,1,0]
 => [1,1,0,1,1,0,1,1,0,1,1,0,0,0,0,0]
 => ? = 1
1011100 => [1,2,1,1,3] => [1,0,1,1,0,0,1,0,1,0,1,1,1,0,0,0]
 => [1,0,1,0,1,1,1,1,0,1,1,0,0,0,0,0]
 => ? = 1
1011101 => [1,2,1,1,2,1] => [1,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0]
 => [1,1,0,1,1,1,1,0,1,1,0,0,0,0,0,0]
 => ? = 1
1101011 => [1,1,2,2,1,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0]
 => [1,1,1,0,1,1,0,1,1,1,0,0,0,0,0,0]
 => ? = 1
1110000 => [1,1,1,5] => [1,0,1,0,1,0,1,1,1,1,1,0,0,0,0,0]
 => [1,0,1,0,1,0,1,0,1,1,1,1,0,0,0,0]
 => ? = 1
1110001 => [1,1,1,4,1] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0,1,0]
 => [1,1,0,1,0,1,0,1,1,1,1,0,0,0,0,0]
 => ? = 1
1110011 => [1,1,1,3,1,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0,1,0]
 => [1,1,1,0,1,0,1,1,1,1,0,0,0,0,0,0]
 => ? = 1
1110100 => [1,1,1,2,3] => [1,0,1,0,1,0,1,1,0,0,1,1,1,0,0,0]
 => [1,0,1,0,1,1,0,1,1,1,1,0,0,0,0,0]
 => ? = 1
1110101 => [1,1,1,2,2,1] => [1,0,1,0,1,0,1,1,0,0,1,1,0,0,1,0]
 => [1,1,0,1,1,0,1,1,1,1,0,0,0,0,0,0]
 => ? = 1
00000000 => [9] => [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0]
 => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
 => ? = 9
00000010 => [7,2] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,1,0,0]
 => [1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
 => ? = 7
000000000 => [10] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0]
 => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
 => ? = 10
Description
The number of global maxima of a Dyck path.
Matching statistic: St000678
(load all 2 compositions to match this statistic)
Mapping
Mp00178: Binary words —to composition⟶ Integer compositions
Mp00041: Integer compositions —conjugate⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
St000678: Dyck paths ⟶ ℤResult quality: 77% ●values known / values provided: 77%●distinct values known / distinct values provided: 80%
Values
0 => [2] => [1,1] => [1,0,1,0]
 => 2
1 => [1,1] => [2] => [1,1,0,0]
 => 1
00 => [3] => [1,1,1] => [1,0,1,0,1,0]
 => 3
01 => [2,1] => [2,1] => [1,1,0,0,1,0]
 => 2
10 => [1,2] => [1,2] => [1,0,1,1,0,0]
 => 1
11 => [1,1,1] => [3] => [1,1,1,0,0,0]
 => 1
000 => [4] => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => 4
001 => [3,1] => [2,1,1] => [1,1,0,0,1,0,1,0]
 => 3
010 => [2,2] => [1,2,1] => [1,0,1,1,0,0,1,0]
 => 2
011 => [2,1,1] => [3,1] => [1,1,1,0,0,0,1,0]
 => 2
100 => [1,3] => [1,1,2] => [1,0,1,0,1,1,0,0]
 => 1
101 => [1,2,1] => [2,2] => [1,1,0,0,1,1,0,0]
 => 1
110 => [1,1,2] => [1,3] => [1,0,1,1,1,0,0,0]
 => 1
111 => [1,1,1,1] => [4] => [1,1,1,1,0,0,0,0]
 => 1
0000 => [5] => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => 5
0001 => [4,1] => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => 4
0010 => [3,2] => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => 3
0011 => [3,1,1] => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => 3
0100 => [2,3] => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => 2
0101 => [2,2,1] => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => 2
0110 => [2,1,2] => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => 2
0111 => [2,1,1,1] => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => 2
1000 => [1,4] => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
 => 1
1001 => [1,3,1] => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => 1
1010 => [1,2,2] => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => 1
1011 => [1,2,1,1] => [3,2] => [1,1,1,0,0,0,1,1,0,0]
 => 1
1100 => [1,1,3] => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
 => 1
1101 => [1,1,2,1] => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => 1
1110 => [1,1,1,2] => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => 1
1111 => [1,1,1,1,1] => [5] => [1,1,1,1,1,0,0,0,0,0]
 => 1
00000 => [6] => [1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0]
 => 6
00001 => [5,1] => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
 => 5
00010 => [4,2] => [1,2,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0]
 => 4
00011 => [4,1,1] => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
 => 4
00100 => [3,3] => [1,1,2,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0]
 => 3
00101 => [3,2,1] => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
 => 3
00110 => [3,1,2] => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
 => 3
00111 => [3,1,1,1] => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
 => 3
01000 => [2,4] => [1,1,1,2,1] => [1,0,1,0,1,0,1,1,0,0,1,0]
 => 2
01001 => [2,3,1] => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
 => 2
01010 => [2,2,2] => [1,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,0]
 => 2
01011 => [2,2,1,1] => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
 => 2
01100 => [2,1,3] => [1,1,3,1] => [1,0,1,0,1,1,1,0,0,0,1,0]
 => 2
01101 => [2,1,2,1] => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
 => 2
01110 => [2,1,1,2] => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
 => 2
01111 => [2,1,1,1,1] => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
 => 2
10000 => [1,5] => [1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,1,0,0]
 => 1
10001 => [1,4,1] => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
 => 1
10010 => [1,3,2] => [1,2,1,2] => [1,0,1,1,0,0,1,0,1,1,0,0]
 => 1
10011 => [1,3,1,1] => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0]
 => 1
0000011 => [6,1,1] => [3,1,1,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0,1,0]
 => ? = 6
0000111 => [5,1,1,1] => [4,1,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0]
 => ? = 5
0111111 => [2,1,1,1,1,1,1] => [7,1] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
 => ? = 2
1000011 => [1,5,1,1] => [3,1,1,1,2] => [1,1,1,0,0,0,1,0,1,0,1,0,1,1,0,0]
 => ? = 1
1000111 => [1,4,1,1,1] => [4,1,1,2] => [1,1,1,1,0,0,0,0,1,0,1,0,1,1,0,0]
 => ? = 1
1001111 => [1,3,1,1,1,1] => [5,1,2] => [1,1,1,1,1,0,0,0,0,0,1,0,1,1,0,0]
 => ? = 1
1010011 => [1,2,3,1,1] => [3,1,2,2] => [1,1,1,0,0,0,1,0,1,1,0,0,1,1,0,0]
 => ? = 1
1010111 => [1,2,2,1,1,1] => [4,2,2] => [1,1,1,1,0,0,0,0,1,1,0,0,1,1,0,0]
 => ? = 1
1011111 => [1,2,1,1,1,1,1] => [6,2] => [1,1,1,1,1,1,0,0,0,0,0,0,1,1,0,0]
 => ? = 1
1101011 => [1,1,2,2,1,1] => [3,2,3] => [1,1,1,0,0,0,1,1,0,0,1,1,1,0,0,0]
 => ? = 1
1110011 => [1,1,1,3,1,1] => [3,1,4] => [1,1,1,0,0,0,1,0,1,1,1,1,0,0,0,0]
 => ? = 1
1110111 => [1,1,1,2,1,1,1] => [4,4] => [1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0]
 => ? = 1
1111111 => [1,1,1,1,1,1,1,1] => [8] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
 => ? = 1
00000000 => [9] => [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,1,0]
 => ? = 9
00000001 => [8,1] => [2,1,1,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
 => ? = 8
00000010 => [7,2] => [1,2,1,1,1,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0]
 => ? = 7
00000011 => [7,1,1] => [3,1,1,1,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0,1,0,1,0]
 => ? = 7
01000000 => [2,7] => [1,1,1,1,1,1,2,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0,1,0]
 => ? = 2
01111111 => [2,1,1,1,1,1,1,1] => [8,1] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
 => ? = 2
10000000 => [1,8] => [1,1,1,1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
 => ? = 1
11111110 => [1,1,1,1,1,1,1,2] => [1,8] => [1,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
 => ? = 1
11111111 => [1,1,1,1,1,1,1,1,1] => [9] => [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0]
 => ? = 1
000000000 => [10] => [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,1,0,1,0]
 => ? = 10
000000001 => [9,1] => [2,1,1,1,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
 => ? = 9
010101010 => [2,2,2,2,2] => [1,2,2,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,0]
 => ? = 2
011111111 => [2,1,1,1,1,1,1,1,1] => [9,1] => [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,1,0]
 => ? = 2
100000000 => [1,9] => [1,1,1,1,1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
 => ? = 1
111111110 => [1,1,1,1,1,1,1,1,2] => [1,9] => [1,0,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0]
 => ? = 1
111111111 => [1,1,1,1,1,1,1,1,1,1] => [10] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0]
 => ? = 1
1111111110 => [1,1,1,1,1,1,1,1,1,2] => [1,10] => [1,0,1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0]
 => ? = 1
1000000000 => [1,10] => [1,1,1,1,1,1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
 => ? = 1
=> [1] => [1] => [1,0]
 => ? = 1
0000000001 => [10,1] => [2,1,1,1,1,1,1,1,1,1] => ?
 => ? = 10
01010101010 => [2,2,2,2,2,2] => [1,2,2,2,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,0]
 => ? = 2
Description
The number of up steps after the last double rise of a Dyck path.
Matching statistic: St000505
Mapping
Mp00178: Binary words —to composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00138: Dyck paths —to noncrossing partition⟶ Set partitions
St000505: Set partitions ⟶ ℤResult quality: 66% ●values known / values provided: 66%●distinct values known / distinct values provided: 100%
Values
0 => [2] => [1,1,0,0]
 => {{1,2}}
 => 2
1 => [1,1] => [1,0,1,0]
 => {{1},{2}}
 => 1
00 => [3] => [1,1,1,0,0,0]
 => {{1,2,3}}
 => 3
01 => [2,1] => [1,1,0,0,1,0]
 => {{1,2},{3}}
 => 2
10 => [1,2] => [1,0,1,1,0,0]
 => {{1},{2,3}}
 => 1
11 => [1,1,1] => [1,0,1,0,1,0]
 => {{1},{2},{3}}
 => 1
000 => [4] => [1,1,1,1,0,0,0,0]
 => {{1,2,3,4}}
 => 4
001 => [3,1] => [1,1,1,0,0,0,1,0]
 => {{1,2,3},{4}}
 => 3
010 => [2,2] => [1,1,0,0,1,1,0,0]
 => {{1,2},{3,4}}
 => 2
011 => [2,1,1] => [1,1,0,0,1,0,1,0]
 => {{1,2},{3},{4}}
 => 2
100 => [1,3] => [1,0,1,1,1,0,0,0]
 => {{1},{2,3,4}}
 => 1
101 => [1,2,1] => [1,0,1,1,0,0,1,0]
 => {{1},{2,3},{4}}
 => 1
110 => [1,1,2] => [1,0,1,0,1,1,0,0]
 => {{1},{2},{3,4}}
 => 1
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
 => {{1},{2},{3},{4}}
 => 1
0000 => [5] => [1,1,1,1,1,0,0,0,0,0]
 => {{1,2,3,4,5}}
 => 5
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0]
 => {{1,2,3,4},{5}}
 => 4
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0]
 => {{1,2,3},{4,5}}
 => 3
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
 => {{1,2,3},{4},{5}}
 => 3
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
 => {{1,2},{3,4,5}}
 => 2
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
 => {{1,2},{3,4},{5}}
 => 2
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
 => {{1,2},{3},{4,5}}
 => 2
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
 => {{1,2},{3},{4},{5}}
 => 2
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
 => {{1},{2,3,4,5}}
 => 1
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
 => {{1},{2,3,4},{5}}
 => 1
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
 => {{1},{2,3},{4,5}}
 => 1
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
 => {{1},{2,3},{4},{5}}
 => 1
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
 => {{1},{2},{3,4,5}}
 => 1
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
 => {{1},{2},{3,4},{5}}
 => 1
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
 => {{1},{2},{3},{4,5}}
 => 1
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
 => {{1},{2},{3},{4},{5}}
 => 1
00000 => [6] => [1,1,1,1,1,1,0,0,0,0,0,0]
 => {{1,2,3,4,5,6}}
 => 6
00001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
 => {{1,2,3,4,5},{6}}
 => 5
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
 => {{1,2,3,4},{5,6}}
 => 4
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
 => {{1,2,3,4},{5},{6}}
 => 4
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
 => {{1,2,3},{4,5,6}}
 => 3
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
 => {{1,2,3},{4,5},{6}}
 => 3
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0]
 => {{1,2,3},{4},{5,6}}
 => 3
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
 => {{1,2,3},{4},{5},{6}}
 => 3
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
 => {{1,2},{3,4,5,6}}
 => 2
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
 => {{1,2},{3,4,5},{6}}
 => 2
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
 => {{1,2},{3,4},{5,6}}
 => 2
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
 => {{1,2},{3,4},{5},{6}}
 => 2
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
 => {{1,2},{3},{4,5,6}}
 => 2
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
 => {{1,2},{3},{4,5},{6}}
 => 2
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
 => {{1,2},{3},{4},{5,6}}
 => 2
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
 => {{1,2},{3},{4},{5},{6}}
 => 2
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
 => {{1},{2,3,4,5,6}}
 => 1
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
 => {{1},{2,3,4,5},{6}}
 => 1
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
 => {{1},{2,3,4},{5,6}}
 => 1
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
 => {{1},{2,3,4},{5},{6}}
 => 1
0000011 => [6,1,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0]
 => {{1,2,3,4,5,6},{7},{8}}
 => ? = 6
0000110 => [5,1,2] => [1,1,1,1,1,0,0,0,0,0,1,0,1,1,0,0]
 => {{1,2,3,4,5},{6},{7,8}}
 => ? = 5
0000111 => [5,1,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0]
 => {{1,2,3,4,5},{6},{7},{8}}
 => ? = 5
0001000 => [4,4] => [1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0]
 => {{1,2,3,4},{5,6,7,8}}
 => ? = 4
0001010 => [4,2,2] => [1,1,1,1,0,0,0,0,1,1,0,0,1,1,0,0]
 => {{1,2,3,4},{5,6},{7,8}}
 => ? = 4
0011100 => [3,1,1,3] => [1,1,1,0,0,0,1,0,1,0,1,1,1,0,0,0]
 => {{1,2,3},{4},{5},{6,7,8}}
 => ? = 3
0100010 => [2,4,2] => [1,1,0,0,1,1,1,1,0,0,0,0,1,1,0,0]
 => {{1,2},{3,4,5,6},{7,8}}
 => ? = 2
0101000 => [2,2,4] => [1,1,0,0,1,1,0,0,1,1,1,1,0,0,0,0]
 => {{1,2},{3,4},{5,6,7,8}}
 => ? = 2
0110000 => [2,1,5] => [1,1,0,0,1,0,1,1,1,1,1,0,0,0,0,0]
 => {{1,2},{3},{4,5,6,7,8}}
 => ? = 2
0111110 => [2,1,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0]
 => {{1,2},{3},{4},{5},{6},{7,8}}
 => ? = 2
0111111 => [2,1,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0]
 => {{1,2},{3},{4},{5},{6},{7},{8}}
 => ? = 2
1000011 => [1,5,1,1] => [1,0,1,1,1,1,1,0,0,0,0,0,1,0,1,0]
 => {{1},{2,3,4,5,6},{7},{8}}
 => ? = 1
1000100 => [1,4,3] => [1,0,1,1,1,1,0,0,0,0,1,1,1,0,0,0]
 => {{1},{2,3,4,5},{6,7,8}}
 => ? = 1
1000101 => [1,4,2,1] => [1,0,1,1,1,1,0,0,0,0,1,1,0,0,1,0]
 => {{1},{2,3,4,5},{6,7},{8}}
 => ? = 1
1000111 => [1,4,1,1,1] => [1,0,1,1,1,1,0,0,0,0,1,0,1,0,1,0]
 => {{1},{2,3,4,5},{6},{7},{8}}
 => ? = 1
1001001 => [1,3,3,1] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0,1,0]
 => {{1},{2,3,4},{5,6,7},{8}}
 => ? = 1
1001100 => [1,3,1,3] => [1,0,1,1,1,0,0,0,1,0,1,1,1,0,0,0]
 => {{1},{2,3,4},{5},{6,7,8}}
 => ? = 1
1001101 => [1,3,1,2,1] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0,1,0]
 => {{1},{2,3,4},{5},{6,7},{8}}
 => ? = 1
1001111 => [1,3,1,1,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0,1,0,1,0]
 => {{1},{2,3,4},{5},{6},{7},{8}}
 => ? = 1
1010000 => [1,2,5] => [1,0,1,1,0,0,1,1,1,1,1,0,0,0,0,0]
 => {{1},{2,3},{4,5,6,7,8}}
 => ? = 1
1010001 => [1,2,4,1] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0,1,0]
 => {{1},{2,3},{4,5,6,7},{8}}
 => ? = 1
1010011 => [1,2,3,1,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0,1,0]
 => {{1},{2,3},{4,5,6},{7},{8}}
 => ? = 1
1010100 => [1,2,2,3] => [1,0,1,1,0,0,1,1,0,0,1,1,1,0,0,0]
 => {{1},{2,3},{4,5},{6,7,8}}
 => ? = 1
1010101 => [1,2,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0,1,0]
 => {{1},{2,3},{4,5},{6,7},{8}}
 => ? = 1
1010111 => [1,2,2,1,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0,1,0]
 => {{1},{2,3},{4,5},{6},{7},{8}}
 => ? = 1
1011100 => [1,2,1,1,3] => [1,0,1,1,0,0,1,0,1,0,1,1,1,0,0,0]
 => {{1},{2,3},{4},{5},{6,7,8}}
 => ? = 1
1011101 => [1,2,1,1,2,1] => [1,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0]
 => {{1},{2,3},{4},{5},{6,7},{8}}
 => ? = 1
1011111 => [1,2,1,1,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0,1,0]
 => {{1},{2,3},{4},{5},{6},{7},{8}}
 => ? = 1
1101011 => [1,1,2,2,1,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0]
 => {{1},{2},{3,4},{5,6},{7},{8}}
 => ? = 1
1110000 => [1,1,1,5] => [1,0,1,0,1,0,1,1,1,1,1,0,0,0,0,0]
 => {{1},{2},{3},{4,5,6,7,8}}
 => ? = 1
1110001 => [1,1,1,4,1] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0,1,0]
 => {{1},{2},{3},{4,5,6,7},{8}}
 => ? = 1
1110011 => [1,1,1,3,1,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0,1,0]
 => {{1},{2},{3},{4,5,6},{7},{8}}
 => ? = 1
1110100 => [1,1,1,2,3] => [1,0,1,0,1,0,1,1,0,0,1,1,1,0,0,0]
 => {{1},{2},{3},{4,5},{6,7,8}}
 => ? = 1
1110101 => [1,1,1,2,2,1] => [1,0,1,0,1,0,1,1,0,0,1,1,0,0,1,0]
 => {{1},{2},{3},{4,5},{6,7},{8}}
 => ? = 1
1110111 => [1,1,1,2,1,1,1] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0,1,0]
 => {{1},{2},{3},{4,5},{6},{7},{8}}
 => ? = 1
1111100 => [1,1,1,1,1,3] => [1,0,1,0,1,0,1,0,1,0,1,1,1,0,0,0]
 => {{1},{2},{3},{4},{5},{6,7,8}}
 => ? = 1
1111101 => [1,1,1,1,1,2,1] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0,1,0]
 => {{1},{2},{3},{4},{5},{6,7},{8}}
 => ? = 1
1111110 => [1,1,1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
 => {{1},{2},{3},{4},{5},{6},{7,8}}
 => ? = 1
1111111 => [1,1,1,1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
 => {{1},{2},{3},{4},{5},{6},{7},{8}}
 => ? = 1
00000000 => [9] => [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0]
 => {{1,2,3,4,5,6,7,8,9}}
 => ? = 9
00000010 => [7,2] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,1,0,0]
 => {{1,2,3,4,5,6,7},{8,9}}
 => ? = 7
00000011 => [7,1,1] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0,1,0]
 => {{1,2,3,4,5,6,7},{8},{9}}
 => ? = 7
01000000 => [2,7] => [1,1,0,0,1,1,1,1,1,1,1,0,0,0,0,0,0,0]
 => {{1,2},{3,4,5,6,7,8,9}}
 => ? = 2
01111111 => [2,1,1,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
 => {{1,2},{3},{4},{5},{6},{7},{8},{9}}
 => ? = 2
11111110 => [1,1,1,1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
 => {{1},{2},{3},{4},{5},{6},{7},{8,9}}
 => ? = 1
11111111 => [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,1,0]
 => {{1},{2},{3},{4},{5},{6},{7},{8},{9}}
 => ? = 1
000000000 => [10] => [1,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0]
 => {{1,2,3,4,5,6,7,8,9,10}}
 => ? = 10
011111111 => [2,1,1,1,1,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
 => {{1,2},{3},{4},{5},{6},{7},{8},{9},{10}}
 => ? = 2
111111110 => [1,1,1,1,1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
 => {{1},{2},{3},{4},{5},{6},{7},{8},{9,10}}
 => ? = 1
111111111 => [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,1,0,1,0]
 => {{1},{2},{3},{4},{5},{6},{7},{8},{9},{10}}
 => ? = 1
Description
The biggest entry in the block containing the 1.
The following 42 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000971The smallest closer of a set partition. St000504The cardinality of the first block of a set partition. St000823The number of unsplittable factors of the set partition. St000066The column of the unique '1' in the first row of the alternating sign matrix. St000025The number of initial rises of a Dyck path. St000026The position of the first return of a Dyck path. St000273The domination number of a graph. St000363The number of minimal vertex covers of a graph. St000544The cop number of a graph. St000916The packing number of a graph. St001135The projective dimension of the first simple module in the Nakayama algebra corresponding to the Dyck path. St001829The common independence number of a graph. St001322The size of a minimal independent dominating set in a graph. St001316The domatic number of a graph. St001339The irredundance number of a graph. St001363The Euler characteristic of a graph according to Knill. St001498The normalised height of a Nakayama algebra with magnitude 1. St000738The first entry in the last row of a standard tableau. St000501The size of the first part in the decomposition of a permutation. St000542The number of left-to-right-minima of a permutation. St000990The first ascent 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. St000740The last entry of a permutation. St001640The number of ascent tops in the permutation such that all smaller elements appear before. St000286The number of connected components of the complement of a graph. St000287The number of connected components of a graph. St000335The difference of lower and upper interactions. St000991The number of right-to-left minima of a permutation. St001184Number of indecomposable injective modules with grade at least 1 in the corresponding Nakayama algebra. St001201The grade of the simple module $S_0$ in the special CNakayama algebra corresponding to the Dyck path. St001390The number of bumps occurring when Schensted-inserting the letter 1 of a permutation. St000051The size of the left subtree of a binary tree. St000261The edge connectivity of a graph. St000262The vertex connectivity of a graph. St000310The minimal degree of a vertex of a graph. St000989The number of final rises of a permutation. St001226The number of integers i such that the radical of the i-th indecomposable projective module has vanishing first extension group with the Jacobson radical J in the corresponding Nakayama algebra. St000061The number of nodes on the left branch of a binary tree. St000260The radius of a connected graph. St000193The row of the unique '1' in the first column of the alternating sign matrix. St000654The first descent of a permutation. St000338The number of pixed points of a permutation.