The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A094863 Maximal number of longest common subsequences between any two strings of length n (Version 2). 1
 1, 2, 3, 4, 7, 10, 19, 28 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Same as A094858 (which has much more information about the problem), except that we now we allow an arbitrary alphabet. For even n it seems that the maximum is attained for X = 123412341234..., Y = 432143214321..., giving values : (conjectured) maximum number of maximum-length-common-subsequences of 2 strings of length 2*n over an arbitrary (infinite) alphabet f(2*n) = 2,4,10,28,78,220,624,1780,5100,14668,.. Note that (3*f(2*n)-f(2*n+2))/2 gives 1,1,1,3,7,18,46,120,316,841,2257,6103,16611,45475,125139,.. which is A026107. Is there an explanation for this? LINKS CROSSREFS Sequence in context: A166012 A060166 A053634 * A094862 A104722 A270613 Adjacent sequences:  A094860 A094861 A094862 * A094864 A094865 A094866 KEYWORD nonn,more,nice,hard AUTHOR Guenter Stertenbrink (Sterten(AT)aol.com), Jun 14 2004 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 2 08:16 EDT 2020. Contains 334767 sequences. (Running on oeis4.)