

A125206


Triangular array T(n,k) (n>=1, 0<=k<=n(n1)/2) giving the total number of connected components in all subgraphs obtained from the complete labeled graph K_n by removing k edges.


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;
refs;
listen;
history;
text;
internal format)



OFFSET

1,3


COMMENTS

Rowreversed version of A125205, see A125205 for further details


LINKS

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


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 (rowreversed version), A125207 (row sums).
Sequence in context: A202204 A289815 A125205 * A221918 A193897 A226122
Adjacent sequences: A125203 A125204 A125205 * A125207 A125208 A125209


KEYWORD

nonn,tabf


AUTHOR

Max Alekseyev, Nov 23 2006


STATUS

approved



