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 A303141 #17 May 17 2025 22:46:27 %S A303141 0,1,4,1,2,61,9,104,2586,270,5460,184710,12600,458640,20113380,982800, %T A303141 53373600,3042295200,109544400,8497742400,611967862800,16922228400, %U A303141 1762112167200,157184659447200,3432645216000,463679536320000,50284574580240000,888196949640000,150857156385936000,19562163412303512000 %N A303141 Number of minimum total dominating sets in the n X n black bishop graph. %C A303141 For n >= 3, the total domination number is given by floor(2*n/3) = A004523(n). - _Andrew Howroyd_, May 17 2025 %H A303141 Andrew Howroyd, <a href="/A303141/b303141.txt">Table of n, a(n) for n = 1..200</a> %H A303141 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BlackBishopGraph.html">Black Bishop Graph</a>. %H A303141 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MinimumTotalDominatingSet.html">Minimum Total Dominating Set</a>. %o A303141 (PARI) vector(30,n,A303141(n)) \\ See PARI link in A321673 for program code. - _Andrew Howroyd_, May 17 2025 %Y A303141 Cf. A303144 (white bishop). %Y A303141 Cf. A004523, A303145, A303230, A321673. %K A303141 nonn %O A303141 1,3 %A A303141 _Eric W. Weisstein_, Apr 19 2018 %E A303141 a(8)-a(10) from _Andrew Howroyd_, Apr 20 2018 %E A303141 a(11) from _Eric W. Weisstein_, Apr 02 2025 %E A303141 a(12) onwards from _Andrew Howroyd_, May 16 2025