Number T(n,k) of simple labeled graphs on n nodes with exactly k connected components that are trees or cycles; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
A215861
Number T(n,k) of simple labeled graphs on n nodes with exactly k connected components that are trees or cycles; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =1a(6) =0a(7) =4a(8) =3a(9) =1a(10) =0a(11) =19a(12) =19a(13) =6a(14) =1a(15) =0a(16) =137a(17) =135a(18) =55a(19) =10a(20) =1a(21) =0a(22) =1356a(23) =1267a(24) =540a(25) =125a(26) =15a(27) =1a(28) =0a(29) =17167
External references
- oeis: A215861