[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
Table of n, a(n) for n=1..12.
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
Cf. A331699, A332232, A332234, A332235, A342878, A342880.
Sequence in context: A331049 A350127 A320159 * A342880 A337774 A371263
Adjacent sequences: A342876 A342877 A342878 * A342880 A342881 A342882
KEYWORD
nonn,tabl,more
AUTHOR
N. J. A. Sloane, Mar 28 2021
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified November 27 13:42 EST 2024. Contains 378155 sequences.
License Agreements, Terms of Use, Privacy Policy