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 A290606 #20 Feb 16 2025 08:33:50
%S A290606 1,2,4,4,40,136,8080,17331120
%N A290606 Number of maximal independent vertex sets (and minimal vertex covers) in the n-halved cube graph.
%H A290606 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/HalvedCubeGraph.html">Halved Cube Graph</a>.
%H A290606 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MaximalIndependentVertexSet.html">Maximal Independent Vertex Set</a>.
%H A290606 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MinimalVertexCover.html">Minimal Vertex Cover</a>.
%t A290606 Table[Length@FindIndependentVertexSet[GraphPower[HypercubeGraph[n - 1], 2], Infinity, All], {n, 7}]
%o A290606 (Python)
%o A290606 from networkx import empty_graph, find_cliques, complement, power
%o A290606 def A290606(n):
%o A290606 k = 1<<n-1
%o A290606 G = empty_graph(range(k))
%o A290606 G.add_edges_from((a,b) for a in range(k) for b in range(a) if (lambda m: not(m&-m)^m if m else False)(a^b))
%o A290606 return sum(1 for c in find_cliques(complement(power(G,2)))) # _Chai Wah Wu_, Jan 11 2024
%Y A290606 Cf. A288943.
%K A290606 nonn,more
%O A290606 1,2
%A A290606 _Eric W. Weisstein_, Aug 07 2017