Your data matches 2 different statistics following compositions of up to 3 maps.
(click to perform a complete search on your data)
Matching statistic: St000297
Mapping
Mp00317: Integer partitions —odd parts⟶ Binary words
Mp00278: Binary words —rowmotion⟶ Binary words
Mp00104: Binary words —reverse⟶ Binary words
St000297: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
 => 1 => 1 => 1 => 1
[2]
 => 0 => 0 => 0 => 0
[1,1]
 => 11 => 11 => 11 => 2
[3]
 => 1 => 1 => 1 => 1
[2,1]
 => 01 => 10 => 01 => 0
[1,1,1]
 => 111 => 111 => 111 => 3
[4]
 => 0 => 0 => 0 => 0
[3,1]
 => 11 => 11 => 11 => 2
[2,2]
 => 00 => 00 => 00 => 0
[2,1,1]
 => 011 => 101 => 101 => 1
[1,1,1,1]
 => 1111 => 1111 => 1111 => 4
[5]
 => 1 => 1 => 1 => 1
[4,1]
 => 01 => 10 => 01 => 0
[3,2]
 => 10 => 01 => 10 => 1
[3,1,1]
 => 111 => 111 => 111 => 3
[2,2,1]
 => 001 => 010 => 010 => 0
[2,1,1,1]
 => 0111 => 1011 => 1101 => 2
[1,1,1,1,1]
 => 11111 => 11111 => 11111 => 5
[6]
 => 0 => 0 => 0 => 0
[5,1]
 => 11 => 11 => 11 => 2
[4,2]
 => 00 => 00 => 00 => 0
[4,1,1]
 => 011 => 101 => 101 => 1
[3,3]
 => 11 => 11 => 11 => 2
[3,2,1]
 => 101 => 110 => 011 => 0
[3,1,1,1]
 => 1111 => 1111 => 1111 => 4
[2,2,2]
 => 000 => 000 => 000 => 0
[2,2,1,1]
 => 0011 => 0101 => 1010 => 1
[2,1,1,1,1]
 => 01111 => 10111 => 11101 => 3
[1,1,1,1,1,1]
 => 111111 => 111111 => 111111 => 6
[7]
 => 1 => 1 => 1 => 1
[6,1]
 => 01 => 10 => 01 => 0
[5,2]
 => 10 => 01 => 10 => 1
[5,1,1]
 => 111 => 111 => 111 => 3
[4,3]
 => 01 => 10 => 01 => 0
[4,2,1]
 => 001 => 010 => 010 => 0
[4,1,1,1]
 => 0111 => 1011 => 1101 => 2
[3,3,1]
 => 111 => 111 => 111 => 3
[3,2,2]
 => 100 => 001 => 100 => 1
[3,2,1,1]
 => 1011 => 1101 => 1011 => 1
[3,1,1,1,1]
 => 11111 => 11111 => 11111 => 5
[2,2,2,1]
 => 0001 => 0010 => 0100 => 0
[2,2,1,1,1]
 => 00111 => 01011 => 11010 => 2
[2,1,1,1,1,1]
 => 011111 => 101111 => 111101 => 4
[1,1,1,1,1,1,1]
 => 1111111 => 1111111 => 1111111 => 7
[8]
 => 0 => 0 => 0 => 0
[7,1]
 => 11 => 11 => 11 => 2
[6,2]
 => 00 => 00 => 00 => 0
[6,1,1]
 => 011 => 101 => 101 => 1
[5,3]
 => 11 => 11 => 11 => 2
[5,2,1]
 => 101 => 110 => 011 => 0
Description
The number of leading ones in a binary word.
Matching statistic: St000326
Mapping
Mp00317: Integer partitions —odd parts⟶ Binary words
Mp00105: Binary words —complement⟶ Binary words
Mp00096: Binary words —Foata bijection⟶ Binary words
St000326: Binary words ⟶ ℤResult quality: 100% ●values known / values provided: 100%●distinct values known / distinct values provided: 100%
Values
[1]
 => 1 => 0 => 0 => 2 = 1 + 1
[2]
 => 0 => 1 => 1 => 1 = 0 + 1
[1,1]
 => 11 => 00 => 00 => 3 = 2 + 1
[3]
 => 1 => 0 => 0 => 2 = 1 + 1
[2,1]
 => 01 => 10 => 10 => 1 = 0 + 1
[1,1,1]
 => 111 => 000 => 000 => 4 = 3 + 1
[4]
 => 0 => 1 => 1 => 1 = 0 + 1
[3,1]
 => 11 => 00 => 00 => 3 = 2 + 1
[2,2]
 => 00 => 11 => 11 => 1 = 0 + 1
[2,1,1]
 => 011 => 100 => 010 => 2 = 1 + 1
[1,1,1,1]
 => 1111 => 0000 => 0000 => 5 = 4 + 1
[5]
 => 1 => 0 => 0 => 2 = 1 + 1
[4,1]
 => 01 => 10 => 10 => 1 = 0 + 1
[3,2]
 => 10 => 01 => 01 => 2 = 1 + 1
[3,1,1]
 => 111 => 000 => 000 => 4 = 3 + 1
[2,2,1]
 => 001 => 110 => 110 => 1 = 0 + 1
[2,1,1,1]
 => 0111 => 1000 => 0010 => 3 = 2 + 1
[1,1,1,1,1]
 => 11111 => 00000 => 00000 => 6 = 5 + 1
[6]
 => 0 => 1 => 1 => 1 = 0 + 1
[5,1]
 => 11 => 00 => 00 => 3 = 2 + 1
[4,2]
 => 00 => 11 => 11 => 1 = 0 + 1
[4,1,1]
 => 011 => 100 => 010 => 2 = 1 + 1
[3,3]
 => 11 => 00 => 00 => 3 = 2 + 1
[3,2,1]
 => 101 => 010 => 100 => 1 = 0 + 1
[3,1,1,1]
 => 1111 => 0000 => 0000 => 5 = 4 + 1
[2,2,2]
 => 000 => 111 => 111 => 1 = 0 + 1
[2,2,1,1]
 => 0011 => 1100 => 0110 => 2 = 1 + 1
[2,1,1,1,1]
 => 01111 => 10000 => 00010 => 4 = 3 + 1
[1,1,1,1,1,1]
 => 111111 => 000000 => 000000 => 7 = 6 + 1
[7]
 => 1 => 0 => 0 => 2 = 1 + 1
[6,1]
 => 01 => 10 => 10 => 1 = 0 + 1
[5,2]
 => 10 => 01 => 01 => 2 = 1 + 1
[5,1,1]
 => 111 => 000 => 000 => 4 = 3 + 1
[4,3]
 => 01 => 10 => 10 => 1 = 0 + 1
[4,2,1]
 => 001 => 110 => 110 => 1 = 0 + 1
[4,1,1,1]
 => 0111 => 1000 => 0010 => 3 = 2 + 1
[3,3,1]
 => 111 => 000 => 000 => 4 = 3 + 1
[3,2,2]
 => 100 => 011 => 011 => 2 = 1 + 1
[3,2,1,1]
 => 1011 => 0100 => 0100 => 2 = 1 + 1
[3,1,1,1,1]
 => 11111 => 00000 => 00000 => 6 = 5 + 1
[2,2,2,1]
 => 0001 => 1110 => 1110 => 1 = 0 + 1
[2,2,1,1,1]
 => 00111 => 11000 => 00110 => 3 = 2 + 1
[2,1,1,1,1,1]
 => 011111 => 100000 => 000010 => 5 = 4 + 1
[1,1,1,1,1,1,1]
 => 1111111 => 0000000 => 0000000 => 8 = 7 + 1
[8]
 => 0 => 1 => 1 => 1 = 0 + 1
[7,1]
 => 11 => 00 => 00 => 3 = 2 + 1
[6,2]
 => 00 => 11 => 11 => 1 = 0 + 1
[6,1,1]
 => 011 => 100 => 010 => 2 = 1 + 1
[5,3]
 => 11 => 00 => 00 => 3 = 2 + 1
[5,2,1]
 => 101 => 010 => 100 => 1 = 0 + 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.