login
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.
2
1, 2, 3, 3, 7, 5, 4, 13, 16, 7, 5, 21, 41, 32, 9, 6, 31, 86
OFFSET
1,2
LINKS
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
KEYWORD
nonn,tabl,more
AUTHOR
N. J. A. Sloane, Mar 28 2021
STATUS
approved