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 A094859 #1 Sep 22 2004 03:00:00 %S A094859 1,2,3,4,6,10 %N A094859 Maximal number of longest common subsequences between any two ternary strings of length n (Version 2). %C A094859 Same as A094858 but now we can use an alphabet of size 3. %K A094859 nonn,more %O A094859 1,2 %A A094859 Guenter Stertenbrink (Sterten(AT)aol.com), Jun 14 2004