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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A297029 Number of edge covers in the n-cocktail party graph. 1
 0, 7, 2902, 14872877, 1057937802444, 1139547636041211251, 19276901022645375031039586, 5187230738913145148610293591969497, 22294621657566842766129181417308087584893464, 1532378628985463601567919431617165851656712130496565087 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Andrew Howroyd, Table of n, a(n) for n = 1..25 Eric Weisstein's World of Mathematics, Cocktail Party Graph Eric Weisstein's World of Mathematics, Edge Cover FORMULA a(n) = Sum_{i=0..n} Sum_{j=0, 2*(n-i)} (-1)^(i+j)*binomial(n, i)*binomial(2*(n-i), j)*2^(binomial(2*n-j, 2)-i). - Andrew Howroyd, Dec 27 2017 MATHEMATICA a[n_] := Sum[(-1)^(i + j)*Binomial[n, i]*Binomial[2*(n - i), j] * 2^(Binomial[2*n - j, 2] - i), {i, 0, n}, {j, 0, 2*(n - i)}]; Array[a, 10] (* Jean-François Alcover, Dec 27 2017, after Andrew Howroyd *) PROG (PARI) a(n)={sum(i=0, n, sum(j=0, 2*(n-i), (-1)^(i+j)*binomial(n, i)*binomial(2*(n-i), j)*2^(binomial(2*n-j, 2)-i)))} \\ Andrew Howroyd, Dec 27 2017 CROSSREFS Sequence in context: A203587 A077721 A235464 * A242851 A264787 A070227 Adjacent sequences:  A297026 A297027 A297028 * A297030 A297031 A297032 KEYWORD nonn AUTHOR Eric W. Weisstein, Dec 24 2017 EXTENSIONS Terms a(5) and beyond from Andrew Howroyd, Dec 27 2017 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 June 17 23:41 EDT 2021. Contains 345088 sequences. (Running on oeis4.)