login
A299709
Number of maximum independent vertex sets (and minimum vertex covers) in the n-triangular honeycomb obtuse knight graph.
0
1, 1, 1, 1, 6, 16, 1, 1, 1, 11, 1, 12, 13, 1, 88, 543, 409, 12, 1, 339
OFFSET
1,5
LINKS
Eric Weisstein's World of Mathematics, Maximum Independent Vertex Set
Eric Weisstein's World of Mathematics, Minimum Vertex Cover
CROSSREFS
Sequence in context: A191463 A235943 A225304 * A107777 A136140 A155834
KEYWORD
nonn,more
AUTHOR
Eric W. Weisstein, Feb 17 2018
EXTENSIONS
a(16)-a(19) from Eric W. Weisstein, Jan 24 2023
a(20) = 339 from Eric W. Weisstein, Jan 27 2023
STATUS
approved