login
A342879
Array read by antidiagonals: T(n,k) = the length of the longest word over [1,...,n] containing no occurrences of split k-overlaps.
2
1, 2, 2, 3, 4, 5, 4, 9, 12, 8, 5, 31
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 2 5 8 11 ...
2 4 12 47 ...
3 9 >=97 ...
4 31 ...
5 >=100 ...
...
CROSSREFS
KEYWORD
nonn,tabl,more
AUTHOR
N. J. A. Sloane, Mar 28 2021
STATUS
approved