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 A303209 #12 Feb 16 2025 08:33:54
%S A303209 0,1,334,63935,33543096,68719407273,562949953031502,
%T A303209 18446744073707484655,2417851639229258338871776,
%U A303209 1267650600228229401496650964865,2658455991569831745807614120307390270,22300745198530623141535718272648360299110799
%N A303209 Number of total dominating sets in the n X n rook complement graph.
%C A303209 The vertex sets which are not totally dominating are just those that are contained in the union of a single row and column. - _Andrew Howroyd_, Apr 20 2018
%H A303209 Andrew Howroyd, <a href="/A303209/b303209.txt">Table of n, a(n) for n = 1..50</a>
%H A303209 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/RookComplementGraph.html">Rook Complement Graph</a>
%H A303209 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/TotalDominatingSet.html">Total Dominating Set</a>
%F A303209 a(n) = 2^(n^2) - 2*n*(2^n - 1) - 2*n^2*(2^(n-1)-1)^2 + n^2*(n-1)^2/2 + n^2 - 1. - _Andrew Howroyd_, Apr 20 2018
%o A303209 (PARI) a(n) = {2^(n^2) - 2*n*(2^n - 1) - 2*n^2*(2^(n-1)-1)^2 + n^2*(n-1)^2/2 + n^2 - 1} \\ _Andrew Howroyd_, Apr 20 2018
%Y A303209 Cf. A292073, A303212, A347922.
%K A303209 nonn
%O A303209 1,3
%A A303209 _Eric W. Weisstein_, Apr 19 2018
%E A303209 Terms a(6) and beyond from _Andrew Howroyd_, Apr 20 2018