|
|
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.
|
|
2
|
|
|
1, 2, 2, 3, 4, 5, 4, 9, 15, 8, 5, 30
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
EXAMPLE
|
Array begins:
1 2 5 8 11 ...
2 4 15 46 >=213 ...
3 9 >=110 ...
4 30 ...
5 >=122 ...
...
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|