18082560domain: NAppears in sequencesNumber of binary relations R on {1,2,...,n} such that the transitive closure of R is the trivial relation.at n=5A186081Triangular array read by rows. T(n,k) is the number of binary relations on [n] containing exactly k strongly connected components, n >= 0, 0 <= k <= n.at n=16A361269