|
|
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
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
EXAMPLE
|
Array begins:
1 2 5 8 11 ...
2 4 12 47 ...
3 9 >=97 ...
4 31 ...
5 >=100 ...
...
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|