Identifier
-
Mp00095:
Integer partitions
—to binary word⟶
Binary words
Mp00104: Binary words —reverse⟶ Binary words
Mp00135: Binary words —rotate front-to-back⟶ Binary words
St001313: Binary words ⟶ ℤ
Values
[1] => 10 => 01 => 10 => 1
[2] => 100 => 001 => 010 => 2
[1,1] => 110 => 011 => 110 => 1
[3] => 1000 => 0001 => 0010 => 3
[2,1] => 1010 => 0101 => 1010 => 2
[1,1,1] => 1110 => 0111 => 1110 => 1
[4] => 10000 => 00001 => 00010 => 4
[3,1] => 10010 => 01001 => 10010 => 3
[2,2] => 1100 => 0011 => 0110 => 3
[2,1,1] => 10110 => 01101 => 11010 => 2
[1,1,1,1] => 11110 => 01111 => 11110 => 1
[5] => 100000 => 000001 => 000010 => 5
[4,1] => 100010 => 010001 => 100010 => 4
[3,2] => 10100 => 00101 => 01010 => 5
[3,1,1] => 100110 => 011001 => 110010 => 3
[2,2,1] => 11010 => 01011 => 10110 => 3
[2,1,1,1] => 101110 => 011101 => 111010 => 2
[1,1,1,1,1] => 111110 => 011111 => 111110 => 1
[6] => 1000000 => 0000001 => 0000010 => 6
[5,1] => 1000010 => 0100001 => 1000010 => 5
[4,2] => 100100 => 001001 => 010010 => 7
[4,1,1] => 1000110 => 0110001 => 1100010 => 4
[3,3] => 11000 => 00011 => 00110 => 6
[3,2,1] => 101010 => 010101 => 101010 => 5
[3,1,1,1] => 1001110 => 0111001 => 1110010 => 3
[2,2,2] => 11100 => 00111 => 01110 => 4
[2,2,1,1] => 110110 => 011011 => 110110 => 3
[2,1,1,1,1] => 1011110 => 0111101 => 1111010 => 2
[1,1,1,1,1,1] => 1111110 => 0111111 => 1111110 => 1
[7] => 10000000 => 00000001 => 00000010 => 7
[6,1] => 10000010 => 01000001 => 10000010 => 6
[5,2] => 1000100 => 0010001 => 0100010 => 9
[5,1,1] => 10000110 => 01100001 => 11000010 => 5
[4,3] => 101000 => 000101 => 001010 => 9
[4,2,1] => 1001010 => 0101001 => 1010010 => 7
[4,1,1,1] => 10001110 => 01110001 => 11100010 => 4
[3,3,1] => 110010 => 010011 => 100110 => 6
[3,2,2] => 101100 => 001101 => 011010 => 7
[3,2,1,1] => 1010110 => 0110101 => 1101010 => 5
[3,1,1,1,1] => 10011110 => 01111001 => 11110010 => 3
[2,2,2,1] => 111010 => 010111 => 101110 => 4
[2,2,1,1,1] => 1101110 => 0111011 => 1110110 => 3
[2,1,1,1,1,1] => 10111110 => 01111101 => 11111010 => 2
[1,1,1,1,1,1,1] => 11111110 => 01111111 => 11111110 => 1
[8] => 100000000 => 000000001 => 000000010 => 8
[7,1] => 100000010 => 010000001 => 100000010 => 7
[6,2] => 10000100 => 00100001 => 01000010 => 11
[6,1,1] => 100000110 => 011000001 => 110000010 => 6
[5,3] => 1001000 => 0001001 => 0010010 => 12
[5,2,1] => 10001010 => 01010001 => 10100010 => 9
[5,1,1,1] => 100001110 => 011100001 => 111000010 => 5
[4,4] => 110000 => 000011 => 000110 => 10
[4,3,1] => 1010010 => 0100101 => 1001010 => 9
[4,2,2] => 1001100 => 0011001 => 0110010 => 10
[4,2,1,1] => 10010110 => 01101001 => 11010010 => 7
[4,1,1,1,1] => 100011110 => 011110001 => 111100010 => 4
[3,3,2] => 110100 => 001011 => 010110 => 9
[3,3,1,1] => 1100110 => 0110011 => 1100110 => 6
[3,2,2,1] => 1011010 => 0101101 => 1011010 => 7
[3,2,1,1,1] => 10101110 => 01110101 => 11101010 => 5
[3,1,1,1,1,1] => 100111110 => 011111001 => 111110010 => 3
[2,2,2,2] => 111100 => 001111 => 011110 => 5
[2,2,2,1,1] => 1110110 => 0110111 => 1101110 => 4
[2,2,1,1,1,1] => 11011110 => 01111011 => 11110110 => 3
[2,1,1,1,1,1,1] => 101111110 => 011111101 => 111111010 => 2
[1,1,1,1,1,1,1,1] => 111111110 => 011111111 => 111111110 => 1
[7,2] => 100000100 => 001000001 => 010000010 => 13
[6,3] => 10001000 => 00010001 => 00100010 => 15
[6,2,1] => 100001010 => 010100001 => 101000010 => 11
[5,4] => 1010000 => 0000101 => 0001010 => 14
[5,3,1] => 10010010 => 01001001 => 10010010 => 12
[5,2,2] => 10001100 => 00110001 => 01100010 => 13
[5,2,1,1] => 100010110 => 011010001 => 110100010 => 9
[4,4,1] => 1100010 => 0100011 => 1000110 => 10
[4,3,2] => 1010100 => 0010101 => 0101010 => 14
[4,3,1,1] => 10100110 => 01100101 => 11001010 => 9
[4,2,2,1] => 10011010 => 01011001 => 10110010 => 10
[4,2,1,1,1] => 100101110 => 011101001 => 111010010 => 7
[3,3,3] => 111000 => 000111 => 001110 => 10
[3,3,2,1] => 1101010 => 0101011 => 1010110 => 9
[3,3,1,1,1] => 11001110 => 01110011 => 11100110 => 6
[3,2,2,2] => 1011100 => 0011101 => 0111010 => 9
[3,2,2,1,1] => 10110110 => 01101101 => 11011010 => 7
[3,2,1,1,1,1] => 101011110 => 011110101 => 111101010 => 5
[2,2,2,2,1] => 1111010 => 0101111 => 1011110 => 5
[2,2,2,1,1,1] => 11101110 => 01110111 => 11101110 => 4
[2,2,1,1,1,1,1] => 110111110 => 011111011 => 111110110 => 3
[7,3] => 100001000 => 000100001 => 001000010 => 18
[6,4] => 10010000 => 00001001 => 00010010 => 18
[6,3,1] => 100010010 => 010010001 => 100100010 => 15
[6,2,2] => 100001100 => 001100001 => 011000010 => 16
[5,5] => 1100000 => 0000011 => 0000110 => 15
[5,4,1] => 10100010 => 01000101 => 10001010 => 14
[5,3,2] => 10010100 => 00101001 => 01010010 => 19
[5,3,1,1] => 100100110 => 011001001 => 110010010 => 12
[5,2,2,1] => 100011010 => 010110001 => 101100010 => 13
[4,4,2] => 1100100 => 0010011 => 0100110 => 16
[4,4,1,1] => 11000110 => 01100011 => 11000110 => 10
[4,3,3] => 1011000 => 0001101 => 0011010 => 16
[4,3,2,1] => 10101010 => 01010101 => 10101010 => 14
[4,3,1,1,1] => 101001110 => 011100101 => 111001010 => 9
>>> Load all 250 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 Dyck paths above the lattice path given by a binary word.
One may treat a binary word as a lattice path starting at the origin and treating $1$'s as steps $(1,0)$ and $0$'s as steps $(0,1)$. Given a binary word $w$, this statistic counts the number of lattice paths from the origin to the same endpoint as $w$ that stay weakly above $w$.
See St001312Number of parabolic noncrossing partitions indexed by the composition. for this statistic on compositions treated as bounce paths.
One may treat a binary word as a lattice path starting at the origin and treating $1$'s as steps $(1,0)$ and $0$'s as steps $(0,1)$. Given a binary word $w$, this statistic counts the number of lattice paths from the origin to the same endpoint as $w$ that stay weakly above $w$.
See St001312Number of parabolic noncrossing partitions indexed by the composition. for this statistic on compositions treated as bounce paths.
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.
Map
to binary word
Description
Return the partition as binary word, by traversing its shape from the first row to the last row, down steps as 1 and left steps as 0.
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!