login
This site is supported by donations to The OEIS Foundation.

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A125209 Triangular array read by rows: A(n,k) (n>=1, 0<=k<=n(n-1)/2) is such that SUM A(n,k)*p^(n*(n-1)/2-k) gives the expectation of the number of connected components after deleting every edge of the complete graph on n labeled vertices with probability p. 2

%I

%S 1,1,1,-1,3,0,1,2,-6,3,4,0,0,1,-6,20,-15,-10,10,0,5,0,0,0,1,24,-90,90,

%T 25,-60,0,-5,15,0,0,6,0,0,0,0,1,-120,504,-630,0,420,-105,0,-105,0,35,

%U -21,21,0,0,0,7,0,0,0,0,0,1,720,-3360,5040,-1176,-3150,1680,140,560,-210,-280,112

%N Triangular array read by rows: A(n,k) (n>=1, 0<=k<=n(n-1)/2) is such that SUM A(n,k)*p^(n*(n-1)/2-k) gives the expectation of the number of connected components after deleting every edge of the complete graph on n labeled vertices with probability p.

%C Row-reversed version of A125208, see A125208 for further details

%e The array starts with

%e 1

%e 1, 1

%e -1, 3, 0, 1

%e 2, -6, 3, 4, 0, 0, 1

%e -6, 20, -15, -10, 10, 0, 5, 0, 0, 0, 1

%e ...

%Y Cf. A125208 (row-reversed version), A127258 (dual version).

%K sign,tabf

%O 1,5

%A _Max Alekseyev_, Jan 09 2007

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

Content is available under The OEIS End-User License Agreement .

Last modified August 21 02:21 EDT 2014. Contains 245836 sequences.