Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #17 Nov 28 2023 08:40:20
%S 1,1,1,8,50,210,348,1173,11832,159230,1641932,14128718,140392863,
%T 2130302917
%N Number of maximal independent vertex sets (and minimal vertex covers) in the n-triangular honeycomb obtuse knight graph.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MaximalIndependentVertexSet.html">Maximal Independent Vertex Set</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MinimalVertexCover.html">Minimal Vertex Cover</a>
%K nonn,more
%O 1,4
%A _Eric W. Weisstein_, Aug 07 2017
%E a(12)-a(13) from _Eric W. Weisstein_, Nov 01 2018
%E a(14) from _Eric W. Weisstein_, Nov 27 2023