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 A289200 #15 Feb 16 2025 08:33:48
%S A289200 1,1,10,538,94868,59059198
%N A289200 Number of maximal matchings in the n X n knight graph.
%H A289200 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/KnightGraph.html">Knight Graph</a>
%H A289200 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Matching.html">Matching</a>
%H A289200 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MaximalIndependentEdgeSet.html">Maximal Independent Edge Set</a>
%t A289200 Table[Length[FindIndependentVertexSet[LineGraph[KnightTourGraph[n, n]], Infinity, All]], {n, 5}]
%K A289200 nonn,more
%O A289200 1,3
%A A289200 _Eric W. Weisstein_, Jun 28 2017
%E A289200 a(6) from _Eric W. Weisstein_, Jun 02 2019