login
A333077
Number of maximal independent sets in the binary de Bruijn graph of order n.
4
1, 2, 3, 8, 64, 2626, 4850838
OFFSET
0,2
LINKS
Eric Weisstein's World of Mathematics, de Bruijn Graph
Eric Weisstein's World of Mathematics, Maximal Independent Vertex Set
Wikipedia, De Bruijn graph
PROG
(Python)
import networkx as nx
def deBruijn(n):
return nx.MultiDiGraph(((0, 0), (0, 0))) if n==0 else nx.line_graph(deBruijn(n-1))
def A333077(n):
return sum(1 for _ in nx.find_cliques(nx.complement(nx.Graph(deBruijn(n)))))
# replacement of a function removed from NetworkX by Ross Barnowski, Nov 12 2023
CROSSREFS
Sequence in context: A095203 A351658 A003096 * A354574 A042815 A191353
KEYWORD
nonn,hard,more
AUTHOR
STATUS
approved