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

%I #12 Dec 05 2020 02:14:38

%S 1,1,8,18,27,216,1764,10648,74088,1072148,21024576,348913664,

%T 7715561070,275259237625,12230590464000,592493444540212,

%U 37366900397568000,3330826385498445483,370530347743457894433,49507287177905438027264

%N Number of maximal independent vertex sets (and minimal vertex covers) in the n-triangular honeycomb acute 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,3

%A _Eric W. Weisstein_, Aug 07 2017

%E a(11)-a(12) from _Eric W. Weisstein_, Dec 14 2018

%E a(13)-a(20) from _Eric W. Weisstein_, Dec 04 2020

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 April 14 05:31 EDT 2024. Contains 371655 sequences. (Running on oeis4.)