3533720domain: NAppears in sequencesRegular triangle read by rows where T(n,k) is the number of labeled connected graphs with loops with n edges and k vertices, 1 <= k <= n+1.at n=43A322147Number of connected labeled graphs with n edges and n vertices and with loops allowed.at n=8A368951