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 A028454 #16 Dec 13 2013 07:41:25
%S A028454 1,36,32000,10885344,5051532105,2132137503232,932814464901633,
%T A028454 403325499406267520,175220727982196365632,75996591204223021534740,
%U A028454 32983893365927357595999561,14312021563707748863632803328,6210770058902782255142931025577
%N A028454 Number of perfect matchings in graph P_{4} X P_{4} X P_{n}.
%H A028454 Alois P. Heinz, <a href="/A028454/b028454.txt">Table of n, a(n) for n = 0..100</a>
%H A028454 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors.pdf">Computation of matching polynomials and the number of 1-factors in polygraphs</a>, Research report, No 12, 1996, Department of Math., Umea University, Sweden.
%H A028454 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.
%Y A028454 Cf. A006253, A028452, A049507.
%K A028454 nonn
%O A028454 0,2
%A A028454 _Per H. Lundow_