This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A094824 Maximum number of longest common substrings of two binary sequences of length n. 4
 1, 2, 2, 2, 3, 3, 4, 6, 6, 7, 7, 8, 8, 10, 11, 12, 14 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS 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. LINKS Sean A. Irvine, Java program (github) EXAMPLE 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. CROSSREFS See A094837 for a related sequence. Sequence in context: A054911 A137267 A123576 * A029054 A008997 A005851 Adjacent sequences:  A094821 A094822 A094823 * A094825 A094826 A094827 KEYWORD hard,more,nonn,nice AUTHOR W. Edwin Clark, Jun 12 2004 EXTENSIONS a(1)-a(12) verified and extended to a(13), a(14) by John W. Layman, Jun 17 2004 a(15)-a(17) from Sean A. Irvine, Apr 17 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 26 04:11 EDT 2019. Contains 324369 sequences. (Running on oeis4.)