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 A268125 #8 Feb 25 2016 17:11:32 %S A268125 3,7,19,57,217,791,3107,12110,49361 %N A268125 Minimal order of recurrence for number of legal n X m Go positions, for fixed n. %H A268125 J. Tromp and G. Farnebäck, <a href="http://dx.doi.org/10.1007/978-3-540-75538-8_8">Combinatorics of Go</a>, Lecture Notes in Computer Science, 4630, 84-99, 2007. %e A268125 For n=1 the minimal recurrence is L(1,m) = 3*L(1,m-1)-L(1,m-2)+L(1,m-3). %Y A268125 Cf. A094777, A102620, A266278. %K A268125 nonn,more %O A268125 1,1 %A A268125 _John Tromp_, Jan 26 2016