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 A033525 #10 May 25 2017 14:40:50
%S A033525 1,521,3909830,20515048427,114049219978023,629054823210684476,
%T A033525 3473775971752370727131,19179686041473059942755365,
%U A033525 105899042012449225094998682338,584710646991236367599977270008305,3228421282256766290943315048262784813
%N A033525 Number of matchings in graph C_{13} X P_{n}.
%D A033525 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 A033525 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.
%Y A033525 Row 13 of A287428.
%K A033525 nonn
%O A033525 0,2
%A A033525 _Per H. Lundow_