A290613 - OEIS

%I #9 Aug 09 2017 11:54:03

%S 2,2,8,22,88,296,1400,5728,31456,150896,932960,5115376,35000320,

%T 214949120,1609079552,10909768192,88532931328,655461278720,

%U 5721984568832,45854239383040,427904524628992,3685075352873984,36567439575256064,336404621367433216

%N Number of maximal independent vertex sets (and minimal edge covers) in the n X n white bishop graph.

%C See A146304 for algorithm and PARI code to produce this sequence.

%H Andrew Howroyd, <a href="/A290613/b290613.txt">Table of n, a(n) for n = 2..100</a>

%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>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/WhiteBishopGraph.html">White Bishop Graph</a>

%Y Row sums of A288182.

%Y Cf. A146304, A290594.

%K nonn

%O 2,1

%A _Eric W. Weisstein_, Aug 07 2017

%E Terms a(12) and beyond from _Andrew Howroyd_, Aug 09 2017