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 A028449 #11 Dec 08 2013 19:52:18
%S A028449 1,8,450,14320,535229,19114420,692276437,24972353440,901990734650,
%T A028449 32567565264292,1176040842289105,42466317504553328,
%U A028449 1533458728878759825,55373015618048484484,1999515562849410856778,72202339448101503740768,2607220750517054436937621
%N A028449 Number of perfect matchings in graph P_{2} X P_{5} X P_{n}.
%D A028449 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 A028449 Alois P. Heinz, <a href="/A028449/b028449.txt">Table of n, a(n) for n = 0..600</a>
%H A028449 Alois P. Heinz, <a href="/A028449/a028449.txt">G.f. for A028449</a>
%H A028449 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.
%F A028449 G.f.: see link above.
%Y A028449 Column k=5 of A181206.
%K A028449 nonn
%O A028449 0,2
%A A028449 _Per H. Lundow_