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 A033511 #22 Mar 08 2016 10:43:54
%S A033511 1,34,7573,1222550,211351945,36012826776,6158217253688,
%T A033511 1052091957273408,179788343101980135,30721240815429999078,
%U A033511 5249581929453966097649,897032469743945346623442,153282416794739031814924079,26192460807219455656314349664
%N A033511 Number of matchings in graph P_{8} X P_{n}.
%H A033511 Alois P. Heinz, <a href="/A033511/b033511.txt">Table of n, a(n) for n = 0..450</a>
%H A033511 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 A033511 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.
%H A033511 Sergey Perepechko, <a href="/A033511/a033511.pdf">Generating function</a>
%Y A033511 Column 8 of triangle A210662.
%Y A033511 Bisection (even part) gives A260036.
%K A033511 nonn
%O A033511 0,2
%A A033511 _Per H. Lundow_