login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 16:58 EDT 2024. Contains 371254 sequences. (Running on oeis4.)