Triangular array read by rows: T(n,k) is the number of simple labeled graphs on n vertices, n>=1, with exactly k connected components, 1<=k<=n, such that the vertices labeled with 1,2,...,k are all in different components.

A275595

Triangular array read by rows: T(n,k) is the number of simple labeled graphs on n vertices, n>=1, with exactly k connected components, 1<=k<=n, such that the vertices labeled with 1,2,...,k are all in different components.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =4a(4) =2a(5) =1a(6) =38a(7) =10a(8) =3a(9) =1a(10) =728a(11) =100a(12) =18a(13) =4a(14) =1a(15) =26704a(16) =1856a(17) =192a(18) =28a(19) =5a(20) =1a(21) =1866256a(22) =63728a(23) =3528a(24) =320a(25) =40a(26) =6a(27) =1a(28) =251548592a(29) =4169200

External references