Triangle read by rows: T(n,k) = number of labeled graphs on n nodes with k connected components, 1<=k<=n.
A143543
Triangle read by rows: T(n,k) = number of labeled graphs on n nodes with k connected components, 1<=k<=n.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =4a(4) =3a(5) =1a(6) =38a(7) =19a(8) =6a(9) =1a(10) =728a(11) =230a(12) =55a(13) =10a(14) =1a(15) =26704a(16) =5098a(17) =825a(18) =125a(19) =15a(20) =1a(21) =1866256a(22) =207536a(23) =20818a(24) =2275a(25) =245a(26) =21a(27) =1a(28) =251548592a(29) =15891372
External references
- oeis: A143543