The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #12 Dec 01 2019 06:03:21
%S 3,9,17,25,33,41,49,57,65,75
%N Maximum length of a binary n-similar word.
%C A word w is n-similar if every consecutive pair of identical-length contiguous blocks within w agrees on at most n positions.
%D A. Baranwal, T. Clokie, et al., Similarity of words, in preparation, November 2019.
%F It is known that a(n) >= 8n+1 and a(n) <= 10n+5 for all n >= 0.
%e Here are the lexicographically least longest words for n = 0, 1, ..., 9:
%e 0: 010
%e 1: 000111000
%e 2: 00000101111100000
%e 3: 0000000101011111110000000
%e 4: 000000000101010111111111000000000
%e 5: 00000000000101010101111111111100000000000
%e 6: 0000000000000101010101011111111111110000000000000
%e 7: 000000000000000101010101010111111111111111000000000000000
%e 8: 00000000000000000101010101010101111111111111111100000000000000000
%e 9: 000000000000000000010110010101011111111111111111110011000000100000000000000
%K nonn,more
%O 0,1
%A _Jeffrey Shallit_, Nov 30 2019