A094824 Maximum number of longest common substrings of two binary sequences of length n.

1, 2, 2, 2, 3, 3, 4, 6, 6, 7, 7, 8, 8, 10, 11, 12, 14

Offset: 1

Author

W. Edwin Clark, Jun 12 2004

Keywords

• hard
• more
• nonn
• nice

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.

Examples

			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.
		

Links

• Sean A. Irvine, Java program (github)

Crossrefs

See A094837 for a related sequence.

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