login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A290949 Number of connected dominating sets in the n X n rook complement graph. 0
1, 0, 325, 63899, 33542996, 68719407048, 562949953031061, 18446744073707483871, 2417851639229258338870480, 1267650600228229401496650962840, 2658455991569831745807614120307387245, 22300745198530623141535718272648360299106443 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Table of n, a(n) for n=1..12.

Eric Weisstein's World of Mathematics, Connected Dominating Set

Eric Weisstein's World of Mathematics, Rook Complement Graph

FORMULA

a(n) = 2^(n^2) - 2*n*(2^n - 1) + n^2 - 2*n^2*(2^(n-1)-1)^2 + n^2*(n-1)^2 - 3*binomial(n,2)^2 - 1 for n > 1. - Andrew Howroyd, Jan 14 2018

MATHEMATICA

Table[If[n == 1, 1, 2^(n^2) - 2 n (2^n - 1) + n^2 (1 - 2 (2^(n - 1) - 1)^2 + (n - 1)^2) - 3 Binomial[n, 2]^2 - 1], {n, 20}] (* Eric W. Weisstein, Jan 15 2018 *)

PROG

(PARI) a(n) = if(n==1, 1, 2^(n^2) - 2*n*(2^n - 1) + n^2 - 2*n^2*(2^(n-1)-1)^2 + n^2*(n-1)^2 - 3*binomial(n, 2)^2 - 1); \\ Andrew Howroyd, Jan 14 2018

CROSSREFS

Cf. A291593, A292073.

Sequence in context: A266365 A166220 A121000 * A048909 A097739 A203188

Adjacent sequences:  A290946 A290947 A290948 * A290950 A290951 A290952

KEYWORD

nonn

AUTHOR

Eric W. Weisstein, Sep 14 2017

EXTENSIONS

a(6)-a(12) from Andrew Howroyd, Jan 14 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 3 01:39 EDT 2020. Contains 333195 sequences. (Running on oeis4.)