searching the database
Your data matches 49 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: St000834
Mp00178: Binary words —to composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000834: Permutations ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00023: Dyck paths —to non-crossing permutation⟶ Permutations
St000834: 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] => 0
1 => [1,1] => [1,0,1,0]
=> [1,2] => 1
00 => [3] => [1,1,1,0,0,0]
=> [3,2,1] => 0
01 => [2,1] => [1,1,0,0,1,0]
=> [2,1,3] => 1
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,3,2,1] => 0
001 => [3,1] => [1,1,1,0,0,0,1,0]
=> [3,2,1,4] => 1
010 => [2,2] => [1,1,0,0,1,1,0,0]
=> [2,1,4,3] => 1
011 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [2,1,3,4] => 1
100 => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,4,3,2] => 1
101 => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,3,2,4] => 2
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,4,3,2,1] => 0
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [4,3,2,1,5] => 1
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [3,2,1,5,4] => 1
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [3,2,1,4,5] => 1
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [2,1,5,4,3] => 1
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] => 1
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [2,1,3,4,5] => 1
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [1,5,4,3,2] => 1
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,4,3,2,5] => 2
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4] => 2
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [1,3,2,4,5] => 2
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,2,5,4,3] => 1
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [1,2,4,3,5] => 2
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,5,4,3,2,1] => 0
00001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> [5,4,3,2,1,6] => 1
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
=> [4,3,2,1,6,5] => 1
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
=> [4,3,2,1,5,6] => 1
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [3,2,1,6,5,4] => 1
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> [3,2,1,5,4,6] => 2
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0]
=> [3,2,1,4,6,5] => 1
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
=> [3,2,1,4,5,6] => 1
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
=> [2,1,6,5,4,3] => 1
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> [2,1,5,4,3,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,5,4] => 1
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] => 1
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,3,4,5,6] => 1
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,6,5,4,3,2] => 1
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,5,4,3,2,6] => 2
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,4,3,2,6,5] => 2
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,4,3,2,5,6] => 2
Description
The number of right outer peaks of a permutation.
A right outer peak in a permutation $w = [w_1,..., w_n]$ is either a position $i$ such that $w_{i-1} < w_i > w_{i+1}$ or $n$ if $w_n > w_{n-1}$.
In other words, it is a peak in the word $[w_1,..., w_n,0]$.
Matching statistic: St001280
Mp00105: Binary words —complement⟶ Binary words
Mp00178: Binary words —to composition⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
St001280: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Mp00178: Binary words —to composition⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
St001280: Integer partitions ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
0 => 1 => [1,1] => [1,1]
=> 0
1 => 0 => [2] => [2]
=> 1
00 => 11 => [1,1,1] => [1,1,1]
=> 0
01 => 10 => [1,2] => [2,1]
=> 1
10 => 01 => [2,1] => [2,1]
=> 1
11 => 00 => [3] => [3]
=> 1
000 => 111 => [1,1,1,1] => [1,1,1,1]
=> 0
001 => 110 => [1,1,2] => [2,1,1]
=> 1
010 => 101 => [1,2,1] => [2,1,1]
=> 1
011 => 100 => [1,3] => [3,1]
=> 1
100 => 011 => [2,1,1] => [2,1,1]
=> 1
101 => 010 => [2,2] => [2,2]
=> 2
110 => 001 => [3,1] => [3,1]
=> 1
111 => 000 => [4] => [4]
=> 1
0000 => 1111 => [1,1,1,1,1] => [1,1,1,1,1]
=> 0
0001 => 1110 => [1,1,1,2] => [2,1,1,1]
=> 1
0010 => 1101 => [1,1,2,1] => [2,1,1,1]
=> 1
0011 => 1100 => [1,1,3] => [3,1,1]
=> 1
0100 => 1011 => [1,2,1,1] => [2,1,1,1]
=> 1
0101 => 1010 => [1,2,2] => [2,2,1]
=> 2
0110 => 1001 => [1,3,1] => [3,1,1]
=> 1
0111 => 1000 => [1,4] => [4,1]
=> 1
1000 => 0111 => [2,1,1,1] => [2,1,1,1]
=> 1
1001 => 0110 => [2,1,2] => [2,2,1]
=> 2
1010 => 0101 => [2,2,1] => [2,2,1]
=> 2
1011 => 0100 => [2,3] => [3,2]
=> 2
1100 => 0011 => [3,1,1] => [3,1,1]
=> 1
1101 => 0010 => [3,2] => [3,2]
=> 2
1110 => 0001 => [4,1] => [4,1]
=> 1
1111 => 0000 => [5] => [5]
=> 1
00000 => 11111 => [1,1,1,1,1,1] => [1,1,1,1,1,1]
=> 0
00001 => 11110 => [1,1,1,1,2] => [2,1,1,1,1]
=> 1
00010 => 11101 => [1,1,1,2,1] => [2,1,1,1,1]
=> 1
00011 => 11100 => [1,1,1,3] => [3,1,1,1]
=> 1
00100 => 11011 => [1,1,2,1,1] => [2,1,1,1,1]
=> 1
00101 => 11010 => [1,1,2,2] => [2,2,1,1]
=> 2
00110 => 11001 => [1,1,3,1] => [3,1,1,1]
=> 1
00111 => 11000 => [1,1,4] => [4,1,1]
=> 1
01000 => 10111 => [1,2,1,1,1] => [2,1,1,1,1]
=> 1
01001 => 10110 => [1,2,1,2] => [2,2,1,1]
=> 2
01010 => 10101 => [1,2,2,1] => [2,2,1,1]
=> 2
01011 => 10100 => [1,2,3] => [3,2,1]
=> 2
01100 => 10011 => [1,3,1,1] => [3,1,1,1]
=> 1
01101 => 10010 => [1,3,2] => [3,2,1]
=> 2
01110 => 10001 => [1,4,1] => [4,1,1]
=> 1
01111 => 10000 => [1,5] => [5,1]
=> 1
10000 => 01111 => [2,1,1,1,1] => [2,1,1,1,1]
=> 1
10001 => 01110 => [2,1,1,2] => [2,2,1,1]
=> 2
10010 => 01101 => [2,1,2,1] => [2,2,1,1]
=> 2
10011 => 01100 => [2,1,3] => [3,2,1]
=> 2
Description
The number of parts of an integer partition that are at least two.
Matching statistic: St000390
(load all 5 compositions to match this statistic)
(load all 5 compositions to match this statistic)
St000390: Binary words ⟶ ℤResult quality: 99% ●values known / values provided: 99%●distinct values known / distinct values provided: 100%
Values
0 => 0
1 => 1
00 => 0
01 => 1
10 => 1
11 => 1
000 => 0
001 => 1
010 => 1
011 => 1
100 => 1
101 => 2
110 => 1
111 => 1
0000 => 0
0001 => 1
0010 => 1
0011 => 1
0100 => 1
0101 => 2
0110 => 1
0111 => 1
1000 => 1
1001 => 2
1010 => 2
1011 => 2
1100 => 1
1101 => 2
1110 => 1
1111 => 1
00000 => 0
00001 => 1
00010 => 1
00011 => 1
00100 => 1
00101 => 2
00110 => 1
00111 => 1
01000 => 1
01001 => 2
01010 => 2
01011 => 2
01100 => 1
01101 => 2
01110 => 1
01111 => 1
10000 => 1
10001 => 2
10010 => 2
10011 => 2
=> ? = 0
Description
The number of runs of ones in a binary word.
Matching statistic: St000291
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00105: Binary words —complement⟶ Binary words
Mp00178: Binary words —to composition⟶ Integer compositions
Mp00094: Integer compositions —to binary word⟶ Binary words
St000291: Binary words ⟶ ℤResult quality: 83% ●values known / values provided: 87%●distinct values known / distinct values provided: 83%
Mp00178: Binary words —to composition⟶ Integer compositions
Mp00094: Integer compositions —to binary word⟶ Binary words
St000291: Binary words ⟶ ℤResult quality: 83% ●values known / values provided: 87%●distinct values known / distinct values provided: 83%
Values
0 => 1 => [1,1] => 11 => 0
1 => 0 => [2] => 10 => 1
00 => 11 => [1,1,1] => 111 => 0
01 => 10 => [1,2] => 110 => 1
10 => 01 => [2,1] => 101 => 1
11 => 00 => [3] => 100 => 1
000 => 111 => [1,1,1,1] => 1111 => 0
001 => 110 => [1,1,2] => 1110 => 1
010 => 101 => [1,2,1] => 1101 => 1
011 => 100 => [1,3] => 1100 => 1
100 => 011 => [2,1,1] => 1011 => 1
101 => 010 => [2,2] => 1010 => 2
110 => 001 => [3,1] => 1001 => 1
111 => 000 => [4] => 1000 => 1
0000 => 1111 => [1,1,1,1,1] => 11111 => 0
0001 => 1110 => [1,1,1,2] => 11110 => 1
0010 => 1101 => [1,1,2,1] => 11101 => 1
0011 => 1100 => [1,1,3] => 11100 => 1
0100 => 1011 => [1,2,1,1] => 11011 => 1
0101 => 1010 => [1,2,2] => 11010 => 2
0110 => 1001 => [1,3,1] => 11001 => 1
0111 => 1000 => [1,4] => 11000 => 1
1000 => 0111 => [2,1,1,1] => 10111 => 1
1001 => 0110 => [2,1,2] => 10110 => 2
1010 => 0101 => [2,2,1] => 10101 => 2
1011 => 0100 => [2,3] => 10100 => 2
1100 => 0011 => [3,1,1] => 10011 => 1
1101 => 0010 => [3,2] => 10010 => 2
1110 => 0001 => [4,1] => 10001 => 1
1111 => 0000 => [5] => 10000 => 1
00000 => 11111 => [1,1,1,1,1,1] => 111111 => 0
00001 => 11110 => [1,1,1,1,2] => 111110 => 1
00010 => 11101 => [1,1,1,2,1] => 111101 => 1
00011 => 11100 => [1,1,1,3] => 111100 => 1
00100 => 11011 => [1,1,2,1,1] => 111011 => 1
00101 => 11010 => [1,1,2,2] => 111010 => 2
00110 => 11001 => [1,1,3,1] => 111001 => 1
00111 => 11000 => [1,1,4] => 111000 => 1
01000 => 10111 => [1,2,1,1,1] => 110111 => 1
01001 => 10110 => [1,2,1,2] => 110110 => 2
01010 => 10101 => [1,2,2,1] => 110101 => 2
01011 => 10100 => [1,2,3] => 110100 => 2
01100 => 10011 => [1,3,1,1] => 110011 => 1
01101 => 10010 => [1,3,2] => 110010 => 2
01110 => 10001 => [1,4,1] => 110001 => 1
01111 => 10000 => [1,5] => 110000 => 1
10000 => 01111 => [2,1,1,1,1] => 101111 => 1
10001 => 01110 => [2,1,1,2] => 101110 => 2
10010 => 01101 => [2,1,2,1] => 101101 => 2
10011 => 01100 => [2,1,3] => 101100 => 2
000000000 => 111111111 => [1,1,1,1,1,1,1,1,1,1] => 1111111111 => ? = 0
000000011 => 111111100 => [1,1,1,1,1,1,1,3] => 1111111100 => ? = 1
000000111 => 111111000 => [1,1,1,1,1,1,4] => 1111111000 => ? = 1
000001000 => 111110111 => [1,1,1,1,1,2,1,1,1] => 1111110111 => ? = 1
000001111 => 111110000 => [1,1,1,1,1,5] => 1111110000 => ? = 1
000100000 => 111011111 => [1,1,1,2,1,1,1,1,1] => 1111011111 => ? = 1
000100010 => 111011101 => [1,1,1,2,1,1,2,1] => 1111011101 => ? = 2
000101000 => 111010111 => [1,1,1,2,2,1,1,1] => 1111010111 => ? = 2
000101010 => 111010101 => [1,1,1,2,2,2,1] => 1111010101 => ? = 3
000111111 => 111000000 => [1,1,1,7] => 1111000000 => ? = 1
001111111 => 110000000 => [1,1,8] => 1110000000 => ? = 1
010000000 => 101111111 => [1,2,1,1,1,1,1,1,1] => 1101111111 => ? = 1
010000010 => 101111101 => [1,2,1,1,1,1,2,1] => 1101111101 => ? = 2
010001000 => 101110111 => [1,2,1,1,2,1,1,1] => 1101110111 => ? = 2
010101000 => 101010111 => [1,2,2,2,1,1,1] => 1101010111 => ? = 3
010101010 => 101010101 => [1,2,2,2,2,1] => 1101010101 => ? = 4
011111111 => 100000000 => [1,9] => 1100000000 => ? = 1
100000000 => 011111111 => [2,1,1,1,1,1,1,1,1] => 1011111111 => ? = 1
111111110 => 000000001 => [9,1] => 1000000001 => ? = 1
1111111110 => 0000000001 => [10,1] => 10000000001 => ? = 1
1000000000 => 0111111111 => [2,1,1,1,1,1,1,1,1,1] => 10111111111 => ? = 1
01010101010 => 10101010101 => [1,2,2,2,2,2,1] => 110101010101 => ? = 5
Description
The number of descents of a binary word.
Matching statistic: St000035
(load all 2 compositions to match this statistic)
(load all 2 compositions to match this statistic)
Mp00178: Binary words —to composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000035: Permutations ⟶ ℤResult quality: 74% ●values known / values provided: 74%●distinct values known / distinct values provided: 83%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00025: Dyck paths —to 132-avoiding permutation⟶ Permutations
St000035: Permutations ⟶ ℤResult quality: 74% ●values known / values provided: 74%●distinct values known / distinct values provided: 83%
Values
0 => [2] => [1,1,0,0]
=> [1,2] => 0
1 => [1,1] => [1,0,1,0]
=> [2,1] => 1
00 => [3] => [1,1,1,0,0,0]
=> [1,2,3] => 0
01 => [2,1] => [1,1,0,0,1,0]
=> [3,1,2] => 1
10 => [1,2] => [1,0,1,1,0,0]
=> [2,3,1] => 1
11 => [1,1,1] => [1,0,1,0,1,0]
=> [3,2,1] => 1
000 => [4] => [1,1,1,1,0,0,0,0]
=> [1,2,3,4] => 0
001 => [3,1] => [1,1,1,0,0,0,1,0]
=> [4,1,2,3] => 1
010 => [2,2] => [1,1,0,0,1,1,0,0]
=> [3,4,1,2] => 1
011 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [4,3,1,2] => 1
100 => [1,3] => [1,0,1,1,1,0,0,0]
=> [2,3,4,1] => 1
101 => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [4,2,3,1] => 2
110 => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [3,4,2,1] => 1
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [4,3,2,1] => 1
0000 => [5] => [1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => 0
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [5,1,2,3,4] => 1
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [4,5,1,2,3] => 1
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [5,4,1,2,3] => 1
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [3,4,5,1,2] => 1
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [5,3,4,1,2] => 2
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [4,5,3,1,2] => 1
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [5,4,3,1,2] => 1
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [2,3,4,5,1] => 1
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [5,2,3,4,1] => 2
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [4,5,2,3,1] => 2
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [5,4,2,3,1] => 2
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> [3,4,5,2,1] => 1
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [5,3,4,2,1] => 2
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [4,5,3,2,1] => 1
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [5,4,3,2,1] => 1
00000 => [6] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,2,3,4,5,6] => 0
00001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> [6,1,2,3,4,5] => 1
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
=> [5,6,1,2,3,4] => 1
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
=> [6,5,1,2,3,4] => 1
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [4,5,6,1,2,3] => 1
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> [6,4,5,1,2,3] => 2
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0]
=> [5,6,4,1,2,3] => 1
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
=> [6,5,4,1,2,3] => 1
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
=> [3,4,5,6,1,2] => 1
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> [6,3,4,5,1,2] => 2
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
=> [5,6,3,4,1,2] => 2
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
=> [6,5,3,4,1,2] => 2
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
=> [4,5,6,3,1,2] => 1
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
=> [6,4,5,3,1,2] => 2
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> [5,6,4,3,1,2] => 1
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> [6,5,4,3,1,2] => 1
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> [2,3,4,5,6,1] => 1
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> [6,2,3,4,5,1] => 2
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> [5,6,2,3,4,1] => 2
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
=> [6,5,2,3,4,1] => 2
100100 => [1,3,3] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0]
=> [5,6,7,2,3,4,1] => ? = 2
100101 => [1,3,2,1] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0]
=> [7,5,6,2,3,4,1] => ? = 3
100110 => [1,3,1,2] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0]
=> [6,7,5,2,3,4,1] => ? = 2
100111 => [1,3,1,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0,1,0]
=> [7,6,5,2,3,4,1] => ? = 2
101000 => [1,2,4] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> [4,5,6,7,2,3,1] => ? = 2
101001 => [1,2,3,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0]
=> [7,4,5,6,2,3,1] => ? = 3
101010 => [1,2,2,2] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> [6,7,4,5,2,3,1] => ? = 3
101011 => [1,2,2,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [7,6,4,5,2,3,1] => ? = 3
101100 => [1,2,1,3] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0]
=> [5,6,7,4,2,3,1] => ? = 2
101101 => [1,2,1,2,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> [7,5,6,4,2,3,1] => ? = 3
101110 => [1,2,1,1,2] => [1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> [6,7,5,4,2,3,1] => ? = 2
101111 => [1,2,1,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [7,6,5,4,2,3,1] => ? = 2
110000 => [1,1,5] => [1,0,1,0,1,1,1,1,1,0,0,0,0,0]
=> [3,4,5,6,7,2,1] => ? = 1
110001 => [1,1,4,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> [7,3,4,5,6,2,1] => ? = 2
110010 => [1,1,3,2] => [1,0,1,0,1,1,1,0,0,0,1,1,0,0]
=> [6,7,3,4,5,2,1] => ? = 2
110011 => [1,1,3,1,1] => [1,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> [7,6,3,4,5,2,1] => ? = 2
110100 => [1,1,2,3] => [1,0,1,0,1,1,0,0,1,1,1,0,0,0]
=> [5,6,7,3,4,2,1] => ? = 2
110101 => [1,1,2,2,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [7,5,6,3,4,2,1] => ? = 3
110110 => [1,1,2,1,2] => [1,0,1,0,1,1,0,0,1,0,1,1,0,0]
=> [6,7,5,3,4,2,1] => ? = 2
110111 => [1,1,2,1,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [7,6,5,3,4,2,1] => ? = 2
111000 => [1,1,1,4] => [1,0,1,0,1,0,1,1,1,1,0,0,0,0]
=> [4,5,6,7,3,2,1] => ? = 1
111001 => [1,1,1,3,1] => [1,0,1,0,1,0,1,1,1,0,0,0,1,0]
=> [7,4,5,6,3,2,1] => ? = 2
111010 => [1,1,1,2,2] => [1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> [6,7,4,5,3,2,1] => ? = 2
111011 => [1,1,1,2,1,1] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [7,6,4,5,3,2,1] => ? = 2
111100 => [1,1,1,1,3] => [1,0,1,0,1,0,1,0,1,1,1,0,0,0]
=> [5,6,7,4,3,2,1] => ? = 1
111101 => [1,1,1,1,2,1] => [1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [7,5,6,4,3,2,1] => ? = 2
111110 => [1,1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [6,7,5,4,3,2,1] => ? = 1
0010000 => [3,5] => [1,1,1,0,0,0,1,1,1,1,1,0,0,0,0,0]
=> [4,5,6,7,8,1,2,3] => ? = 1
1010101 => [1,2,2,2,1] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0,1,0]
=> [8,6,7,4,5,2,3,1] => ? = 4
1011111 => [1,2,1,1,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> [8,7,6,5,4,2,3,1] => ? = 2
1110111 => [1,1,1,2,1,1,1] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [8,7,6,4,5,3,2,1] => ? = 2
1111101 => [1,1,1,1,1,2,1] => [1,0,1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> [8,6,7,5,4,3,2,1] => ? = 2
1111110 => [1,1,1,1,1,1,2] => [1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [7,8,6,5,4,3,2,1] => ? = 1
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]
=> [8,9,7,6,5,4,3,2,1] => ? = 1
000100000 => [4,6] => [1,1,1,1,0,0,0,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [5,6,7,8,9,10,1,2,3,4] => ? = 1
000101000 => [4,2,4] => [1,1,1,1,0,0,0,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> [7,8,9,10,5,6,1,2,3,4] => ? = 2
010000000 => [2,8] => [1,1,0,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> [3,4,5,6,7,8,9,10,1,2] => ? = 1
010000010 => [2,6,2] => [1,1,0,0,1,1,1,1,1,1,0,0,0,0,0,0,1,1,0,0]
=> [9,10,3,4,5,6,7,8,1,2] => ? = 2
010001000 => [2,4,4] => [1,1,0,0,1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0]
=> [7,8,9,10,3,4,5,6,1,2] => ? = 2
010101000 => [2,2,2,4] => [1,1,0,0,1,1,0,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> [7,8,9,10,5,6,3,4,1,2] => ? = 3
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]
=> [9,10,8,7,6,5,4,3,2,1] => ? = 1
1111111110 => [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]
=> [10,11,9,8,7,6,5,4,3,2,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]
=> [11,12,9,10,7,8,5,6,3,4,1,2] => ? = 5
Description
The number of left outer peaks of a permutation.
A left outer peak in a permutation $w = [w_1,..., w_n]$ is either a position $i$ such that $w_{i-1} < w_i > w_{i+1}$ or $1$ if $w_1 > w_2$.
In other words, it is a peak in the word $[0,w_1,..., w_n]$.
This appears in [1, def.3.1]. The joint distribution with [[St000366]] is studied in [3], where left outer peaks are called ''exterior peaks''.
Matching statistic: St000658
Mp00178: Binary words —to composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St000658: Dyck paths ⟶ ℤResult quality: 73% ●values known / values provided: 73%●distinct values known / distinct values provided: 83%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St000658: Dyck paths ⟶ ℤResult quality: 73% ●values known / values provided: 73%●distinct values known / distinct values provided: 83%
Values
0 => [2] => [1,1,0,0]
=> [1,0,1,0]
=> 0
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]
=> 0
01 => [2,1] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 1
10 => [1,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
11 => [1,1,1] => [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> 1
000 => [4] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
001 => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 1
010 => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1
011 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 1
100 => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
101 => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
110 => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,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]
=> 0
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 1
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 2
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 1
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,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]
=> 0
00001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 1
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 1
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 1
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 1
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> 2
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> 1
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 1
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> 1
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> 2
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> 2
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,1,0,1,0,0]
=> 2
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 1
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0]
=> 2
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> 1
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 1
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> 1
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0]
=> 2
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0]
=> 2
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,1,0,1,0,0]
=> 2
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,0,1,0,0,1,1,0,0,1,1,0,1,0,0]
=> ? = 3
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,0,1,0,0,1,1,0,0,1,1,0,0]
=> ? = 3
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,1,0,1,0,1,0,0,1,1,0,1,0,1,0,0]
=> ? = 2
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,1,0,1,0,1,0,1,0,1,0,0,1,1,0,0]
=> ? = 2
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,1,0,1,0,1,0,1,0,1,0,1,0,0,1,0]
=> ? = 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,1,0,1,0,1,0,1,0,1,0,1,0,1,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]
=> ? = 0
00000001 => [8,1] => [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,1,1,0,0]
=> ? = 1
00000011 => [7,1,1] => [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,1,0,1,1,0,1,0,0]
=> ? = 1
00000111 => [6,1,1,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> ? = 1
00001111 => [5,1,1,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> ? = 1
00011111 => [4,1,1,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 1
00111111 => [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]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 1
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,0,1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 1
10000000 => [1,8] => [1,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1
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,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0,1,0]
=> ? = 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,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 1
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]
=> ? = 0
000000001 => [9,1] => [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,1,1,0,0]
=> ? = 1
000000010 => [8,2] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> ? = 1
000000011 => [8,1,1] => [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,1,0,1,1,0,1,0,0]
=> ? = 1
000000111 => [7,1,1,1] => [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,1,0,1,0,1,1,0,1,0,1,0,0]
=> ? = 1
000001000 => [6,4] => [1,1,1,1,1,1,0,0,0,0,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> ? = 1
000001111 => [6,1,1,1,1] => [1,1,1,1,1,1,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,1,0,1,0,1,0,1,0,0]
=> ? = 1
000011111 => [5,1,1,1,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 1
000100000 => [4,6] => [1,1,1,1,0,0,0,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1
000100010 => [4,4,2] => [1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0]
=> ? = 2
000101000 => [4,2,4] => [1,1,1,1,0,0,0,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0,1,0]
=> ? = 2
000101010 => [4,2,2,2] => [1,1,1,1,0,0,0,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,1,0,0,1,1,0,0,1,0]
=> ? = 3
000111111 => [4,1,1,1,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 1
001111111 => [3,1,1,1,1,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 1
010000000 => [2,8] => [1,1,0,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1
010000010 => [2,6,2] => [1,1,0,0,1,1,1,1,1,1,0,0,0,0,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> ? = 2
010001000 => [2,4,4] => [1,1,0,0,1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> ? = 2
010101000 => [2,2,2,4] => [1,1,0,0,1,1,0,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,1,0,0,1,0,1,0,1,0]
=> ? = 3
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]
=> [1,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,0]
=> ? = 4
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,0,1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 1
100000000 => [1,9] => [1,0,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1
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,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0,1,0]
=> ? = 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,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 1
1111111110 => [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,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0,1,0]
=> ? = 1
1000000000 => [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,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1
=> [1] => [1,0]
=> [1,0]
=> ? = 0
0000000001 => [10,1] => [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,1,1,0,0]
=> ? = 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]
=> [1,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,0]
=> ? = 5
Description
The number of rises of length 2 of a Dyck path.
This is also the number of $(1,1)$ steps of the associated Łukasiewicz path, see [1].
A related statistic is the number of double rises in a Dyck path, [[St000024]].
Matching statistic: St000659
(load all 4 compositions to match this statistic)
(load all 4 compositions to match this statistic)
Mp00178: Binary words —to composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St000659: Dyck paths ⟶ ℤResult quality: 73% ●values known / values provided: 73%●distinct values known / distinct values provided: 83%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00229: Dyck paths —Delest-Viennot⟶ Dyck paths
St000659: Dyck paths ⟶ ℤResult quality: 73% ●values known / values provided: 73%●distinct values known / distinct values provided: 83%
Values
0 => [2] => [1,1,0,0]
=> [1,0,1,0]
=> 0
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]
=> 0
01 => [2,1] => [1,1,0,0,1,0]
=> [1,0,1,1,0,0]
=> 1
10 => [1,2] => [1,0,1,1,0,0]
=> [1,1,0,0,1,0]
=> 1
11 => [1,1,1] => [1,0,1,0,1,0]
=> [1,1,0,1,0,0]
=> 1
000 => [4] => [1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0]
=> 0
001 => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,0,1,0,1,1,0,0]
=> 1
010 => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0]
=> 1
011 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,1,0,0]
=> 1
100 => [1,3] => [1,0,1,1,1,0,0,0]
=> [1,1,0,0,1,0,1,0]
=> 1
101 => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [1,1,0,0,1,1,0,0]
=> 2
110 => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,0,1,0]
=> 1
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,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]
=> 0
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,1,0,0]
=> 1
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,0,1,1,0,0,1,0]
=> 1
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0]
=> 1
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,0,1,1,0,0,1,1,0,0]
=> 2
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0,1,0]
=> 1
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0]
=> 1
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [1,1,0,0,1,0,1,1,0,0]
=> 2
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,1,0,0,1,1,0,0,1,0]
=> 2
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [1,1,0,0,1,1,0,1,0,0]
=> 2
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> [1,1,0,1,0,0,1,0,1,0]
=> 1
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [1,1,0,1,0,0,1,1,0,0]
=> 2
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [1,1,0,1,0,1,0,0,1,0]
=> 1
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [1,1,0,1,0,1,0,1,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]
=> 0
00001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,0,1,0,1,0,1,0,1,1,0,0]
=> 1
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0]
=> 1
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,0,1,0,1,0,1,1,0,1,0,0]
=> 1
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,0,1,0,1,0]
=> 1
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,0,1,0,1,1,0,0,1,1,0,0]
=> 2
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,0,1,0,1,1,0,1,0,0,1,0]
=> 1
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,1,0,0]
=> 1
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0]
=> 1
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,0,1,1,0,0,1,0,1,1,0,0]
=> 2
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,0]
=> 2
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,0,1,1,0,0,1,1,0,1,0,0]
=> 2
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,0,1,1,0,1,0,0,1,0,1,0]
=> 1
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,0,1,1,0,1,0,0,1,1,0,0]
=> 2
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0,1,0]
=> 1
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,0,1,1,0,1,0,1,0,1,0,0]
=> 1
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0]
=> 1
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,0,1,0,1,0,1,1,0,0]
=> 2
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> [1,1,0,0,1,0,1,1,0,0,1,0]
=> 2
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
=> [1,1,0,0,1,0,1,1,0,1,0,0]
=> 2
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,0,1,0,0,1,1,0,0,1,1,0,1,0,0]
=> ? = 3
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,0,1,0,0,1,1,0,0,1,1,0,0]
=> ? = 3
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,1,0,1,0,1,0,0,1,1,0,1,0,1,0,0]
=> ? = 2
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,1,0,1,0,1,0,1,0,1,0,0,1,1,0,0]
=> ? = 2
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,1,0,1,0,1,0,1,0,1,0,1,0,0,1,0]
=> ? = 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,1,0,1,0,1,0,1,0,1,0,1,0,1,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]
=> ? = 0
00000001 => [8,1] => [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,1,1,0,0]
=> ? = 1
00000011 => [7,1,1] => [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,1,0,1,1,0,1,0,0]
=> ? = 1
00000111 => [6,1,1,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,0]
=> ? = 1
00001111 => [5,1,1,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> ? = 1
00011111 => [4,1,1,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 1
00111111 => [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]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 1
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,0,1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 1
10000000 => [1,8] => [1,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1
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,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0,1,0]
=> ? = 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,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 1
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]
=> ? = 0
000000001 => [9,1] => [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,1,1,0,0]
=> ? = 1
000000010 => [8,2] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> ? = 1
000000011 => [8,1,1] => [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,1,0,1,1,0,1,0,0]
=> ? = 1
000000111 => [7,1,1,1] => [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,1,0,1,0,1,1,0,1,0,1,0,0]
=> ? = 1
000001000 => [6,4] => [1,1,1,1,1,1,0,0,0,0,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> ? = 1
000001111 => [6,1,1,1,1] => [1,1,1,1,1,1,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,1,0,1,0,1,0,1,0,0]
=> ? = 1
000011111 => [5,1,1,1,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 1
000100000 => [4,6] => [1,1,1,1,0,0,0,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1
000100010 => [4,4,2] => [1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0]
=> ? = 2
000101000 => [4,2,4] => [1,1,1,1,0,0,0,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0,1,0]
=> ? = 2
000101010 => [4,2,2,2] => [1,1,1,1,0,0,0,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,0,1,0,1,0,1,1,0,0,1,1,0,0,1,1,0,0,1,0]
=> ? = 3
000111111 => [4,1,1,1,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 1
001111111 => [3,1,1,1,1,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 1
010000000 => [2,8] => [1,1,0,0,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1
010000010 => [2,6,2] => [1,1,0,0,1,1,1,1,1,1,0,0,0,0,0,0,1,1,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0,1,0]
=> ? = 2
010001000 => [2,4,4] => [1,1,0,0,1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> ? = 2
010101000 => [2,2,2,4] => [1,1,0,0,1,1,0,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,0,1,1,0,0,1,1,0,0,1,1,0,0,1,0,1,0,1,0]
=> ? = 3
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]
=> [1,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,0]
=> ? = 4
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,0,1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 1
100000000 => [1,9] => [1,0,1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0]
=> [1,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1
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,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0,1,0]
=> ? = 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,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 1
1111111110 => [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,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0,1,0]
=> ? = 1
1000000000 => [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,1,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> ? = 1
=> [1] => [1,0]
=> [1,0]
=> ? = 0
0000000001 => [10,1] => [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,1,1,0,0]
=> ? = 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]
=> [1,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,0,1,0]
=> ? = 5
Description
The number of rises of length at least 2 of a Dyck path.
Matching statistic: St000340
Mp00178: Binary words —to composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
St000340: Dyck paths ⟶ ℤResult quality: 67% ●values known / values provided: 68%●distinct values known / distinct values provided: 67%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00032: Dyck paths —inverse zeta map⟶ Dyck paths
St000340: Dyck paths ⟶ ℤResult quality: 67% ●values known / values provided: 68%●distinct values known / distinct values provided: 67%
Values
0 => [2] => [1,1,0,0]
=> [1,0,1,0]
=> 0
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]
=> 0
01 => [2,1] => [1,1,0,0,1,0]
=> [1,1,0,1,0,0]
=> 1
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]
=> 0
001 => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,1,0,1,0,1,0,0]
=> 1
010 => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,0]
=> 1
011 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,1,1,0,1,0,0,0]
=> 1
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]
=> 2
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]
=> 0
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,0]
=> 1
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,0,1,1,0,1,0,1,0,0]
=> 1
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,1,1,0,1,0,1,0,0,0]
=> 1
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,0,1,0,1,1,0,1,0,0]
=> 1
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]
=> 1
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]
=> 1
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]
=> 2
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [1,0,1,1,0,1,1,0,0,0]
=> 2
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]
=> 2
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]
=> 2
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]
=> 0
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]
=> 1
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]
=> 1
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]
=> 1
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]
=> 1
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]
=> 2
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]
=> 1
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]
=> 1
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]
=> 1
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]
=> 1
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]
=> 1
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]
=> 1
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]
=> 2
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]
=> 2
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]
=> 2
0000001 => [7,1] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 1
0000011 => [6,1,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0]
=> [1,1,1,0,1,0,1,0,1,0,1,0,1,0,0,0]
=> ? = 1
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]
=> ? = 1
0001111 => [4,1,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,0,1,0,1,0,0,0,0,0]
=> ? = 1
0011111 => [3,1,1,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,1,0,1,0,0,0,0,0,0]
=> ? = 1
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,1,1,1,1,1,1,0,1,0,0,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]
=> ? = 3
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]
=> ? = 4
1010111 => [1,2,2,1,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,1,0,1,1,0,0,0,0,0,0]
=> ? = 3
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]
=> ? = 3
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,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0]
=> ? = 2
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]
=> ? = 3
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]
=> ? = 3
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,1,1,1,0,1,1,1,1,0,0,0,0,0,0,0]
=> ? = 2
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,1,0,1,1,1,1,1,1,0,0,0,0,0,0,0]
=> ? = 2
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,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,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]
=> ? = 0
00000001 => [8,1] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 1
00000011 => [7,1,1] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0,1,0]
=> [1,1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0,0]
=> ? = 1
00000111 => [6,1,1,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,1,0,1,0,1,0,1,0,0,0,0]
=> ? = 1
00001111 => [5,1,1,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,0,1,0,1,0,1,0,0,0,0,0]
=> ? = 1
00011111 => [4,1,1,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,1,0,1,0,1,0,0,0,0,0,0]
=> ? = 1
00111111 => [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]
=> [1,1,1,1,1,1,1,0,1,0,1,0,0,0,0,0,0,0]
=> ? = 1
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,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,0]
=> ? = 1
10000000 => [1,8] => [1,0,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,1,0,0]
=> ? = 1
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,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] => [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,0,0,0,0,0,0,0,0,0]
=> ? = 1
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]
=> ? = 0
000000001 => [9,1] => [1,1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,1,0]
=> [1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0]
=> ? = 1
000000010 => [8,2] => [1,1,1,1,1,1,1,1,0,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,1,0,0]
=> ? = 1
000000011 => [8,1,1] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0,1,0]
=> [1,1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0,0]
=> ? = 1
000000111 => [7,1,1,1] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0,1,0,1,0]
=> [1,1,1,1,0,1,0,1,0,1,0,1,0,1,0,1,0,0,0,0]
=> ? = 1
000001000 => [6,4] => [1,1,1,1,1,1,0,0,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,1,0,1,0,0]
=> ? = 1
000001111 => [6,1,1,1,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,0,1,0,1,0,1,0,1,0,1,0,0,0,0,0]
=> ? = 1
000011111 => [5,1,1,1,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,0,1,0,1,0,1,0,1,0,0,0,0,0,0]
=> ? = 1
000100000 => [4,6] => [1,1,1,1,0,0,0,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,0,1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,0]
=> ? = 1
000100010 => [4,4,2] => [1,1,1,1,0,0,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,1,0,1,0,0,0]
=> ? = 2
000101000 => [4,2,4] => [1,1,1,1,0,0,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,1,0,1,0,0,0]
=> ? = 2
000101010 => [4,2,2,2] => [1,1,1,1,0,0,0,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,0,1,0,1,0,0,0,0]
=> ? = 3
000111111 => [4,1,1,1,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,0,1,0,1,0,1,0,0,0,0,0,0,0]
=> ? = 1
001111111 => [3,1,1,1,1,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0,1,0,1,0,1,0]
=> [1,1,1,1,1,1,1,1,0,1,0,1,0,0,0,0,0,0,0,0]
=> ? = 1
010000000 => [2,8] => [1,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,0,1,0,1,0,1,0,1,1,0,1,0,0]
=> ? = 1
010000010 => [2,6,2] => [1,1,0,0,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,1,0,1,0,0,0]
=> ? = 2
010001000 => [2,4,4] => [1,1,0,0,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,1,0,1,0,0,0]
=> ? = 2
010101000 => [2,2,2,4] => [1,1,0,0,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,1,0,1,0,0,0,0]
=> ? = 3
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]
=> [1,0,1,1,0,1,1,0,1,1,0,1,1,0,1,0,0,0,0,0]
=> ? = 4
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,1,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,0,0]
=> ? = 1
100000000 => [1,9] => [1,0,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,1,0,0]
=> ? = 1
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,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] => [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,0,0,0,0,0,0,0,0,0,0]
=> ? = 1
Description
The number of non-final maximal constant sub-paths of length greater than one.
This is the total number of occurrences of the patterns $110$ and $001$.
Matching statistic: St000374
Mp00178: Binary words —to composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
St000374: Permutations ⟶ ℤResult quality: 64% ●values known / values provided: 64%●distinct values known / distinct values provided: 83%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
St000374: Permutations ⟶ ℤResult quality: 64% ●values known / values provided: 64%●distinct values known / distinct values provided: 83%
Values
0 => [2] => [1,1,0,0]
=> [1,2] => 0
1 => [1,1] => [1,0,1,0]
=> [2,1] => 1
00 => [3] => [1,1,1,0,0,0]
=> [1,2,3] => 0
01 => [2,1] => [1,1,0,0,1,0]
=> [1,3,2] => 1
10 => [1,2] => [1,0,1,1,0,0]
=> [2,1,3] => 1
11 => [1,1,1] => [1,0,1,0,1,0]
=> [2,3,1] => 1
000 => [4] => [1,1,1,1,0,0,0,0]
=> [1,2,3,4] => 0
001 => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,2,4,3] => 1
010 => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,3,2,4] => 1
011 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,3,4,2] => 1
100 => [1,3] => [1,0,1,1,1,0,0,0]
=> [2,1,3,4] => 1
101 => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [2,1,4,3] => 2
110 => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [2,3,1,4] => 1
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [2,3,4,1] => 1
0000 => [5] => [1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => 0
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,2,3,5,4] => 1
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,2,4,3,5] => 1
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,2,4,5,3] => 1
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => 1
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => 2
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => 1
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => 1
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => 1
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => 2
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => 2
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => 2
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => 1
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => 2
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => 1
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => 1
00000 => [6] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,2,3,4,5,6] => 0
00001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,2,3,4,6,5] => 1
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,2,3,5,4,6] => 1
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,2,3,5,6,4] => 1
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,2,4,3,5,6] => 1
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,2,4,3,6,5] => 2
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,2,4,5,3,6] => 1
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,2,4,5,6,3] => 1
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,3,2,4,5,6] => 1
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,3,2,4,6,5] => 2
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4,6] => 2
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,3,2,5,6,4] => 2
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,3,4,2,5,6] => 1
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,3,4,2,6,5] => 2
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,3,4,5,2,6] => 1
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,3,4,5,6,2] => 1
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> [2,1,3,4,5,6] => 1
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> [2,1,3,4,6,5] => 2
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> [2,1,3,5,4,6] => 2
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
=> [2,1,3,5,6,4] => 2
100100 => [1,3,3] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,1,3,5,4,6,7] => ? = 2
100101 => [1,3,2,1] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0]
=> [2,1,3,5,4,7,6] => ? = 3
100110 => [1,3,1,2] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0]
=> [2,1,3,5,6,4,7] => ? = 2
100111 => [1,3,1,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0,1,0]
=> [2,1,3,5,6,7,4] => ? = 2
101000 => [1,2,4] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> [2,1,4,3,5,6,7] => ? = 2
101001 => [1,2,3,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0]
=> [2,1,4,3,5,7,6] => ? = 3
101010 => [1,2,2,2] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,6,5,7] => ? = 3
101011 => [1,2,2,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [2,1,4,3,6,7,5] => ? = 3
101100 => [1,2,1,3] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0]
=> [2,1,4,5,3,6,7] => ? = 2
101101 => [1,2,1,2,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> [2,1,4,5,3,7,6] => ? = 3
101110 => [1,2,1,1,2] => [1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> [2,1,4,5,6,3,7] => ? = 2
101111 => [1,2,1,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,4,5,6,7,3] => ? = 2
110001 => [1,1,4,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> [2,3,1,4,5,7,6] => ? = 2
110010 => [1,1,3,2] => [1,0,1,0,1,1,1,0,0,0,1,1,0,0]
=> [2,3,1,4,6,5,7] => ? = 2
110011 => [1,1,3,1,1] => [1,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> [2,3,1,4,6,7,5] => ? = 2
110100 => [1,1,2,3] => [1,0,1,0,1,1,0,0,1,1,1,0,0,0]
=> [2,3,1,5,4,6,7] => ? = 2
110101 => [1,1,2,2,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [2,3,1,5,4,7,6] => ? = 3
110110 => [1,1,2,1,2] => [1,0,1,0,1,1,0,0,1,0,1,1,0,0]
=> [2,3,1,5,6,4,7] => ? = 2
110111 => [1,1,2,1,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [2,3,1,5,6,7,4] => ? = 2
111010 => [1,1,1,2,2] => [1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> [2,3,4,1,6,5,7] => ? = 2
111011 => [1,1,1,2,1,1] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [2,3,4,1,6,7,5] => ? = 2
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,7,8,6] => ? = 1
0000100 => [5,3] => [1,1,1,1,1,0,0,0,0,0,1,1,1,0,0,0]
=> [1,2,3,4,6,5,7,8] => ? = 1
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,6,7,8,5] => ? = 1
0010000 => [3,5] => [1,1,1,0,0,0,1,1,1,1,1,0,0,0,0,0]
=> [1,2,4,3,5,6,7,8] => ? = 1
0011100 => [3,1,1,3] => [1,1,1,0,0,0,1,0,1,0,1,1,1,0,0,0]
=> [1,2,4,5,6,3,7,8] => ? = 1
0011111 => [3,1,1,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,4,5,6,7,8,3] => ? = 1
0111110 => [2,1,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,3,4,5,6,7,2,8] => ? = 1
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,3,4,5,6,7,8,2] => ? = 1
1001001 => [1,3,3,1] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4,6,8,7] => ? = 3
1010111 => [1,2,2,1,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0,1,0]
=> [2,1,4,3,6,7,8,5] => ? = 3
1011101 => [1,2,1,1,2,1] => [1,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0]
=> [2,1,4,5,6,3,8,7] => ? = 3
1011111 => [1,2,1,1,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> [2,1,4,5,6,7,8,3] => ? = 2
1101011 => [1,1,2,2,1,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [2,3,1,5,4,7,8,6] => ? = 3
1110101 => [1,1,1,2,2,1] => [1,0,1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [2,3,4,1,6,5,8,7] => ? = 3
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,8,9,7] => ? = 1
00000111 => [6,1,1,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0,1,0]
=> [1,2,3,4,5,7,8,9,6] => ? = 1
00001111 => [5,1,1,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,6,7,8,9,5] => ? = 1
00011111 => [4,1,1,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,5,6,7,8,9,4] => ? = 1
00111111 => [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]
=> [1,2,4,5,6,7,8,9,3] => ? = 1
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,3,4,5,6,7,8,9,2] => ? = 1
000000010 => [8,2] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,1,0,0]
=> [1,2,3,4,5,6,7,9,8,10] => ? = 1
000000011 => [8,1,1] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0,1,0]
=> [1,2,3,4,5,6,7,9,10,8] => ? = 1
000000111 => [7,1,1,1] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6,8,9,10,7] => ? = 1
000001000 => [6,4] => [1,1,1,1,1,1,0,0,0,0,0,0,1,1,1,1,0,0,0,0]
=> [1,2,3,4,5,7,6,8,9,10] => ? = 1
000001111 => [6,1,1,1,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,7,8,9,10,6] => ? = 1
000011111 => [5,1,1,1,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,6,7,8,9,10,5] => ? = 1
000100000 => [4,6] => [1,1,1,1,0,0,0,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,2,3,5,4,6,7,8,9,10] => ? = 1
000100010 => [4,4,2] => [1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,2,3,5,4,6,7,9,8,10] => ? = 2
000101000 => [4,2,4] => [1,1,1,1,0,0,0,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,2,3,5,4,7,6,8,9,10] => ? = 2
Description
The number of exclusive right-to-left minima of a permutation.
This is the number of right-to-left minima that are not left-to-right maxima.
This is also the number of non weak exceedences of a permutation that are also not mid-points of a decreasing subsequence of length 3.
Given a permutation $\pi = [\pi_1,\ldots,\pi_n]$, this statistic counts the number of position $j$ such that $\pi_j < j$ and there do not exist indices $i,k$ with $i < j < k$ and $\pi_i > \pi_j > \pi_k$.
See also [[St000213]] and [[St000119]].
Matching statistic: St000703
Mp00178: Binary words —to composition⟶ Integer compositions
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
St000703: Permutations ⟶ ℤResult quality: 64% ●values known / values provided: 64%●distinct values known / distinct values provided: 83%
Mp00231: Integer compositions —bounce path⟶ Dyck paths
Mp00129: Dyck paths —to 321-avoiding permutation (Billey-Jockusch-Stanley)⟶ Permutations
St000703: Permutations ⟶ ℤResult quality: 64% ●values known / values provided: 64%●distinct values known / distinct values provided: 83%
Values
0 => [2] => [1,1,0,0]
=> [1,2] => 0
1 => [1,1] => [1,0,1,0]
=> [2,1] => 1
00 => [3] => [1,1,1,0,0,0]
=> [1,2,3] => 0
01 => [2,1] => [1,1,0,0,1,0]
=> [1,3,2] => 1
10 => [1,2] => [1,0,1,1,0,0]
=> [2,1,3] => 1
11 => [1,1,1] => [1,0,1,0,1,0]
=> [2,3,1] => 1
000 => [4] => [1,1,1,1,0,0,0,0]
=> [1,2,3,4] => 0
001 => [3,1] => [1,1,1,0,0,0,1,0]
=> [1,2,4,3] => 1
010 => [2,2] => [1,1,0,0,1,1,0,0]
=> [1,3,2,4] => 1
011 => [2,1,1] => [1,1,0,0,1,0,1,0]
=> [1,3,4,2] => 1
100 => [1,3] => [1,0,1,1,1,0,0,0]
=> [2,1,3,4] => 1
101 => [1,2,1] => [1,0,1,1,0,0,1,0]
=> [2,1,4,3] => 2
110 => [1,1,2] => [1,0,1,0,1,1,0,0]
=> [2,3,1,4] => 1
111 => [1,1,1,1] => [1,0,1,0,1,0,1,0]
=> [2,3,4,1] => 1
0000 => [5] => [1,1,1,1,1,0,0,0,0,0]
=> [1,2,3,4,5] => 0
0001 => [4,1] => [1,1,1,1,0,0,0,0,1,0]
=> [1,2,3,5,4] => 1
0010 => [3,2] => [1,1,1,0,0,0,1,1,0,0]
=> [1,2,4,3,5] => 1
0011 => [3,1,1] => [1,1,1,0,0,0,1,0,1,0]
=> [1,2,4,5,3] => 1
0100 => [2,3] => [1,1,0,0,1,1,1,0,0,0]
=> [1,3,2,4,5] => 1
0101 => [2,2,1] => [1,1,0,0,1,1,0,0,1,0]
=> [1,3,2,5,4] => 2
0110 => [2,1,2] => [1,1,0,0,1,0,1,1,0,0]
=> [1,3,4,2,5] => 1
0111 => [2,1,1,1] => [1,1,0,0,1,0,1,0,1,0]
=> [1,3,4,5,2] => 1
1000 => [1,4] => [1,0,1,1,1,1,0,0,0,0]
=> [2,1,3,4,5] => 1
1001 => [1,3,1] => [1,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4] => 2
1010 => [1,2,2] => [1,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,5] => 2
1011 => [1,2,1,1] => [1,0,1,1,0,0,1,0,1,0]
=> [2,1,4,5,3] => 2
1100 => [1,1,3] => [1,0,1,0,1,1,1,0,0,0]
=> [2,3,1,4,5] => 1
1101 => [1,1,2,1] => [1,0,1,0,1,1,0,0,1,0]
=> [2,3,1,5,4] => 2
1110 => [1,1,1,2] => [1,0,1,0,1,0,1,1,0,0]
=> [2,3,4,1,5] => 1
1111 => [1,1,1,1,1] => [1,0,1,0,1,0,1,0,1,0]
=> [2,3,4,5,1] => 1
00000 => [6] => [1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,2,3,4,5,6] => 0
00001 => [5,1] => [1,1,1,1,1,0,0,0,0,0,1,0]
=> [1,2,3,4,6,5] => 1
00010 => [4,2] => [1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,2,3,5,4,6] => 1
00011 => [4,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0]
=> [1,2,3,5,6,4] => 1
00100 => [3,3] => [1,1,1,0,0,0,1,1,1,0,0,0]
=> [1,2,4,3,5,6] => 1
00101 => [3,2,1] => [1,1,1,0,0,0,1,1,0,0,1,0]
=> [1,2,4,3,6,5] => 2
00110 => [3,1,2] => [1,1,1,0,0,0,1,0,1,1,0,0]
=> [1,2,4,5,3,6] => 1
00111 => [3,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0]
=> [1,2,4,5,6,3] => 1
01000 => [2,4] => [1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,3,2,4,5,6] => 1
01001 => [2,3,1] => [1,1,0,0,1,1,1,0,0,0,1,0]
=> [1,3,2,4,6,5] => 2
01010 => [2,2,2] => [1,1,0,0,1,1,0,0,1,1,0,0]
=> [1,3,2,5,4,6] => 2
01011 => [2,2,1,1] => [1,1,0,0,1,1,0,0,1,0,1,0]
=> [1,3,2,5,6,4] => 2
01100 => [2,1,3] => [1,1,0,0,1,0,1,1,1,0,0,0]
=> [1,3,4,2,5,6] => 1
01101 => [2,1,2,1] => [1,1,0,0,1,0,1,1,0,0,1,0]
=> [1,3,4,2,6,5] => 2
01110 => [2,1,1,2] => [1,1,0,0,1,0,1,0,1,1,0,0]
=> [1,3,4,5,2,6] => 1
01111 => [2,1,1,1,1] => [1,1,0,0,1,0,1,0,1,0,1,0]
=> [1,3,4,5,6,2] => 1
10000 => [1,5] => [1,0,1,1,1,1,1,0,0,0,0,0]
=> [2,1,3,4,5,6] => 1
10001 => [1,4,1] => [1,0,1,1,1,1,0,0,0,0,1,0]
=> [2,1,3,4,6,5] => 2
10010 => [1,3,2] => [1,0,1,1,1,0,0,0,1,1,0,0]
=> [2,1,3,5,4,6] => 2
10011 => [1,3,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0]
=> [2,1,3,5,6,4] => 2
100100 => [1,3,3] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0]
=> [2,1,3,5,4,6,7] => ? = 2
100101 => [1,3,2,1] => [1,0,1,1,1,0,0,0,1,1,0,0,1,0]
=> [2,1,3,5,4,7,6] => ? = 3
100110 => [1,3,1,2] => [1,0,1,1,1,0,0,0,1,0,1,1,0,0]
=> [2,1,3,5,6,4,7] => ? = 2
100111 => [1,3,1,1,1] => [1,0,1,1,1,0,0,0,1,0,1,0,1,0]
=> [2,1,3,5,6,7,4] => ? = 2
101000 => [1,2,4] => [1,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> [2,1,4,3,5,6,7] => ? = 2
101001 => [1,2,3,1] => [1,0,1,1,0,0,1,1,1,0,0,0,1,0]
=> [2,1,4,3,5,7,6] => ? = 3
101010 => [1,2,2,2] => [1,0,1,1,0,0,1,1,0,0,1,1,0,0]
=> [2,1,4,3,6,5,7] => ? = 3
101011 => [1,2,2,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [2,1,4,3,6,7,5] => ? = 3
101100 => [1,2,1,3] => [1,0,1,1,0,0,1,0,1,1,1,0,0,0]
=> [2,1,4,5,3,6,7] => ? = 2
101101 => [1,2,1,2,1] => [1,0,1,1,0,0,1,0,1,1,0,0,1,0]
=> [2,1,4,5,3,7,6] => ? = 3
101110 => [1,2,1,1,2] => [1,0,1,1,0,0,1,0,1,0,1,1,0,0]
=> [2,1,4,5,6,3,7] => ? = 2
101111 => [1,2,1,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0]
=> [2,1,4,5,6,7,3] => ? = 2
110001 => [1,1,4,1] => [1,0,1,0,1,1,1,1,0,0,0,0,1,0]
=> [2,3,1,4,5,7,6] => ? = 2
110010 => [1,1,3,2] => [1,0,1,0,1,1,1,0,0,0,1,1,0,0]
=> [2,3,1,4,6,5,7] => ? = 2
110011 => [1,1,3,1,1] => [1,0,1,0,1,1,1,0,0,0,1,0,1,0]
=> [2,3,1,4,6,7,5] => ? = 2
110100 => [1,1,2,3] => [1,0,1,0,1,1,0,0,1,1,1,0,0,0]
=> [2,3,1,5,4,6,7] => ? = 2
110101 => [1,1,2,2,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [2,3,1,5,4,7,6] => ? = 3
110110 => [1,1,2,1,2] => [1,0,1,0,1,1,0,0,1,0,1,1,0,0]
=> [2,3,1,5,6,4,7] => ? = 2
110111 => [1,1,2,1,1,1] => [1,0,1,0,1,1,0,0,1,0,1,0,1,0]
=> [2,3,1,5,6,7,4] => ? = 2
111010 => [1,1,1,2,2] => [1,0,1,0,1,0,1,1,0,0,1,1,0,0]
=> [2,3,4,1,6,5,7] => ? = 2
111011 => [1,1,1,2,1,1] => [1,0,1,0,1,0,1,1,0,0,1,0,1,0]
=> [2,3,4,1,6,7,5] => ? = 2
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,7,8,6] => ? = 1
0000100 => [5,3] => [1,1,1,1,1,0,0,0,0,0,1,1,1,0,0,0]
=> [1,2,3,4,6,5,7,8] => ? = 1
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,6,7,8,5] => ? = 1
0010000 => [3,5] => [1,1,1,0,0,0,1,1,1,1,1,0,0,0,0,0]
=> [1,2,4,3,5,6,7,8] => ? = 1
0011100 => [3,1,1,3] => [1,1,1,0,0,0,1,0,1,0,1,1,1,0,0,0]
=> [1,2,4,5,6,3,7,8] => ? = 1
0011111 => [3,1,1,1,1,1] => [1,1,1,0,0,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,4,5,6,7,8,3] => ? = 1
0111110 => [2,1,1,1,1,2] => [1,1,0,0,1,0,1,0,1,0,1,0,1,1,0,0]
=> [1,3,4,5,6,7,2,8] => ? = 1
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,3,4,5,6,7,8,2] => ? = 1
1001001 => [1,3,3,1] => [1,0,1,1,1,0,0,0,1,1,1,0,0,0,1,0]
=> [2,1,3,5,4,6,8,7] => ? = 3
1010111 => [1,2,2,1,1,1] => [1,0,1,1,0,0,1,1,0,0,1,0,1,0,1,0]
=> [2,1,4,3,6,7,8,5] => ? = 3
1011101 => [1,2,1,1,2,1] => [1,0,1,1,0,0,1,0,1,0,1,1,0,0,1,0]
=> [2,1,4,5,6,3,8,7] => ? = 3
1011111 => [1,2,1,1,1,1,1] => [1,0,1,1,0,0,1,0,1,0,1,0,1,0,1,0]
=> [2,1,4,5,6,7,8,3] => ? = 2
1101011 => [1,1,2,2,1,1] => [1,0,1,0,1,1,0,0,1,1,0,0,1,0,1,0]
=> [2,3,1,5,4,7,8,6] => ? = 3
1110101 => [1,1,1,2,2,1] => [1,0,1,0,1,0,1,1,0,0,1,1,0,0,1,0]
=> [2,3,4,1,6,5,8,7] => ? = 3
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,8,9,7] => ? = 1
00000111 => [6,1,1,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0,1,0]
=> [1,2,3,4,5,7,8,9,6] => ? = 1
00001111 => [5,1,1,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,6,7,8,9,5] => ? = 1
00011111 => [4,1,1,1,1,1] => [1,1,1,1,0,0,0,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,5,6,7,8,9,4] => ? = 1
00111111 => [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]
=> [1,2,4,5,6,7,8,9,3] => ? = 1
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,3,4,5,6,7,8,9,2] => ? = 1
000000010 => [8,2] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,1,0,0]
=> [1,2,3,4,5,6,7,9,8,10] => ? = 1
000000011 => [8,1,1] => [1,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0,1,0]
=> [1,2,3,4,5,6,7,9,10,8] => ? = 1
000000111 => [7,1,1,1] => [1,1,1,1,1,1,1,0,0,0,0,0,0,0,1,0,1,0,1,0]
=> [1,2,3,4,5,6,8,9,10,7] => ? = 1
000001000 => [6,4] => [1,1,1,1,1,1,0,0,0,0,0,0,1,1,1,1,0,0,0,0]
=> [1,2,3,4,5,7,6,8,9,10] => ? = 1
000001111 => [6,1,1,1,1] => [1,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,5,7,8,9,10,6] => ? = 1
000011111 => [5,1,1,1,1,1] => [1,1,1,1,1,0,0,0,0,0,1,0,1,0,1,0,1,0,1,0]
=> [1,2,3,4,6,7,8,9,10,5] => ? = 1
000100000 => [4,6] => [1,1,1,1,0,0,0,0,1,1,1,1,1,1,0,0,0,0,0,0]
=> [1,2,3,5,4,6,7,8,9,10] => ? = 1
000100010 => [4,4,2] => [1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0,1,1,0,0]
=> [1,2,3,5,4,6,7,9,8,10] => ? = 2
000101000 => [4,2,4] => [1,1,1,1,0,0,0,0,1,1,0,0,1,1,1,1,0,0,0,0]
=> [1,2,3,5,4,7,6,8,9,10] => ? = 2
Description
The number of deficiencies of a permutation.
This is defined as
$$\operatorname{dec}(\sigma)=\#\{i:\sigma(i) < i\}.$$
The number of exceedances is [[St000155]].
The following 39 statistics, ordered by result quality, also match your data. Click on any of them to see the details.
St000884The number of isolated descents of a permutation. St000994The number of cycle peaks and the number of cycle valleys of a permutation. St000337The lec statistic, the sum of the inversion numbers of the hook factors of a permutation. St000985The number of positive eigenvalues of the adjacency matrix of the graph. St001512The minimum rank of a graph. St001674The number of vertices of the largest induced star graph in the graph. St001011Number of simple modules of projective dimension 2 in the Nakayama algebra corresponding to the Dyck path. St000024The number of double up and double down steps of a Dyck path. St001007Number of simple modules with projective dimension 1 in the Nakayama algebra corresponding to the Dyck path. St001354The number of series nodes in the modular decomposition of a graph. St000299The number of nonisomorphic vertex-induced subtrees. St001269The sum of the minimum of the number of exceedances and deficiencies in each cycle of a permutation. St001489The maximum of the number of descents and the number of inverse descents. St001665The number of pure excedances of a permutation. St001729The number of visible descents of a permutation. St001737The number of descents of type 2 in a permutation. St001928The number of non-overlapping descents in a permutation. St000470The number of runs in a permutation. St000354The number of recoils of a permutation. St000829The Ulam distance of a permutation to the identity permutation. St001188The number of simple modules $S$ with grade $\inf \{ i \geq 0 | Ext^i(S,A) \neq 0 \}$ at least two in the Nakayama algebra $A$ corresponding to the Dyck path. St001212The number of simple modules in the corresponding Nakayama algebra that have non-zero second Ext-group with the regular module. St001215Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001222Number of simple modules in the corresponding LNakayama algebra that have a unique 2-extension with the regular module. St001244The number of simple modules of projective dimension one that are not 1-regular for the Nakayama algebra associated to a Dyck path. St000021The number of descents of a permutation. St000162The number of nontrivial cycles in the cycle decomposition of a permutation. St000238The number of indices that are not small weak excedances. St000316The number of non-left-to-right-maxima of a permutation. St001874Lusztig's a-function for the symmetric group. St000325The width of the tree associated to a permutation. St000443The number of long tunnels of a Dyck path. St001187The number of simple modules with grade at least one in the corresponding Nakayama algebra. St001224Let X be the direct sum of all simple modules of the corresponding Nakayama algebra. St001859The number of factors of the Stanley symmetric function associated with a permutation. St000353The number of inner valleys of a permutation. St000711The number of big exceedences of a permutation. St001553The number of indecomposable summands of the square of the Jacobson radical as a bimodule in the Nakayama algebra corresponding to the Dyck path. St000092The number of outer peaks of a permutation.
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!