The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A303209 Number of total dominating sets in the n X n rook complement graph. 2
 0, 1, 334, 63935, 33543096, 68719407273, 562949953031502, 18446744073707484655, 2417851639229258338871776, 1267650600228229401496650964865, 2658455991569831745807614120307390270, 22300745198530623141535718272648360299110799 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS 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 LINKS Andrew Howroyd, Table of n, a(n) for n = 1..50 Eric Weisstein's World of Mathematics, Rook Complement Graph Eric Weisstein's World of Mathematics, Total Dominating Set FORMULA 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 PROG (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 CROSSREFS Cf. A292073, A303212, A347922. Sequence in context: A184463 A303210 A278098 * A216138 A252995 A119760 Adjacent sequences:  A303206 A303207 A303208 * A303210 A303211 A303212 KEYWORD nonn,changed AUTHOR Eric W. Weisstein, Apr 19 2018 EXTENSIONS Terms a(6) and beyond from Andrew Howroyd, Apr 20 2018 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 28 15:20 EST 2022. Contains 350657 sequences. (Running on oeis4.)