Triangle read by rows: T(n,k) is the number of hypergraphs on n labeled vertices with exactly k connected components, n>=1, 1<=k<=n.
A285616
Triangle read by rows: T(n,k) is the number of hypergraphs on n labeled vertices with exactly k connected components, n>=1, 1<=k<=n.
Terms
- a(0) =2a(1) =4a(2) =4a(3) =96a(4) =24a(5) =8a(6) =31840a(7) =816a(8) =96a(9) =16a(10) =2147156736a(11) =322240a(12) =4320a(13) =320a(14) =32a(16) =25767883392a(17) =1957440a(18) =18240a(19) =960a(20) =64a(23) =180389362944a(24) =9251200a(25) =67200a(26) =2688a(27) =128
External references
- oeis: A285616