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 A301460 #9 Feb 16 2025 08:33:53 %S A301460 2,4,2,56,654,915052 %N A301460 Number of maximal independent vertex sets in the n-folded cube graph. %H A301460 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/FoldedCubeGraph.html">Folded Cube Graph</a> %H A301460 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MaximalIndependentVertexSet.html">Maximal Independent Vertex Set</a> %o A301460 (Python) %o A301460 from itertools import product %o A301460 from networkx import hypercube_graph, contracted_nodes, find_cliques, complement %o A301460 def A301460(n): %o A301460 G = hypercube_graph(n) %o A301460 for a in product((0,1),repeat=n-1): %o A301460 G = contracted_nodes(G,(0,)+a,(1,)+tuple(1-d for d in a)) %o A301460 return sum(1 for c in find_cliques(complement(G))) # _Chai Wah Wu_, Jan 16 2024 %K A301460 nonn,more %O A301460 2,1 %A A301460 _Eric W. Weisstein_, Mar 21 2018