Triangular array read by rows. T(n,k) is the number of labeled directed acyclic graphs on [n] with exactly k nodes of indegree 0.
A361718
Triangular array read by rows. T(n,k) is the number of labeled directed acyclic graphs on [n] with exactly k nodes of indegree 0.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =2a(5) =1a(6) =0a(7) =15a(8) =9a(9) =1a(10) =0a(11) =316a(12) =198a(13) =28a(14) =1a(15) =0a(16) =16885a(17) =10710a(18) =1610a(19) =75a(20) =1a(21) =0a(22) =2174586a(23) =1384335a(24) =211820a(25) =10575a(26) =186a(27) =1a(28) =0a(29) =654313415
External references
- oeis: A361718