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 A033535 #20 Feb 16 2025 08:32:36
%S A033535 1,1,108,49793133,17312701462385916505,
%T A033535 463310369790129032480118384076035223552
%N A033535 Number of matchings in graph P_{n} X P_{n} X P_{n}.
%H A033535 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 reports, No 12, 1996, Department of Mathematics, Umea University.
%H A033535 Per Hakan Lundow, <a href="http://www.theophys.kth.se/~phl/Text/1factors2.ps.gz">Enumeration of matchings in polygraphs</a>, 1998.
%H A033535 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/GridGraph.html">Grid Graph</a>
%H A033535 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/IndependentEdgeSet.html">Independent Edge Set</a>
%H A033535 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Matching.html">Matching</a>
%K A033535 nonn,more
%O A033535 0,3
%A A033535 _Per H. Lundow_