login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

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