|
| |
|
|
A027433
|
|
Sum over all 2^(2n) pairs (u,v) of binary sequences of length n of length of maximal common subsequence between them.
|
|
0
| |
|
|
0, 2, 18, 116, 646, 3324, 16302, 77356, 358424, 1630988, 7317424, 32458400, 142638568, 621948448, 2693978986, 11602817444, 49726594628, 212195409348, 902038055526
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
REFERENCES
| V. Dancik and M. Paterson, Upper bounds for the expected length of a longest common subsequence of two binary sequences, in STACS 94, Proceedings of the Eleventh Annual Symposium on Theoretical Aspects of Computer Science held in Caen, Feb 24 1994. Edited by P. Enjalbert, E. W. Mayr and K. W. Wagner. Lecture Notes in Computer Science, 775. Springer-Verlag, 1994, pp. 669-678.
|
|
|
FORMULA
| a(n)/2^(2*n)/n -> c, where 0.7615 <= c <= 0.837623.
|
|
|
CROSSREFS
| Sequence in context: A112328 A038721 A064837 * A153338 A007798 A058052
Adjacent sequences: A027430 A027431 A027432 * A027434 A027435 A027436
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Paul.Zimmermann(AT)loria.fr
|
|
|
EXTENSIONS
| More terms from Alex Healy (ahealy(AT)post.harvard.edu), Dec 17 2002
|
| |
|
|
