Triangular array read by rows. T(n,k) is the number of 2-colored labeled graphs on n nodes with exactly k connected components; n>=1, 1<=k<=n.
A228892
Triangular array read by rows. T(n,k) is the number of 2-colored labeled graphs on n nodes with exactly k connected components; n>=1, 1<=k<=n.
Terms
- a(0) =2a(1) =2a(2) =4a(3) =6a(4) =12a(5) =8a(6) =38a(7) =60a(8) =48a(9) =16a(10) =390a(11) =500a(12) =360a(13) =160a(14) =32a(15) =6062a(16) =6180a(17) =3840a(18) =1680a(19) =480a(20) =64a(21) =134526a(22) =109228a(23) =56280a(24) =22400a(25) =6720a(26) =1344a(27) =128a(28) =4172198a(29) =2673468
External references
- oeis: A228892