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 A033528 #9 Dec 09 2013 10:30:57
%S A033528 1,228,305184,334056618,376940962215,423657524608288,
%T A033528 476450515130518749,535774070372040050788,602492787376187496898304,
%U A033528 677518242019979197787376936,761886547661136372157201911987,856760801962209647160995669509984,963449325363457811035756544808212891
%N A033528 Number of matchings in graph P_{2} X P_{5} X P_{n}.
%D A033528 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 A033528 Alois P. Heinz, <a href="/A033528/b033528.txt">Table of n, a(n) for n = 0..200</a>
%H A033528 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.
%K A033528 nonn
%O A033528 0,2
%A A033528 _Per H. Lundow_