- FindStat

Identifier

Mp00178: Binary words —to composition⟶ Integer compositions
Mp00094: Integer compositions —to binary word⟶ Binary words
St000982: Binary words ⟶ ℤ

Values

0 => [2] => 10 => 1

1 => [1,1] => 11 => 2

00 => [3] => 100 => 2

01 => [2,1] => 101 => 1

10 => [1,2] => 110 => 2

11 => [1,1,1] => 111 => 3

000 => [4] => 1000 => 3

001 => [3,1] => 1001 => 2

010 => [2,2] => 1010 => 1

011 => [2,1,1] => 1011 => 2

100 => [1,3] => 1100 => 2

101 => [1,2,1] => 1101 => 2

110 => [1,1,2] => 1110 => 3

111 => [1,1,1,1] => 1111 => 4

0000 => [5] => 10000 => 4

0001 => [4,1] => 10001 => 3

0010 => [3,2] => 10010 => 2

0011 => [3,1,1] => 10011 => 2

0100 => [2,3] => 10100 => 2

0101 => [2,2,1] => 10101 => 1

0110 => [2,1,2] => 10110 => 2

0111 => [2,1,1,1] => 10111 => 3

1000 => [1,4] => 11000 => 3

1001 => [1,3,1] => 11001 => 2

1010 => [1,2,2] => 11010 => 2

1011 => [1,2,1,1] => 11011 => 2

1100 => [1,1,3] => 11100 => 3

1101 => [1,1,2,1] => 11101 => 3

1110 => [1,1,1,2] => 11110 => 4

1111 => [1,1,1,1,1] => 11111 => 5

00000 => [6] => 100000 => 5

00001 => [5,1] => 100001 => 4

00010 => [4,2] => 100010 => 3

00011 => [4,1,1] => 100011 => 3

00100 => [3,3] => 100100 => 2

00101 => [3,2,1] => 100101 => 2

00110 => [3,1,2] => 100110 => 2

00111 => [3,1,1,1] => 100111 => 3

01000 => [2,4] => 101000 => 3

01001 => [2,3,1] => 101001 => 2

01010 => [2,2,2] => 101010 => 1

01011 => [2,2,1,1] => 101011 => 2

01100 => [2,1,3] => 101100 => 2

01101 => [2,1,2,1] => 101101 => 2

01110 => [2,1,1,2] => 101110 => 3

01111 => [2,1,1,1,1] => 101111 => 4

10000 => [1,5] => 110000 => 4

10001 => [1,4,1] => 110001 => 3

10010 => [1,3,2] => 110010 => 2

10011 => [1,3,1,1] => 110011 => 2

10100 => [1,2,3] => 110100 => 2

10101 => [1,2,2,1] => 110101 => 2

10110 => [1,2,1,2] => 110110 => 2

10111 => [1,2,1,1,1] => 110111 => 3

11000 => [1,1,4] => 111000 => 3

11001 => [1,1,3,1] => 111001 => 3

11010 => [1,1,2,2] => 111010 => 3

11011 => [1,1,2,1,1] => 111011 => 3

11100 => [1,1,1,3] => 111100 => 4

11101 => [1,1,1,2,1] => 111101 => 4

11110 => [1,1,1,1,2] => 111110 => 5

11111 => [1,1,1,1,1,1] => 111111 => 6

000000 => [7] => 1000000 => 6

000001 => [6,1] => 1000001 => 5

000010 => [5,2] => 1000010 => 4

000011 => [5,1,1] => 1000011 => 4

000100 => [4,3] => 1000100 => 3

000101 => [4,2,1] => 1000101 => 3

000110 => [4,1,2] => 1000110 => 3

000111 => [4,1,1,1] => 1000111 => 3

001000 => [3,4] => 1001000 => 3

001001 => [3,3,1] => 1001001 => 2

001010 => [3,2,2] => 1001010 => 2

001011 => [3,2,1,1] => 1001011 => 2

001100 => [3,1,3] => 1001100 => 2

001101 => [3,1,2,1] => 1001101 => 2

001110 => [3,1,1,2] => 1001110 => 3

001111 => [3,1,1,1,1] => 1001111 => 4

010000 => [2,5] => 1010000 => 4

010001 => [2,4,1] => 1010001 => 3

010010 => [2,3,2] => 1010010 => 2

010011 => [2,3,1,1] => 1010011 => 2

010100 => [2,2,3] => 1010100 => 2

010101 => [2,2,2,1] => 1010101 => 1

010110 => [2,2,1,2] => 1010110 => 2

010111 => [2,2,1,1,1] => 1010111 => 3

011000 => [2,1,4] => 1011000 => 3

011001 => [2,1,3,1] => 1011001 => 2

011010 => [2,1,2,2] => 1011010 => 2

011011 => [2,1,2,1,1] => 1011011 => 2

011100 => [2,1,1,3] => 1011100 => 3

011101 => [2,1,1,2,1] => 1011101 => 3

011110 => [2,1,1,1,2] => 1011110 => 4

011111 => [2,1,1,1,1,1] => 1011111 => 5

100000 => [1,6] => 1100000 => 5

100001 => [1,5,1] => 1100001 => 4

100010 => [1,4,2] => 1100010 => 3

100011 => [1,4,1,1] => 1100011 => 3

100100 => [1,3,3] => 1100100 => 2

100101 => [1,3,2,1] => 1100101 => 2

100110 => [1,3,1,2] => 1100110 => 2

>>> Load all 660 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

click to show known generating functions

Description

The length of the longest constant subword.

Map

to composition

Description

The composition corresponding to a binary word.
Prepending $1$ to a binary word $w$, the $i$-th part of the composition equals $1$ plus the number of zeros after the $i$-th $1$ in $w$.
This map is not surjective, since the empty composition does not have a preimage.

Map

to binary word

Description

Return the composition as a binary word, treating ones as separators.
Encoding a positive integer $i$ as the word $10\dots 0$ consisting of a one followed by $i-1$ zeros, the binary word of a composition $(i_1,\dots,i_k)$ is the concatenation of of words for $i_1,\dots,i_k$.
The image of this map contains precisely the words which do not begin with a $0$.