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 A033531 #9 Dec 09 2013 11:19:04
%S A033531 1,823,5493583,28579431833,154620656140976,831415352314053207,
%T A033531 4475746196648151844135,24088698990102061728597981,
%U A033531 129653063594088631745065442153,697826352881007761016861345617984,3755891812799886342646421870514820641
%N A033531 Number of matchings in graph P_{3} X P_{4} X P_{n}.
%D A033531 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 A033531 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.
%K A033531 nonn
%O A033531 0,2
%A A033531 _Per H. Lundow_