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!)
A290874 Number of minimal dominating sets in the n-triangular honeycomb obtuse knight graph. 0

%I #5 Aug 14 2017 11:35:08

%S 1,1,1,8,80,726

%N Number of minimal dominating sets in the n-triangular honeycomb obtuse knight graph.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MinimalDominatingSet.html">Minimal Dominating Set</a>

%K nonn,more

%O 1,4

%A _Eric W. Weisstein_, Aug 13 2017

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 November 30 04:53 EST 2023. Contains 367453 sequences. (Running on oeis4.)