|
Search: id:A125206
|
|
|
| A125206 |
|
Triangular array T(n,k) (n>=1, 0<=k<=n(n-1)/2) giving the total number of connected components in all subgraphs obtained from the complete labeled graph K_n by removing k edges. |
|
+0
5
|
|
| 1, 1, 2, 1, 3, 6, 3, 1, 6, 15, 24, 30, 18, 4, 1, 10, 45, 120, 215, 282, 295, 250, 135, 40, 5, 1, 15, 105, 455, 1365, 3009, 5065, 6705, 7170, 6365, 4800, 3015, 1385, 420, 75, 6, 1, 21, 210, 1330, 5985, 20349, 54271, 116385, 204225, 297115, 362292, 373947, 329945
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Row-reversed version of A125205, see A125205 for further details
|
|
EXAMPLE
|
The array starts with
1
1, 2
1, 3, 6, 3
1, 6, 15, 24, 30, 18, 4
1, 10, 45, 120, 215, 282, 295, 250, 135, 40, 5
...
|
|
CROSSREFS
|
Cf. A125205 (row-reversed version), A125207 (row sums).
Sequence in context: A106578 A006895 A125205 this_sequence A133904 A094339 A120576
Adjacent sequences: A125203 A125204 A125205 this_sequence A125207 A125208 A125209
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
Max Alekseyev (maxal(AT)cs.ucsd.edu), Nov 23 2006
|
|
|
Search completed in 0.002 seconds
|
