653318domain: NAppears in sequencesTriangle read by rows: T(n,k) is the number of simple connected graphs on n unlabeled nodes with k cycles and no node a member of more than one cycle, 0 <= k <= floor(n/3).at n=53A381467Number of simple connected graphs on n unlabeled nodes with exactly 2 non-overlapping cycles.at n=10A381470