A342879 Array read by antidiagonals: T(n,k) = the length of the longest word over [1,...,n] containing no occurrences of split k-overlaps.

1, 2, 2, 3, 4, 5, 4, 9, 12, 8, 5, 31

Offset

1,2

Links

Table of n, a(n) for n=1..12.

D. Gabric and J. Shallit, Avoidance of split overlaps, arxiv preprint arXiv:2002.01968 [cs.DM], February 5 2020.

Example

Array begins:
  1  2  5  8 11 ...
  2  4 12 47 ...
  3  9 >=97 ...
  4 31 ...
  5 >=100 ...
  ...

Crossrefs

Cf. A331699, A332232, A332234, A332235, A342878, A342880.

Sequence in context: A331049 A350127 A320159 * A342880 A337774 A371263

Adjacent sequences: A342876 A342877 A342878 * A342880 A342881 A342882

Keyword

nonn,tabl,more

Author

N. J. A. Sloane, Mar 28 2021

Status

approved