Identifier
Values
[[1]] => [1] => [1,0,1,0] => 1010 => 1
[[1,2]] => [2] => [1,1,0,0,1,0] => 110010 => 2
[[1],[2]] => [1,1] => [1,0,1,1,0,0] => 101100 => 2
[[1,2,3]] => [3] => [1,1,1,0,0,0,1,0] => 11100010 => 2
[[1,3],[2]] => [2,1] => [1,0,1,0,1,0] => 101010 => 2
[[1,2],[3]] => [2,1] => [1,0,1,0,1,0] => 101010 => 2
[[1],[2],[3]] => [1,1,1] => [1,0,1,1,1,0,0,0] => 10111000 => 2
[[1,3,4],[2]] => [3,1] => [1,1,0,1,0,0,1,0] => 11010010 => 4
[[1,2,4],[3]] => [3,1] => [1,1,0,1,0,0,1,0] => 11010010 => 4
[[1,2,3],[4]] => [3,1] => [1,1,0,1,0,0,1,0] => 11010010 => 4
[[1,3],[2,4]] => [2,2] => [1,1,0,0,1,1,0,0] => 11001100 => 3
[[1,2],[3,4]] => [2,2] => [1,1,0,0,1,1,0,0] => 11001100 => 3
[[1,4],[2],[3]] => [2,1,1] => [1,0,1,1,0,1,0,0] => 10110100 => 4
[[1,3],[2],[4]] => [2,1,1] => [1,0,1,1,0,1,0,0] => 10110100 => 4
[[1,2],[3],[4]] => [2,1,1] => [1,0,1,1,0,1,0,0] => 10110100 => 4
[[1,3,5],[2,4]] => [3,2] => [1,1,0,0,1,0,1,0] => 11001010 => 4
[[1,2,5],[3,4]] => [3,2] => [1,1,0,0,1,0,1,0] => 11001010 => 4
[[1,3,4],[2,5]] => [3,2] => [1,1,0,0,1,0,1,0] => 11001010 => 4
[[1,2,4],[3,5]] => [3,2] => [1,1,0,0,1,0,1,0] => 11001010 => 4
[[1,2,3],[4,5]] => [3,2] => [1,1,0,0,1,0,1,0] => 11001010 => 4
[[1,4,5],[2],[3]] => [3,1,1] => [1,0,1,1,0,0,1,0] => 10110010 => 2
[[1,3,5],[2],[4]] => [3,1,1] => [1,0,1,1,0,0,1,0] => 10110010 => 2
[[1,2,5],[3],[4]] => [3,1,1] => [1,0,1,1,0,0,1,0] => 10110010 => 2
[[1,3,4],[2],[5]] => [3,1,1] => [1,0,1,1,0,0,1,0] => 10110010 => 2
[[1,2,4],[3],[5]] => [3,1,1] => [1,0,1,1,0,0,1,0] => 10110010 => 2
[[1,2,3],[4],[5]] => [3,1,1] => [1,0,1,1,0,0,1,0] => 10110010 => 2
[[1,4],[2,5],[3]] => [2,2,1] => [1,0,1,0,1,1,0,0] => 10101100 => 4
[[1,3],[2,5],[4]] => [2,2,1] => [1,0,1,0,1,1,0,0] => 10101100 => 4
[[1,2],[3,5],[4]] => [2,2,1] => [1,0,1,0,1,1,0,0] => 10101100 => 4
[[1,3],[2,4],[5]] => [2,2,1] => [1,0,1,0,1,1,0,0] => 10101100 => 4
[[1,2],[3,4],[5]] => [2,2,1] => [1,0,1,0,1,1,0,0] => 10101100 => 4
[[1,4,6],[2,5],[3]] => [3,2,1] => [1,0,1,0,1,0,1,0] => 10101010 => 3
[[1,3,6],[2,5],[4]] => [3,2,1] => [1,0,1,0,1,0,1,0] => 10101010 => 3
[[1,2,6],[3,5],[4]] => [3,2,1] => [1,0,1,0,1,0,1,0] => 10101010 => 3
[[1,3,6],[2,4],[5]] => [3,2,1] => [1,0,1,0,1,0,1,0] => 10101010 => 3
[[1,2,6],[3,4],[5]] => [3,2,1] => [1,0,1,0,1,0,1,0] => 10101010 => 3
[[1,4,5],[2,6],[3]] => [3,2,1] => [1,0,1,0,1,0,1,0] => 10101010 => 3
[[1,3,5],[2,6],[4]] => [3,2,1] => [1,0,1,0,1,0,1,0] => 10101010 => 3
[[1,2,5],[3,6],[4]] => [3,2,1] => [1,0,1,0,1,0,1,0] => 10101010 => 3
[[1,3,4],[2,6],[5]] => [3,2,1] => [1,0,1,0,1,0,1,0] => 10101010 => 3
[[1,2,4],[3,6],[5]] => [3,2,1] => [1,0,1,0,1,0,1,0] => 10101010 => 3
[[1,2,3],[4,6],[5]] => [3,2,1] => [1,0,1,0,1,0,1,0] => 10101010 => 3
[[1,3,5],[2,4],[6]] => [3,2,1] => [1,0,1,0,1,0,1,0] => 10101010 => 3
[[1,2,5],[3,4],[6]] => [3,2,1] => [1,0,1,0,1,0,1,0] => 10101010 => 3
[[1,3,4],[2,5],[6]] => [3,2,1] => [1,0,1,0,1,0,1,0] => 10101010 => 3
[[1,2,4],[3,5],[6]] => [3,2,1] => [1,0,1,0,1,0,1,0] => 10101010 => 3
[[1,2,3],[4,5],[6]] => [3,2,1] => [1,0,1,0,1,0,1,0] => 10101010 => 3
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 distinct squares in a binary word.
A factor of a word is a sequence of consecutive letters. This statistic records the number of distinct non-empty words $u$ such that $uu$ is a factor of the word.
Note that every word of length at least four contains a square.
Map
shape
Description
Sends a tableau to its shape.
Map
to Dyck path
Description
Sends a partition to the shortest Dyck path tracing the shape of its Ferrers diagram.
Map
to binary word
Description
Return the Dyck word as binary word.