A299709 - OEIS

%I #11 Jan 27 2023 08:50:57

%S 1,1,1,1,6,16,1,1,1,11,1,12,13,1,88,543,409,12,1,339

%N Number of maximum independent vertex sets (and minimum vertex covers) in the n-triangular honeycomb obtuse knight graph.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MaximumIndependentVertexSet.html">Maximum Independent Vertex Set</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MinimumVertexCover.html">Minimum Vertex Cover</a>

%K nonn,more

%O 1,5

%A _Eric W. Weisstein_, Feb 17 2018

%E a(16)-a(19) from _Eric W. Weisstein_, Jan 24 2023

%E a(20) = 339 from _Eric W. Weisstein_, Jan 27 2023