Number T(n,k) of undirected labeled graphs on n nodes with exactly k cycle graphs as connected components; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
A215771
Number T(n,k) of undirected labeled graphs on n nodes with exactly k cycle graphs as connected components; 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) =1a(8) =3a(9) =1a(10) =0a(11) =3a(12) =7a(13) =6a(14) =1a(15) =0a(16) =12a(17) =25a(18) =25a(19) =10a(20) =1a(21) =0a(22) =60a(23) =127a(24) =120a(25) =65a(26) =15a(27) =1a(28) =0a(29) =360
External references
- oeis: A215771