Triangle read by rows: T(n,m) = number of graphs on n labeled nodes, with m components of size = order. Also number of graphs on n labeled nodes with m unicyclic components.

A106239

Triangle read by rows: T(n,m) = number of graphs on n labeled nodes, with m components of size = order. Also number of graphs on n labeled nodes with m unicyclic components.

Terms

    a(0) =0a(1) =0a(2) =0a(3) =1a(4) =0a(5) =0a(6) =15a(7) =0a(8) =0a(9) =0a(10) =222a(11) =0a(12) =0a(13) =0a(14) =0a(15) =3660a(16) =10a(17) =0a(18) =0a(19) =0a(20) =0a(21) =68295a(22) =525a(23) =0a(24) =0a(25) =0a(26) =0a(27) =0a(28) =1436568a(29) =20307

External references