A321248 Number of maximal independent vertex sets in the n X n stacked book graph.

2, 4, 22, 126, 2260, 37638, 1480106, 106342556, 9320003978, 2071042581066, 633815351419648, 361949253722666782, 381075059450207446426, 651096057826702043966544, 2118270096010218021292121870

Offset

1,1

Links

Table of n, a(n) for n=1..15.

Eric Weisstein's World of Mathematics, Maximal Independent Vertex Set

Eric Weisstein's World of Mathematics, Stacked Book Graph

Prog

(Python)
from networkx import find_cliques, complement, cartesian_product, star_graph, path_graph
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

Crossrefs

Sequence in context: A289191 A235938 A279705 * A309741 A110130 A259116

Adjacent sequences: A321245 A321246 A321247 * A321249 A321250 A321251

Keyword

nonn,more

Author

Eric W. Weisstein, Nov 01 2018

Extensions

a(9)-a(15) from Andrew Howroyd, Feb 17 2020

Status

approved