%I #3 Mar 30 2012 17:26:58

%S 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,

%T 1,15,105,455,1365,3009,5065,6705,7170,6365,4800,3015,1385,420,75,6,1,

%U 21,210,1330,5985,20349,54271,116385,204225,297115,362292,373947,329945

%N 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.

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

%e The array starts with

%e 1

%e 1, 2

%e 1, 3, 6, 3

%e 1, 6, 15, 24, 30, 18, 4

%e 1, 10, 45, 120, 215, 282, 295, 250, 135, 40, 5

%e ...

%Y Cf. A125205 (row-reversed version), A125207 (row sums).

%K nonn,tabf

%O 1,3

%A _Max Alekseyev_, Nov 23 2006