- FindStat

Identifier

St001416: Binary words ⟶ ℤ

Values

0 => 1

1 => 1

00 => 2

01 => 1

10 => 1

11 => 2

000 => 3

001 => 2

010 => 3

011 => 2

100 => 2

101 => 3

110 => 2

111 => 3

0000 => 4

0001 => 3

0010 => 3

0011 => 2

0100 => 3

0101 => 3

0110 => 4

0111 => 3

1000 => 3

1001 => 4

1010 => 3

1011 => 3

1100 => 2

1101 => 3

1110 => 3

1111 => 4

00000 => 5

00001 => 4

00010 => 3

00011 => 3

00100 => 5

00101 => 3

00110 => 4

00111 => 3

01000 => 3

01001 => 4

01010 => 5

01011 => 3

01100 => 4

01101 => 4

01110 => 5

01111 => 4

10000 => 4

10001 => 5

10010 => 4

10011 => 4

10100 => 3

10101 => 5

10110 => 4

10111 => 3

11000 => 3

11001 => 4

11010 => 3

11011 => 5

11100 => 3

11101 => 3

11110 => 4

11111 => 5

000000 => 6

000001 => 5

000010 => 4

000011 => 4

000100 => 5

000101 => 3

000110 => 4

000111 => 3

001000 => 5

001001 => 5

001010 => 5

001011 => 3

001100 => 6

001101 => 4

001110 => 5

001111 => 4

010000 => 4

010001 => 5

010010 => 6

010011 => 4

010100 => 5

010101 => 5

010110 => 4

010111 => 3

011000 => 4

011001 => 4

011010 => 4

011011 => 5

011100 => 5

011101 => 5

011110 => 6

011111 => 5

100000 => 5

100001 => 6

100010 => 5

100011 => 5

100100 => 5

100101 => 4

100110 => 4

>>> Load all 1022 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 a longest palindromic factor of a binary word.
A factor of a word is a sequence of consecutive letters. This statistic records the maximal length of a palindromic factor.

Code

def statistic(w):
    return max(k-a for a in range(len(w)) for k in range(len(w)+1) if w[a:k] == w[a:k][::-1])

Created

Jun 11, 2019 at 11:11 by Martin Rubey

Updated

Jun 11, 2019 at 11:11 by Martin Rubey