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 A289202 #9 Feb 16 2025 08:33:48
%S A289202 1,1,2,16,644,10304,65113608,2849759680,118928612871184,
%T A289202 58888109421793792
%N A289202 Number of maximum matchings in the n X n knight graph.
%H A289202 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/IndependentEdgeSet.html">Independent Edge Set</a>
%H A289202 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/KnightGraph.html">Knight Graph</a>
%H A289202 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Matching.html">Matching</a>
%H A289202 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MaximumIndependentEdgeSet.html">Maximum Independent Edge Set</a>
%t A289202 Join[{1, 1}, Table[Length[With[{g = LineGraph[KnightTourGraph[n, n]]}, FindIndependentVertexSet[g, Length /@ FindIndependentVertexSet[g], All]]], {n, 3, 5}]]
%Y A289202 Cf. A287225, A289200.
%K A289202 nonn,more
%O A289202 1,3
%A A289202 _Eric W. Weisstein_, Jun 28 2017
%E A289202 a(7)-a(10) from _Andrew Howroyd_, Jul 01 2017