|
%I #20 Jan 27 2024 11:41:54
%S 1,1,1,1,16,4096,767700,8624448,33995170,136972766,3830698927
%N Number of maximal independent vertex sets in the n X n antelope graph.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/AntelopeGraph.html">Antelope Graph</a>.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MaximalIndependentVertexSet.html">Maximal Independent Vertex Set</a>.
%t Table[Length@FindIndependentVertexSet[RelationGraph[Sort[Abs[Subtract[##]]] == {3, 4} &, Tuples[Range[n], 2]], Infinity, All], {n, 7}]
%o (Python)
%o from networkx import empty_graph, find_cliques, complement
%o def A321242(n):
%o G = empty_graph((i,j) for i in range(n) for j in range(n))
%o G.add_edges_from(((i,j),(i+k,j+l)) for i in range(n) for j in range(n) for (k,l) in ((3,4),(3,-4),(-3,4),(-3,-4),(4,3),(4,-3),(-4,3),(-4,-3)) if 0<=i+k<n and 0<=j+l<n)
%o return sum(1 for c in find_cliques(complement(G))) # _Chai Wah Wu_, Jan 11 2024
%K nonn,more
%O 1,5
%A _Eric W. Weisstein_, Nov 01 2018
%E a(10) from _Chai Wah Wu_, Jan 11 2024
%E a(11) from _Eric W. Weisstein_, Jan 26 2024
|
