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 A033523 #12 May 25 2017 14:40:59
%S A033523 1,199,378424,531616825,784262868625,1149284628732204,
%T A033523 1685897303909927649,2472705159894822329223,3626792720604314478281516,
%U A033523 5319512204961806610481718127,7802271843434650931552185647127,11443801542489979112417158760023324
%N A033523 Number of matchings in graph C_{11} X P_{n}.
%D A033523 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 A033523 Alois P. Heinz, <a href="/A033523/b033523.txt">Table of n, a(n) for n = 0..100</a>
%H A033523 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.
%Y A033523 Row 11 of A287428.
%K A033523 nonn
%O A033523 0,2
%A A033523 _Per H. Lundow_