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 A033512 #14 Mar 08 2016 12:53:09
%S A033512 1,55,24342,7594361,2548684656,842518533590,279533139565077,
%T A033512 92657526436631289,30721240815429999078,10185111919160666118608,
%U A033512 3376771882017849561260401,1119528305492897225312120742,371166848426649070379972358241,123056076089539426001744759117065
%N A033512 Number of matchings in graph P_{9} X P_{n}.
%D A033512 Per Hakan Lundow, "Computation of matching polynomials and the number of 1-factors in polygraphs", Research reports, No 12, 1996, Department of Mathematics, Umea University.
%H A033512 Alois P. Heinz, <a href="/A033512/b033512.txt">Table of n, a(n) for n = 0..400</a>
%H A033512 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.
%Y A033512 Column k=9 of A210662.
%K A033512 nonn
%O A033512 0,2
%A A033512 _Per H. Lundow_