Irregular triangle read by rows T(n,k) (n>=1, 0<=k<=n(n-1)/2) giving the total number of connected components in all subgraphs (V,E') with |E'|=k of the complete labeled graph K_n=(V,E).
A125205
Irregular triangle read by rows T(n,k) (n>=1, 0<=k<=n(n-1)/2) giving the total number of connected components in all subgraphs (V,E') with |E'|=k of the complete labeled graph K_n=(V,E).
Terms
- a(0) =1a(1) =2a(2) =1a(3) =3a(4) =6a(5) =3a(6) =1a(7) =4a(8) =18a(9) =30a(10) =24a(11) =15a(12) =6a(13) =1a(14) =5a(15) =40a(16) =135a(17) =250a(18) =295a(19) =282a(20) =215a(21) =120a(22) =45a(23) =10a(24) =1a(25) =6a(26) =75a(27) =420a(28) =1385a(29) =3015
External references
- oeis: A125205