15368192domain: NAppears in sequencesTriangle read by rows: T(n,k) is the number of oriented graphs on n labeled nodes whose underlying graph is k-regular, k = 0..n-1.at n=38A351263Number of completely asymmetric matchings (not containing centered or coupled arcs) of [2n].at n=9A382134