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 A321673 #20 May 17 2025 19:23:54 %S A321673 0,1,16,1,8,3721,108,10816,6568440,72900,31449600,34117784100, %T A321673 165564000,210350649600,402994899820800,965895840000,2867571383040000, %U A321673 9255560083943040000,12074509581120000,72211625896757760000,373919369489319044160000,286361814021766560000,3107808843778161008640000 %N A321673 Number of minimum total dominating sets in the n X n bishop graph. %H A321673 Andrew Howroyd, <a href="/A321673/b321673.txt">Table of n, a(n) for n = 1..200</a> %H A321673 Andrew Howroyd, <a href="/A321673/a321673.txt">PARI Program</a>, May 2025. %H A321673 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BishopGraph.html">Bishop Graph</a>. %H A321673 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MinimumTotalDominatingSet.html">Minimum Total Dominating Set</a>. %F A321673 a(n) = A303141(n) * A303144(n). - _Andrew Howroyd_, Nov 16 2018 %o A321673 (PARI) vector(24,n,A321673(n)) \\ See PARI link. - _Andrew Howroyd_, May 17 2025 %Y A321673 Cf. A303141 (black bishop graph). %Y A321673 Cf. A303144 (white bishop graph). %Y A321673 Cf. A304555, A304564, A321674. %K A321673 nonn %O A321673 1,3 %A A321673 _Eric W. Weisstein_, Nov 16 2018 %E A321673 a(8)-a(10) from _Andrew Howroyd_, Nov 16 2018 %E A321673 a(11) from _Eric W. Weisstein_, Apr 03 2025 %E A321673 a(12) onwards from _Andrew Howroyd_, May 16 2025