A342878 Array read by antidiagonals: T(n,k) = the length of the longest word over [1,...,n] having the property that there are no two disjoint occurrences of the same length-k word.

1, 2, 3, 3, 7, 5, 4, 13, 16, 7, 5, 21, 41, 32, 9, 6, 31, 86

Offset

1,2

Links

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

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

Example

Array begins:
  1,  3,  5,  7,  9,  11, 13, ...
  2,  7, 16, 32, 59, 110, >=192, ...
  3, 13, 41, ...
  4, 21, 86, ...
  5, 31, ...
  6, ...
  ...

Crossrefs

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

Sequence in context: A097359 A358182 A208525 * A209574 A079387 A141061

Adjacent sequences: A342875 A342876 A342877 * A342879 A342880 A342881

Keyword

nonn,tabl,more

Author

N. J. A. Sloane, Mar 28 2021

Status

approved