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 A033530 #9 Dec 09 2013 11:15:24
%S A033530 1,131,90040,49793133,28579431833,16294017491392,9303034425177393,
%T A033530 5309783310438438755,3030852157018381983096,1729989715204411185894125,
%U A033530 987471788038820650012763705,563644449821238971691233574464,321725839534452657823357410831785
%N A033530 Number of matchings in graph P_{3} X P_{3} X P_{n}.
%D A033530 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 A033530 Alois P. Heinz, <a href="/A033530/b033530.txt">Table of n, a(n) for n = 0..200</a>
%H A033530 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.
%K A033530 nonn
%O A033530 0,2
%A A033530 _Per H. Lundow_