Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 Apr 17 2019 05:52:12
%S 1,2,2,2,3,3,4,6,6,7,7,8,8,10,11,12,14
%N Maximum number of longest common substrings of two binary sequences of length n.
%C A substring of a string is a subsequence of contiguous symbols in the string. For example, 00 is a substring of 001 but not of 010. For this sequence we do not count the multiplicity of occurrence of common substrings.
%H Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a094/A094824.java">Java program</a> (github)
%e a(7) = 4 since the two strings 0001011 and 0011010 have as maximum length common substrings the 4 strings 011,001,101,010 and computer search shows that no other pair of strings of length 7 has more than 4 common maximum length substrings.
%Y See A094837 for a related sequence.
%K hard,more,nonn,nice
%O 1,2
%A _W. Edwin Clark_, Jun 12 2004
%E a(1)-a(12) verified and extended to a(13), a(14) by _John W. Layman_, Jun 17 2004
%E a(15)-a(17) from _Sean A. Irvine_, Apr 17 2019