proposed
approved
proposed
approved
editing
proposed
1, 1, 1, 1, 6, 16, 1, 1, 1, 11, 1, 12, 13, 1, 88, 543, 409, 12, 1, 339
a(20) = 339 from Eric W. Weisstein, Jan 27 2023
approved
editing
proposed
approved
editing
proposed
1, 1, 1, 1, 6, 16, 1, 1, 1, 11, 1, 12, 13, 1, 88, 543, 409, 12, 1
a(16)-a(19) from Eric W. Weisstein, Jan 24 2023
approved
editing
reviewed
approved
proposed
reviewed
editing
proposed
allocated for Eric W. Weisstein
Number of maximum independent vertex sets (and minimum vertex covers) in the n-triangular honeycomb obtuse knight graph.
1, 1, 1, 1, 6, 16, 1, 1, 1, 11, 1, 12, 13, 1, 88
1,5
Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MaximumIndependentVertexSet.html">Maximum Independent Vertex Set</a>
Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MinimumVertexCover.html">Minimum Vertex Cover</a>
allocated
nonn,more
Eric W. Weisstein, Feb 17 2018
approved
editing