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 A028485 #13 Dec 10 2013 12:15:50
%S A028485 1,2,845,20172,2289869,97964230,7649951296,405583759128,
%T A028485 27499952912185,1591141858520618,101905561228130549,
%U A028485 6113307278736517860,382470784319563068389,23290532695631115845632,1443134633691436850272225,88425947348303637210263088
%N A028485 Number of perfect matchings in graph C_{14} X P_{n}.
%D A028485 Per Hakan Lundow, "Computation of matching polynomials and the number of 1-factors in polygraphs", Research report, No 12, 1996, Department of Math., Umea University, Sweden.
%H A028485 Alois P. Heinz, <a href="/A028485/b028485.txt">Table of n, a(n) for n = 0..200</a>
%H A028485 Alois P. Heinz, <a href="/A028485/a028485.txt">G.f. for A028485</a>
%H A028485 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.
%F A028485 G.f.: see link above.
%K A028485 nonn
%O A028485 0,2
%A A028485 _Per H. Lundow_