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.
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.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =1a(4) =3a(5) =6a(6) =3a(7) =1a(8) =6a(9) =15a(10) =24a(11) =30a(12) =18a(13) =4a(14) =1a(15) =10a(16) =45a(17) =120a(18) =215a(19) =282a(20) =295a(21) =250a(22) =135a(23) =40a(24) =5a(25) =1a(26) =15a(27) =105a(28) =455a(29) =1365
External references
- oeis: A125206