This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A290613 #15 May 29 2025 13:35:26 %S A290613 2,2,8,22,88,296,1400,5728,31456,150896,932960,5115376,35000320, %T A290613 214949120,1609079552,10909768192,88532931328,655461278720, %U A290613 5721984568832,45854239383040,427904524628992,3685075352873984,36567439575256064,336404621367433216 %N A290613 Number of maximal independent vertex sets (and minimal vertex covers) in the n X n white bishop graph. %C A290613 See A146304 for algorithm and PARI code to produce this sequence. - _Andrew Howroyd_, Aug 09 2017 %H A290613 Andrew Howroyd, <a href="/A290613/b290613.txt">Table of n, a(n) for n = 2..100</a> %H A290613 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MaximalIndependentVertexSet.html">Maximal Independent Vertex Set</a> %H A290613 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MinimalVertexCover.html">Minimal Vertex Cover</a> %H A290613 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/WhiteBishopGraph.html">White Bishop Graph</a> %Y A290613 Row sums of A288182. %Y A290613 Cf. A146304, A290594. %K A290613 nonn %O A290613 2,1 %A A290613 _Eric W. Weisstein_, Aug 07 2017 %E A290613 Terms a(12) and beyond from _Andrew Howroyd_, Aug 09 2017