Identifier
-
Mp00093:
Dyck paths
—to binary word⟶
Binary words
Mp00104: Binary words —reverse⟶ Binary words
St000876: Binary words ⟶ ℤ
Values
[1,0] => 10 => 01 => 2
[1,0,1,0] => 1010 => 0101 => 3
[1,1,0,0] => 1100 => 0011 => 4
[1,0,1,0,1,0] => 101010 => 010101 => 3
[1,0,1,1,0,0] => 101100 => 001101 => 4
[1,1,0,0,1,0] => 110010 => 010011 => 4
[1,1,0,1,0,0] => 110100 => 001011 => 5
[1,1,1,0,0,0] => 111000 => 000111 => 6
[1,0,1,0,1,0,1,0] => 10101010 => 01010101 => 3
[1,0,1,0,1,1,0,0] => 10101100 => 00110101 => 4
[1,0,1,1,0,0,1,0] => 10110010 => 01001101 => 4
[1,0,1,1,0,1,0,0] => 10110100 => 00101101 => 5
[1,0,1,1,1,0,0,0] => 10111000 => 00011101 => 6
[1,1,0,0,1,0,1,0] => 11001010 => 01010011 => 4
[1,1,0,0,1,1,0,0] => 11001100 => 00110011 => 5
[1,1,0,1,0,0,1,0] => 11010010 => 01001011 => 5
[1,1,0,1,0,1,0,0] => 11010100 => 00101011 => 5
[1,1,0,1,1,0,0,0] => 11011000 => 00011011 => 6
[1,1,1,0,0,0,1,0] => 11100010 => 01000111 => 6
[1,1,1,0,0,1,0,0] => 11100100 => 00100111 => 6
[1,1,1,0,1,0,0,0] => 11101000 => 00010111 => 7
[1,1,1,1,0,0,0,0] => 11110000 => 00001111 => 8
[1,0,1,0,1,0,1,0,1,0] => 1010101010 => 0101010101 => 3
[1,0,1,0,1,0,1,1,0,0] => 1010101100 => 0011010101 => 4
[1,0,1,0,1,1,0,0,1,0] => 1010110010 => 0100110101 => 4
[1,0,1,0,1,1,0,1,0,0] => 1010110100 => 0010110101 => 5
[1,0,1,0,1,1,1,0,0,0] => 1010111000 => 0001110101 => 6
[1,0,1,1,0,0,1,0,1,0] => 1011001010 => 0101001101 => 4
[1,0,1,1,0,0,1,1,0,0] => 1011001100 => 0011001101 => 5
[1,0,1,1,0,1,0,0,1,0] => 1011010010 => 0100101101 => 5
[1,0,1,1,0,1,0,1,0,0] => 1011010100 => 0010101101 => 5
[1,0,1,1,0,1,1,0,0,0] => 1011011000 => 0001101101 => 6
[1,0,1,1,1,0,0,0,1,0] => 1011100010 => 0100011101 => 6
[1,0,1,1,1,0,0,1,0,0] => 1011100100 => 0010011101 => 6
[1,0,1,1,1,0,1,0,0,0] => 1011101000 => 0001011101 => 7
[1,0,1,1,1,1,0,0,0,0] => 1011110000 => 0000111101 => 8
[1,1,0,0,1,0,1,0,1,0] => 1100101010 => 0101010011 => 4
[1,1,0,0,1,0,1,1,0,0] => 1100101100 => 0011010011 => 5
[1,1,0,0,1,1,0,0,1,0] => 1100110010 => 0100110011 => 5
[1,1,0,0,1,1,0,1,0,0] => 1100110100 => 0010110011 => 5
[1,1,0,0,1,1,1,0,0,0] => 1100111000 => 0001110011 => 6
[1,1,0,1,0,0,1,0,1,0] => 1101001010 => 0101001011 => 5
[1,1,0,1,0,0,1,1,0,0] => 1101001100 => 0011001011 => 5
[1,1,0,1,0,1,0,0,1,0] => 1101010010 => 0100101011 => 5
[1,1,0,1,0,1,0,1,0,0] => 1101010100 => 0010101011 => 5
[1,1,0,1,0,1,1,0,0,0] => 1101011000 => 0001101011 => 6
[1,1,0,1,1,0,0,0,1,0] => 1101100010 => 0100011011 => 6
[1,1,0,1,1,0,0,1,0,0] => 1101100100 => 0010011011 => 6
[1,1,0,1,1,0,1,0,0,0] => 1101101000 => 0001011011 => 7
[1,1,0,1,1,1,0,0,0,0] => 1101110000 => 0000111011 => 8
[1,1,1,0,0,0,1,0,1,0] => 1110001010 => 0101000111 => 6
[1,1,1,0,0,0,1,1,0,0] => 1110001100 => 0011000111 => 6
[1,1,1,0,0,1,0,0,1,0] => 1110010010 => 0100100111 => 6
[1,1,1,0,0,1,0,1,0,0] => 1110010100 => 0010100111 => 6
[1,1,1,0,0,1,1,0,0,0] => 1110011000 => 0001100111 => 7
[1,1,1,0,1,0,0,0,1,0] => 1110100010 => 0100010111 => 7
[1,1,1,0,1,0,0,1,0,0] => 1110100100 => 0010010111 => 7
[1,1,1,0,1,0,1,0,0,0] => 1110101000 => 0001010111 => 7
[1,1,1,0,1,1,0,0,0,0] => 1110110000 => 0000110111 => 8
[1,1,1,1,0,0,0,0,1,0] => 1111000010 => 0100001111 => 8
[1,1,1,1,0,0,0,1,0,0] => 1111000100 => 0010001111 => 8
[1,1,1,1,0,0,1,0,0,0] => 1111001000 => 0001001111 => 8
[1,1,1,1,0,1,0,0,0,0] => 1111010000 => 0000101111 => 9
[1,1,1,1,1,0,0,0,0,0] => 1111100000 => 0000011111 => 10
[1,0,1,0,1,0,1,0,1,0,1,0] => 101010101010 => 010101010101 => 3
[1,0,1,0,1,0,1,0,1,1,0,0] => 101010101100 => 001101010101 => 4
[1,0,1,0,1,0,1,1,0,0,1,0] => 101010110010 => 010011010101 => 4
[1,0,1,0,1,0,1,1,0,1,0,0] => 101010110100 => 001011010101 => 5
[1,0,1,0,1,0,1,1,1,0,0,0] => 101010111000 => 000111010101 => 6
[1,0,1,0,1,1,0,0,1,0,1,0] => 101011001010 => 010100110101 => 4
[1,0,1,0,1,1,0,0,1,1,0,0] => 101011001100 => 001100110101 => 5
[1,0,1,0,1,1,0,1,0,0,1,0] => 101011010010 => 010010110101 => 5
[1,0,1,0,1,1,0,1,0,1,0,0] => 101011010100 => 001010110101 => 5
[1,0,1,0,1,1,0,1,1,0,0,0] => 101011011000 => 000110110101 => 6
[1,0,1,0,1,1,1,0,0,0,1,0] => 101011100010 => 010001110101 => 6
[1,0,1,0,1,1,1,0,0,1,0,0] => 101011100100 => 001001110101 => 6
[1,0,1,0,1,1,1,0,1,0,0,0] => 101011101000 => 000101110101 => 7
[1,0,1,0,1,1,1,1,0,0,0,0] => 101011110000 => 000011110101 => 8
[1,0,1,1,0,0,1,0,1,0,1,0] => 101100101010 => 010101001101 => 4
[1,0,1,1,0,0,1,0,1,1,0,0] => 101100101100 => 001101001101 => 5
[1,0,1,1,0,0,1,1,0,0,1,0] => 101100110010 => 010011001101 => 5
[1,0,1,1,0,0,1,1,0,1,0,0] => 101100110100 => 001011001101 => 5
[1,0,1,1,0,0,1,1,1,0,0,0] => 101100111000 => 000111001101 => 6
[1,0,1,1,0,1,0,0,1,0,1,0] => 101101001010 => 010100101101 => 5
[1,0,1,1,0,1,0,0,1,1,0,0] => 101101001100 => 001100101101 => 5
[1,0,1,1,0,1,0,1,0,0,1,0] => 101101010010 => 010010101101 => 5
[1,0,1,1,0,1,0,1,0,1,0,0] => 101101010100 => 001010101101 => 5
[1,0,1,1,0,1,0,1,1,0,0,0] => 101101011000 => 000110101101 => 6
[1,0,1,1,0,1,1,0,0,0,1,0] => 101101100010 => 010001101101 => 6
[1,0,1,1,0,1,1,0,0,1,0,0] => 101101100100 => 001001101101 => 6
[1,0,1,1,0,1,1,0,1,0,0,0] => 101101101000 => 000101101101 => 7
[1,0,1,1,0,1,1,1,0,0,0,0] => 101101110000 => 000011101101 => 8
[1,0,1,1,1,0,0,0,1,0,1,0] => 101110001010 => 010100011101 => 6
[1,0,1,1,1,0,0,0,1,1,0,0] => 101110001100 => 001100011101 => 6
[1,0,1,1,1,0,0,1,0,0,1,0] => 101110010010 => 010010011101 => 6
[1,0,1,1,1,0,0,1,0,1,0,0] => 101110010100 => 001010011101 => 6
[1,0,1,1,1,0,0,1,1,0,0,0] => 101110011000 => 000110011101 => 7
[1,0,1,1,1,0,1,0,0,0,1,0] => 101110100010 => 010001011101 => 7
[1,0,1,1,1,0,1,0,0,1,0,0] => 101110100100 => 001001011101 => 7
[1,0,1,1,1,0,1,0,1,0,0,0] => 101110101000 => 000101011101 => 7
[1,0,1,1,1,0,1,1,0,0,0,0] => 101110110000 => 000011011101 => 8
>>> 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 number of factors in the Catalan decomposition of a binary word.
Every binary word can be written in a unique way as $(\mathcal D 0)^\ell \mathcal D (1 \mathcal D)^m$, where $\mathcal D$ is the set of Dyck words. This is the Catalan factorisation, see [1, sec.9.1.2].
This statistic records the number of factors in the Catalan factorisation, that is, $\ell + m$ if the middle Dyck word is empty and $\ell + 1 + m$ otherwise.
Every binary word can be written in a unique way as $(\mathcal D 0)^\ell \mathcal D (1 \mathcal D)^m$, where $\mathcal D$ is the set of Dyck words. This is the Catalan factorisation, see [1, sec.9.1.2].
This statistic records the number of factors in the Catalan factorisation, that is, $\ell + m$ if the middle Dyck word is empty and $\ell + 1 + m$ otherwise.
Map
to binary word
Description
Return the Dyck word as binary word.
Map
reverse
Description
Return the reversal of a binary word.
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!