%I #15 Feb 16 2025 08:33:57
%S 2,4,22,126,2260,37638,1480106,106342556,9320003978,2071042581066,
%T 633815351419648,361949253722666782,381075059450207446426,
%U 651096057826702043966544,2118270096010218021292121870
%N Number of maximal independent vertex sets in the n X n stacked book graph.
%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MaximalIndependentVertexSet.html">Maximal Independent Vertex Set</a>
%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/StackedBookGraph.html">Stacked Book Graph</a>
%o (Python)
%o from networkx import find_cliques, complement, cartesian_product, star_graph, path_graph
%o def A321248(n): return sum(1 for c in find_cliques(complement(cartesian_product(star_graph(n),path_graph(n))))) # _Chai Wah Wu_, Jan 11 2024
%K nonn,more,changed
%O 1,1
%A _Eric W. Weisstein_, Nov 01 2018
%E a(9)-a(15) from _Andrew Howroyd_, Feb 17 2020