|
Search: id:A125209
|
|
|
| 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. |
|
+0
3
|
|
| 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, 25, -60, 0, -5, 15, 0, 0, 6, 0, 0, 0, 0, 1, -120, 504, -630, 0, 420, -105, 0, -105, 0, 35, -21, 21, 0, 0, 0, 7, 0, 0, 0, 0, 0, 1, 720, -3360, 5040, -1176, -3150, 1680, 140, 560, -210, -280, 112
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
Row-reversed version of A125208, see A125208 for further details
|
|
EXAMPLE
|
The array starts with
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
...
|
|
CROSSREFS
|
Cf. A125208 (row-reversed version), A127258 (dual version).
Adjacent sequences: A125206 A125207 A125208 this_sequence A125210 A125211 A125212
Sequence in context: A049765 A014573 A067166 this_sequence A071818 A014513 A133513
|
|
KEYWORD
|
sign,tabf
|
|
AUTHOR
|
Max Alekseyev (maxal(AT)cs.ucsd.edu), Jan 09 2007
|
|
|
Search completed in 0.002 seconds
|
