- FindStat

Identifier

Mp00224: Binary words —runsort⟶ Binary words
Mp00178: Binary words —to composition⟶ Integer compositions
Mp00040: Integer compositions —to partition⟶ Integer partitions
St000010: Integer partitions ⟶ ℤ

Values

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

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

00 => 00 => [3] => [3] => 1

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

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

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

000 => 000 => [4] => [4] => 1

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

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

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

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

101 => 011 => [2,1,1] => [2,1,1] => 3

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

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

0000 => 0000 => [5] => [5] => 1

0001 => 0001 => [4,1] => [4,1] => 2

0010 => 0001 => [4,1] => [4,1] => 2

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

0100 => 0001 => [4,1] => [4,1] => 2

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

0110 => 0011 => [3,1,1] => [3,1,1] => 3

0111 => 0111 => [2,1,1,1] => [2,1,1,1] => 4

1000 => 0001 => [4,1] => [4,1] => 2

1001 => 0011 => [3,1,1] => [3,1,1] => 3

1010 => 0011 => [3,1,1] => [3,1,1] => 3

1011 => 0111 => [2,1,1,1] => [2,1,1,1] => 4

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

1101 => 0111 => [2,1,1,1] => [2,1,1,1] => 4

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

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

00000 => 00000 => [6] => [6] => 1

00001 => 00001 => [5,1] => [5,1] => 2

00010 => 00001 => [5,1] => [5,1] => 2

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

00100 => 00001 => [5,1] => [5,1] => 2

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

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

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

01000 => 00001 => [5,1] => [5,1] => 2

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

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

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

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

01101 => 01011 => [2,2,1,1] => [2,2,1,1] => 4

01110 => 00111 => [3,1,1,1] => [3,1,1,1] => 4

01111 => 01111 => [2,1,1,1,1] => [2,1,1,1,1] => 5

10000 => 00001 => [5,1] => [5,1] => 2

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

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

10011 => 00111 => [3,1,1,1] => [3,1,1,1] => 4

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

10101 => 01011 => [2,2,1,1] => [2,2,1,1] => 4

10110 => 00111 => [3,1,1,1] => [3,1,1,1] => 4

10111 => 01111 => [2,1,1,1,1] => [2,1,1,1,1] => 5

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

11001 => 00111 => [3,1,1,1] => [3,1,1,1] => 4

11010 => 00111 => [3,1,1,1] => [3,1,1,1] => 4

11011 => 01111 => [2,1,1,1,1] => [2,1,1,1,1] => 5

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

11101 => 01111 => [2,1,1,1,1] => [2,1,1,1,1] => 5

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

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

000000 => 000000 => [7] => [7] => 1

000001 => 000001 => [6,1] => [6,1] => 2

000010 => 000001 => [6,1] => [6,1] => 2

000011 => 000011 => [5,1,1] => [5,1,1] => 3

000100 => 000001 => [6,1] => [6,1] => 2

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

000110 => 000011 => [5,1,1] => [5,1,1] => 3

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

001000 => 000001 => [6,1] => [6,1] => 2

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

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

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

001100 => 000011 => [5,1,1] => [5,1,1] => 3

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

001110 => 000111 => [4,1,1,1] => [4,1,1,1] => 4

001111 => 001111 => [3,1,1,1,1] => [3,1,1,1,1] => 5

010000 => 000001 => [6,1] => [6,1] => 2

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

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

010011 => 001101 => [3,1,2,1] => [3,2,1,1] => 4

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

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

010110 => 001011 => [3,2,1,1] => [3,2,1,1] => 4

010111 => 010111 => [2,2,1,1,1] => [2,2,1,1,1] => 5

011000 => 000011 => [5,1,1] => [5,1,1] => 3

011001 => 001011 => [3,2,1,1] => [3,2,1,1] => 4

011010 => 001011 => [3,2,1,1] => [3,2,1,1] => 4

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

011100 => 000111 => [4,1,1,1] => [4,1,1,1] => 4

011101 => 010111 => [2,2,1,1,1] => [2,2,1,1,1] => 5

011110 => 001111 => [3,1,1,1,1] => [3,1,1,1,1] => 5

011111 => 011111 => [2,1,1,1,1,1] => [2,1,1,1,1,1] => 6

100000 => 000001 => [6,1] => [6,1] => 2

100001 => 000011 => [5,1,1] => [5,1,1] => 3

100010 => 000011 => [5,1,1] => [5,1,1] => 3

100011 => 000111 => [4,1,1,1] => [4,1,1,1] => 4

100100 => 000011 => [5,1,1] => [5,1,1] => 3

100101 => 001011 => [3,2,1,1] => [3,2,1,1] => 4

100110 => 000111 => [4,1,1,1] => [4,1,1,1] => 4

>>> Load all 1887 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 partition.

Map

runsort

Description

The word obtained by sorting the weakly increasing runs lexicographically.

Map

to partition

Description

Sends a composition to the partition obtained by sorting the entries.

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.