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 A033529 #8 Dec 09 2013 11:03:52
%S A033529 1,733,4334009,20324827981,98618371821449,476450515130518749,
%T A033529 2303329608950881340608,11134067093100203643948181,
%U A033529 53821768256990554940684650505,260172308883754886843036887611589,1257663186848063684537091601425009561
%N A033529 Number of matchings in graph P_{2} X P_{6} X P_{n}.
%D A033529 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 A033529 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.
%K A033529 nonn
%O A033529 0,2
%A A033529 _Per H. Lundow_