25201854045domain: NAppears in sequencesNumber of connected labeled graphs with n edges and n nodes.at n=10A057500Triangle 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.at n=55A106239