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 A290594 #13 Feb 16 2025 08:33:50 %S A290594 1,2,5,8,30,88,378,1400,7128,31456,182640,932960,6048912,35000320, %T A290594 249904656,1609079552,12518446848,88532931328,744008722944, %U A290594 5721984568832,51576606895104,427904524628992,4112973567496704,36567439575256064,372971541998834688 %N A290594 Number of maximal independent vertex sets (and minimal vertex covers) in the n X n black bishop graph. %C A290594 See A146304 for algorithm and PARI code to produce this sequence. - _Andrew Howroyd_, Aug 07 2017 %H A290594 Andrew Howroyd, <a href="/A290594/b290594.txt">Table of n, a(n) for n = 1..100</a> %H A290594 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BlackBishopGraph.html">Black Bishop Graph</a> %H A290594 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MaximalIndependentVertexSet.html">Maximal Independent Vertex Set</a> %H A290594 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MinimalVertexCover.html">Minimal Vertex Cover</a> %Y A290594 Row sums of A288183. %Y A290594 Cf. A146304, A290613. %K A290594 nonn %O A290594 1,2 %A A290594 _Eric W. Weisstein_, Aug 07 2017 %E A290594 Terms a(12) and beyond from _Andrew Howroyd_, Aug 07 2017