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 A028446 #7 Dec 09 2013 18:32:57
%S A028446 1,9,5051532105
%N A028446 Number of perfect matchings in graph P_{2n} X P_{2n} X P_{2n}.
%D A028446 Per Hakan Lundow, "Computation of matching polynomials and the number of 1-factors in polygraphs", Research report, No 12, 1996, Department of Math., Umea University, Sweden.
%H A028446 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.
%K A028446 nonn,bref,more
%O A028446 0,2
%A A028446 _Per H. Lundow_