|
Search: id:A094824
|
|
|
| A094824 |
|
Maximum number of longest common substrings of two binary sequences of length n. |
|
+0
4
|
|
| 1, 2, 2, 2, 3, 3, 4, 6, 6, 7, 7, 8, 8, 10
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
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.
|
|
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 this_sequence A029054 A008997 A005851
Adjacent sequences: A094821 A094822 A094823 this_sequence A094825 A094826 A094827
|
|
KEYWORD
|
hard,more,nonn,nice
|
|
AUTHOR
|
W. Edwin Clark (eclark(AT)math.usf.edu), Jun 12 2004
|
|
EXTENSIONS
|
a(1)-a(12) verified and extended to a(13), a(14) by John W. Layman (layman(AT)math.vt.edu), Jun 17 2004
|
|
|
Search completed in 0.002 seconds
|
