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 A303144 #21 May 17 2025 19:24:18 %S A303144 1,4,1,4,61,12,104,2540,270,5760,184710,13140,458640,20036160,982800, %T A303144 53726400,3042295200,110224800,8497742400,611011447200,16922228400, %U A303144 1763683891200,157184659447200,3435788664000,463679536320000,50243200517664000,888196949640000,150876035934624000,19562163412303512000 %N A303144 Number of minimum total dominating sets in the n X n white bishop graph. %C A303144 For n >= 3, the total domination number is given by floor(2*n/3) = A004523(n). - _Andrew Howroyd_, May 17 2025 %H A303144 Andrew Howroyd, <a href="/A303144/b303144.txt">Table of n, a(n) for n = 2..200</a> %H A303144 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MinimumTotalDominatingSet.html">Minimum Total Dominating Set</a>. %H A303144 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/WhiteBishopGraph.html">White Bishop Graph</a>. %o A303144 (PARI) vector(29,n,A303144(n+1)) \\ See PARI link in A321673 for program code. - _Andrew Howroyd_, May 17 2025 %Y A303144 Cf. A303141 (black bishop). %Y A303144 Cf. A004523, A303147, A303229, A321673. %K A303144 nonn %O A303144 2,2 %A A303144 _Eric W. Weisstein_, Apr 19 2018 %E A303144 a(8)-a(10) from _Andrew Howroyd_, Apr 20 2018 %E A303144 a(11) from _Eric W. Weisstein_, Apr 02 2025 %E A303144 a(12) onwards from _Andrew Howroyd_, May 16 2025