274806domain: NAppears in sequencesTriangle read by rows: T(n,m) = number of unlabeled graphs on n nodes with m connected components, m = 1,2,...,n.at n=46A201922Number of unlabeled graphs with n nodes that have two components, neither of which is the empty graph.at n=10A274934