Identifier
-
Mp00093:
Dyck paths
—to binary word⟶
Binary words
Mp00105: Binary words —complement⟶ Binary words
St000983: Binary words ⟶ ℤ
Values
[1,0] => 10 => 01 => 2
[1,0,1,0] => 1010 => 0101 => 4
[1,1,0,0] => 1100 => 0011 => 2
[1,0,1,0,1,0] => 101010 => 010101 => 6
[1,0,1,1,0,0] => 101100 => 010011 => 3
[1,1,0,0,1,0] => 110010 => 001101 => 3
[1,1,0,1,0,0] => 110100 => 001011 => 4
[1,1,1,0,0,0] => 111000 => 000111 => 2
[1,0,1,0,1,0,1,0] => 10101010 => 01010101 => 8
[1,0,1,0,1,1,0,0] => 10101100 => 01010011 => 5
[1,0,1,1,0,0,1,0] => 10110010 => 01001101 => 3
[1,0,1,1,0,1,0,0] => 10110100 => 01001011 => 4
[1,0,1,1,1,0,0,0] => 10111000 => 01000111 => 3
[1,1,0,0,1,0,1,0] => 11001010 => 00110101 => 5
[1,1,0,0,1,1,0,0] => 11001100 => 00110011 => 2
[1,1,0,1,0,0,1,0] => 11010010 => 00101101 => 4
[1,1,0,1,0,1,0,0] => 11010100 => 00101011 => 6
[1,1,0,1,1,0,0,0] => 11011000 => 00100111 => 3
[1,1,1,0,0,0,1,0] => 11100010 => 00011101 => 3
[1,1,1,0,0,1,0,0] => 11100100 => 00011011 => 3
[1,1,1,0,1,0,0,0] => 11101000 => 00010111 => 4
[1,1,1,1,0,0,0,0] => 11110000 => 00001111 => 2
[1,1,0,1,0,1,0,0,1,0] => 1101010010 => 0010101101 => 6
[1,1,0,1,0,1,0,1,0,0] => 1101010100 => 0010101011 => 8
[1,1,0,1,0,1,1,0,0,0] => 1101011000 => 0010100111 => 5
[1,1,0,1,1,0,0,0,1,0] => 1101100010 => 0010011101 => 3
[1,1,0,1,1,0,0,1,0,0] => 1101100100 => 0010011011 => 3
[1,1,0,1,1,0,1,0,0,0] => 1101101000 => 0010010111 => 4
[1,1,0,1,1,1,0,0,0,0] => 1101110000 => 0010001111 => 3
[1,1,1,0,0,0,1,0,1,0] => 1110001010 => 0001110101 => 5
[1,1,1,0,0,0,1,1,0,0] => 1110001100 => 0001110011 => 2
[1,1,1,0,0,1,0,0,1,0] => 1110010010 => 0001101101 => 3
[1,1,1,0,0,1,0,1,0,0] => 1110010100 => 0001101011 => 5
[1,1,1,0,0,1,1,0,0,0] => 1110011000 => 0001100111 => 2
[1,1,1,0,1,0,0,0,1,0] => 1110100010 => 0001011101 => 4
[1,1,1,0,1,0,0,1,0,0] => 1110100100 => 0001011011 => 4
[1,1,1,0,1,0,1,0,0,0] => 1110101000 => 0001010111 => 6
[1,1,1,0,1,1,0,0,0,0] => 1110110000 => 0001001111 => 3
[1,1,1,1,0,0,0,0,1,0] => 1111000010 => 0000111101 => 3
[1,1,1,1,0,0,0,1,0,0] => 1111000100 => 0000111011 => 3
[1,1,1,1,0,0,1,0,0,0] => 1111001000 => 0000110111 => 3
[1,1,1,1,0,1,0,0,0,0] => 1111010000 => 0000101111 => 4
[1,1,1,1,1,0,0,0,0,0] => 1111100000 => 0000011111 => 2
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 length of the longest alternating subword.
This is the length of the longest consecutive subword of the form $010...$ or of the form $101...$.
This is the length of the longest consecutive subword of the form $010...$ or of the form $101...$.
Map
to binary word
Description
Return the Dyck word as binary word.
Map
complement
Description
Send a binary word to the word obtained by interchanging the two letters.
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!