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!)
A290617 Number of maximal independent vertex sets (and minimal vertex covers) in the n-triangular honeycomb obtuse knight graph. 0

%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

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 February 24 22:04 EST 2024. Contains 370307 sequences. (Running on oeis4.)