Triangle read by rows: T(n,k) = number of labeled acyclic digraphs with n nodes, containing exactly n+1-k points of in-degree zero (n >= 1, 1<=k<=n).
A058876
Triangle read by rows: T(n,k) = number of labeled acyclic digraphs with n nodes, containing exactly n+1-k points of in-degree zero (n >= 1, 1<=k<=n).
Terms
- a(0) =1a(1) =1a(2) =2a(3) =1a(4) =9a(5) =15a(6) =1a(7) =28a(8) =198a(9) =316a(10) =1a(11) =75a(12) =1610a(13) =10710a(14) =16885a(15) =1a(16) =186a(17) =10575a(18) =211820a(19) =1384335a(20) =2174586a(21) =1a(22) =441a(23) =61845a(24) =3268125a(25) =64144675a(26) =416990763a(27) =654313415a(28) =1a(29) =1016
External references
- oeis: A058876