Identifier
-
Mp00093:
Dyck paths
—to binary word⟶
Binary words
Mp00135: Binary words —rotate front-to-back⟶ Binary words
St000326: Binary words ⟶ ℤ
Values
[1,0] => 10 => 01 => 2
[1,0,1,0] => 1010 => 0101 => 2
[1,1,0,0] => 1100 => 1001 => 1
[1,0,1,0,1,0] => 101010 => 010101 => 2
[1,0,1,1,0,0] => 101100 => 011001 => 2
[1,1,0,0,1,0] => 110010 => 100101 => 1
[1,1,0,1,0,0] => 110100 => 101001 => 1
[1,1,1,0,0,0] => 111000 => 110001 => 1
[1,0,1,0,1,0,1,0] => 10101010 => 01010101 => 2
[1,0,1,0,1,1,0,0] => 10101100 => 01011001 => 2
[1,0,1,1,0,0,1,0] => 10110010 => 01100101 => 2
[1,0,1,1,0,1,0,0] => 10110100 => 01101001 => 2
[1,0,1,1,1,0,0,0] => 10111000 => 01110001 => 2
[1,1,0,0,1,0,1,0] => 11001010 => 10010101 => 1
[1,1,0,0,1,1,0,0] => 11001100 => 10011001 => 1
[1,1,0,1,0,0,1,0] => 11010010 => 10100101 => 1
[1,1,0,1,0,1,0,0] => 11010100 => 10101001 => 1
[1,1,0,1,1,0,0,0] => 11011000 => 10110001 => 1
[1,1,1,0,0,0,1,0] => 11100010 => 11000101 => 1
[1,1,1,0,0,1,0,0] => 11100100 => 11001001 => 1
[1,1,1,0,1,0,0,0] => 11101000 => 11010001 => 1
[1,1,1,1,0,0,0,0] => 11110000 => 11100001 => 1
[1,0,1,0,1,0,1,0,1,0] => 1010101010 => 0101010101 => 2
[1,0,1,0,1,0,1,1,0,0] => 1010101100 => 0101011001 => 2
[1,0,1,0,1,1,0,0,1,0] => 1010110010 => 0101100101 => 2
[1,0,1,0,1,1,0,1,0,0] => 1010110100 => 0101101001 => 2
[1,0,1,0,1,1,1,0,0,0] => 1010111000 => 0101110001 => 2
[1,0,1,1,0,0,1,0,1,0] => 1011001010 => 0110010101 => 2
[1,0,1,1,0,0,1,1,0,0] => 1011001100 => 0110011001 => 2
[1,0,1,1,0,1,0,0,1,0] => 1011010010 => 0110100101 => 2
[1,0,1,1,0,1,0,1,0,0] => 1011010100 => 0110101001 => 2
[1,0,1,1,0,1,1,0,0,0] => 1011011000 => 0110110001 => 2
[1,0,1,1,1,0,0,0,1,0] => 1011100010 => 0111000101 => 2
[1,0,1,1,1,0,0,1,0,0] => 1011100100 => 0111001001 => 2
[1,0,1,1,1,0,1,0,0,0] => 1011101000 => 0111010001 => 2
[1,0,1,1,1,1,0,0,0,0] => 1011110000 => 0111100001 => 2
[1,1,0,0,1,0,1,0,1,0] => 1100101010 => 1001010101 => 1
[1,1,0,0,1,0,1,1,0,0] => 1100101100 => 1001011001 => 1
[1,1,0,0,1,1,0,0,1,0] => 1100110010 => 1001100101 => 1
[1,1,0,0,1,1,0,1,0,0] => 1100110100 => 1001101001 => 1
[1,1,0,0,1,1,1,0,0,0] => 1100111000 => 1001110001 => 1
[1,1,0,1,0,0,1,0,1,0] => 1101001010 => 1010010101 => 1
[1,1,0,1,0,0,1,1,0,0] => 1101001100 => 1010011001 => 1
[1,1,0,1,0,1,0,0,1,0] => 1101010010 => 1010100101 => 1
[1,1,0,1,0,1,0,1,0,0] => 1101010100 => 1010101001 => 1
[1,1,0,1,0,1,1,0,0,0] => 1101011000 => 1010110001 => 1
[1,1,0,1,1,0,0,0,1,0] => 1101100010 => 1011000101 => 1
[1,1,0,1,1,0,0,1,0,0] => 1101100100 => 1011001001 => 1
[1,1,0,1,1,0,1,0,0,0] => 1101101000 => 1011010001 => 1
[1,1,0,1,1,1,0,0,0,0] => 1101110000 => 1011100001 => 1
[1,1,1,0,0,0,1,0,1,0] => 1110001010 => 1100010101 => 1
[1,1,1,0,0,0,1,1,0,0] => 1110001100 => 1100011001 => 1
[1,1,1,0,0,1,0,0,1,0] => 1110010010 => 1100100101 => 1
[1,1,1,0,0,1,0,1,0,0] => 1110010100 => 1100101001 => 1
[1,1,1,0,0,1,1,0,0,0] => 1110011000 => 1100110001 => 1
[1,1,1,0,1,0,0,0,1,0] => 1110100010 => 1101000101 => 1
[1,1,1,0,1,0,0,1,0,0] => 1110100100 => 1101001001 => 1
[1,1,1,0,1,0,1,0,0,0] => 1110101000 => 1101010001 => 1
[1,1,1,0,1,1,0,0,0,0] => 1110110000 => 1101100001 => 1
[1,1,1,1,0,0,0,0,1,0] => 1111000010 => 1110000101 => 1
[1,1,1,1,0,0,0,1,0,0] => 1111000100 => 1110001001 => 1
[1,1,1,1,0,0,1,0,0,0] => 1111001000 => 1110010001 => 1
[1,1,1,1,0,1,0,0,0,0] => 1111010000 => 1110100001 => 1
[1,1,1,1,1,0,0,0,0,0] => 1111100000 => 1111000001 => 1
[1,0,1,0,1,0,1,0,1,0,1,0] => 101010101010 => 010101010101 => 2
[1,0,1,0,1,0,1,0,1,1,0,0] => 101010101100 => 010101011001 => 2
[1,0,1,0,1,0,1,1,0,0,1,0] => 101010110010 => 010101100101 => 2
[1,0,1,0,1,0,1,1,0,1,0,0] => 101010110100 => 010101101001 => 2
[1,0,1,0,1,0,1,1,1,0,0,0] => 101010111000 => 010101110001 => 2
[1,0,1,0,1,1,0,0,1,0,1,0] => 101011001010 => 010110010101 => 2
[1,0,1,0,1,1,0,0,1,1,0,0] => 101011001100 => 010110011001 => 2
[1,0,1,0,1,1,0,1,0,0,1,0] => 101011010010 => 010110100101 => 2
[1,0,1,0,1,1,0,1,0,1,0,0] => 101011010100 => 010110101001 => 2
[1,0,1,0,1,1,0,1,1,0,0,0] => 101011011000 => 010110110001 => 2
[1,0,1,0,1,1,1,0,0,0,1,0] => 101011100010 => 010111000101 => 2
[1,0,1,0,1,1,1,0,0,1,0,0] => 101011100100 => 010111001001 => 2
[1,0,1,0,1,1,1,0,1,0,0,0] => 101011101000 => 010111010001 => 2
[1,0,1,0,1,1,1,1,0,0,0,0] => 101011110000 => 010111100001 => 2
[1,0,1,1,0,0,1,0,1,0,1,0] => 101100101010 => 011001010101 => 2
[1,0,1,1,0,0,1,0,1,1,0,0] => 101100101100 => 011001011001 => 2
[1,0,1,1,0,0,1,1,0,0,1,0] => 101100110010 => 011001100101 => 2
[1,0,1,1,0,0,1,1,0,1,0,0] => 101100110100 => 011001101001 => 2
[1,0,1,1,0,0,1,1,1,0,0,0] => 101100111000 => 011001110001 => 2
[1,0,1,1,0,1,0,0,1,0,1,0] => 101101001010 => 011010010101 => 2
[1,0,1,1,0,1,0,0,1,1,0,0] => 101101001100 => 011010011001 => 2
[1,0,1,1,0,1,0,1,0,0,1,0] => 101101010010 => 011010100101 => 2
[1,0,1,1,0,1,0,1,0,1,0,0] => 101101010100 => 011010101001 => 2
[1,0,1,1,0,1,0,1,1,0,0,0] => 101101011000 => 011010110001 => 2
[1,0,1,1,0,1,1,0,0,0,1,0] => 101101100010 => 011011000101 => 2
[1,0,1,1,0,1,1,0,0,1,0,0] => 101101100100 => 011011001001 => 2
[1,0,1,1,0,1,1,0,1,0,0,0] => 101101101000 => 011011010001 => 2
[1,0,1,1,0,1,1,1,0,0,0,0] => 101101110000 => 011011100001 => 2
[1,0,1,1,1,0,0,0,1,0,1,0] => 101110001010 => 011100010101 => 2
[1,0,1,1,1,0,0,0,1,1,0,0] => 101110001100 => 011100011001 => 2
[1,0,1,1,1,0,0,1,0,0,1,0] => 101110010010 => 011100100101 => 2
[1,0,1,1,1,0,0,1,0,1,0,0] => 101110010100 => 011100101001 => 2
[1,0,1,1,1,0,0,1,1,0,0,0] => 101110011000 => 011100110001 => 2
[1,0,1,1,1,0,1,0,0,0,1,0] => 101110100010 => 011101000101 => 2
[1,0,1,1,1,0,1,0,0,1,0,0] => 101110100100 => 011101001001 => 2
[1,0,1,1,1,0,1,0,1,0,0,0] => 101110101000 => 011101010001 => 2
[1,0,1,1,1,0,1,1,0,0,0,0] => 101110110000 => 011101100001 => 2
>>> Load all 196 entries. <<<
search for individual values
searching the database for the individual values of this statistic
/
search for generating function
searching the database for statistics with the same generating function
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.
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.
Map
to binary word
Description
Return the Dyck word as binary word.
Map
rotate front-to-back
Description
The rotation of a binary word, first letter last.
This is the word obtained by moving the first letter to the end.
This is the word obtained by moving the first letter to the end.
searching the database
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!