cp's OEIS Frontend

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.

A321250 Number of maximal independent vertex sets in the n X n torus grid graph.

Original entry on oeis.org

1, 2, 6, 42, 220, 3644, 62272, 1794762, 83280570, 6210321492
Offset: 1

Views

Author

Eric W. Weisstein, Nov 01 2018

Keywords

Crossrefs

Cf. A027683.

Programs

  • Mathematica
    Table[Length@FindIndependentVertexSet[GraphProduct[CycleGraph[n], CycleGraph[n], "Cartesian"], Infinity, All], {n, 3, 8}] (* Eric W. Weisstein, Jan 26 2024 *)
  • Python
    from networkx import find_cliques, complement, cartesian_product, cycle_graph
    def A321250(n): return sum(1 for c in find_cliques(complement(cartesian_product(cycle_graph(n),cycle_graph(n))))) # Chai Wah Wu, Jan 11 2024

Extensions

a(1), a(2), and a(10) from Andrew Howroyd, Nov 01 2018