642180domain: NAppears in sequencesa(n) is the least k such that there are exactly n divisors d of k for which k/d-d is prime.at n=29A340729Triangle read by rows: T(n, k) is the number of graphs obtained by adding k pierced circles to a path graph P_n.at n=49A354127