- FindStat

Identifier

St000294: Binary words ⟶ ℤ

Values

0 => 2

1 => 2

00 => 3

01 => 4

10 => 4

11 => 3

000 => 4

001 => 6

010 => 6

011 => 6

100 => 6

101 => 6

110 => 6

111 => 4

0000 => 5

0001 => 8

0010 => 9

0011 => 9

0100 => 9

0101 => 8

0110 => 9

0111 => 8

1000 => 8

1001 => 9

1010 => 8

1011 => 9

1100 => 9

1101 => 9

1110 => 8

1111 => 5

00000 => 6

00001 => 10

00010 => 12

00011 => 12

00100 => 12

00101 => 12

00110 => 13

00111 => 12

01000 => 12

01001 => 12

01010 => 10

01011 => 12

01100 => 13

01101 => 12

01110 => 12

01111 => 10

10000 => 10

10001 => 12

10010 => 12

10011 => 13

10100 => 12

10101 => 10

10110 => 12

10111 => 12

11000 => 12

11001 => 13

11010 => 12

11011 => 12

11100 => 12

11101 => 12

11110 => 10

11111 => 6

000000 => 7

000001 => 12

000010 => 15

000011 => 15

000100 => 16

000101 => 16

000110 => 17

000111 => 16

001000 => 16

001001 => 15

001010 => 15

001011 => 17

001100 => 17

001101 => 17

001110 => 17

001111 => 15

010000 => 15

010001 => 16

010010 => 15

010011 => 17

010100 => 15

010101 => 12

010110 => 16

010111 => 16

011000 => 17

011001 => 17

011010 => 16

011011 => 15

011100 => 17

011101 => 16

011110 => 15

011111 => 12

100000 => 12

100001 => 15

100010 => 16

100011 => 17

100100 => 15

100101 => 16

100110 => 17

>>> Load all 1200 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 number of distinct factors of a binary word.
This is also known as the subword complexity of a binary word, see [1].

References

[1] wikipedia:Complexity_function

Code

def statistic(x):
    return x.number_of_factors()

Created

Nov 19, 2015 at 12:16 by Martin Rubey

Updated

Jun 03, 2016 at 11:21 by Martin Rubey