STATUS
proposed
approved
The OEIS is supported by the many generous donors to the OEIS Foundation.
Revision History for A299709
(Bold, blue-underlined text is an addition; faded, red-underlined text is aShowing entries 1-10 | older changes
Number of maximum independent vertex sets (and minimum vertex covers) in the n-triangular honeycomb obtuse knight graph.
(history; published version)
(history; published version)
STATUS
editing
proposed
DATA
1, 1, 1, 1, 6, 16, 1, 1, 1, 11, 1, 12, 13, 1, 88, 543, 409, 12, 1, 339
EXTENSIONS
a(20) = 339 from Eric W. Weisstein, Jan 27 2023
STATUS
approved
editing
STATUS
proposed
approved
STATUS
editing
proposed
DATA
1, 1, 1, 1, 6, 16, 1, 1, 1, 11, 1, 12, 13, 1, 88, 543, 409, 12, 1
EXTENSIONS
a(16)-a(19) from Eric W. Weisstein, Jan 24 2023
STATUS
approved
editing
STATUS
reviewed
approved
STATUS
proposed
reviewed
STATUS
editing
proposed
NAME
allocated for Eric W. Weisstein
Number of maximum independent vertex sets (and minimum vertex covers) in the n-triangular honeycomb obtuse knight graph.
DATA
1, 1, 1, 1, 6, 16, 1, 1, 1, 11, 1, 12, 13, 1, 88
OFFSET
1,5
LINKS
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>
KEYWORD
allocated
nonn,more
AUTHOR
Eric W. Weisstein, Feb 17 2018
STATUS
approved
editing