This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A094863 #3 Dec 31 2023 10:28:09 %S A094863 1,2,3,4,7,10,19,28 %N A094863 Maximal number of longest common subsequences between any two strings of length n (Version 2). %C A094863 Same as A094858 (which has much more information about the problem), except that we now we allow an arbitrary alphabet. %C A094863 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? %Y A094863 Cf. A026107, A094858. %K A094863 nonn,more,nice,hard %O A094863 1,2 %A A094863 Guenter Stertenbrink (Sterten(AT)aol.com), Jun 14 2004