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 A289201 #20 Feb 16 2025 08:33:48
%S A289201 1,1,10,31,172,2253,50652,900243,26990541,1534414257
%N A289201 Number of maximal independent vertex sets (and minimal vertex covers) in the n X n knight graph.
%H A289201 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/KnightGraph.html">Knight Graph</a>.
%H A289201 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MaximalIndependentVertexSet.html">Maximal Independent Vertex Set</a>.
%H A289201 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MinimalVertexCover.html">Minimal Vertex Cover</a>.
%t A289201 Table[Length[FindIndependentVertexSet[KnightTourGraph[n, n], Infinity, All]], {n, 7}]
%o A289201 (Python)
%o A289201 from networkx import empty_graph, find_cliques, complement
%o A289201 def A289201(n):
%o A289201 G = empty_graph((i,j) for i in range(n) for j in range(n))
%o A289201 G.add_edges_from(((i,j),(i+k,j+l)) for i in range(n) for j in range(n) for (k,l) in ((1,2),(1,-2),(-1,2),(-1,-2),(2,1),(2,-1),(-2,1),(-2,-1)) if 0<=i+k<n and 0<=j+l<n)
%o A289201 return sum(1 for c in find_cliques(complement(G))) # _Chai Wah Wu_, Jan 11 2024
%Y A289201 Cf. A141243, A289203, A287071, A289200.
%K A289201 nonn,more
%O A289201 1,3
%A A289201 _Eric W. Weisstein_, Jun 28 2017
%E A289201 a(9)-a(10) from _Andrew Howroyd_, Jul 01 2017