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

1, 2, 2, 3, 4, 5, 4, 9, 15, 8, 5, 30

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 15 46 >=213 ...
  3  9 >=110 ...
  4 30 ...
  5 >=122 ...
  ...

Crossrefs

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

Sequence in context: A350127 A320159 A342879 * A337774 A371263 A069928

Adjacent sequences: A342877 A342878 A342879 * A342881 A342882 A342883

Keyword

nonn,tabl,more

Author

N. J. A. Sloane, Mar 28 2021

Status

approved