38562309domain: NAppears in sequencesNumber of labeled n-node connected graphs with at most one cycle.at n=9A129271Triangular array read by rows: T(n,k) is the number of simple labeled graphs on n nodes with exactly k components where each component has at most one cycle; n>=1, 1<=k<=n.at n=36A217756