Triangular array read by rows: T(n,k) is the number of labeled acyclic digraphs on n vertices with exactly k weakly connected components, n>=0, 0<=k<=n.
A380252
Triangular array read by rows: T(n,k) is the number of labeled acyclic digraphs on n vertices with exactly k weakly connected components, n>=0, 0<=k<=n.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =2a(5) =1a(6) =0a(7) =18a(8) =6a(9) =1a(10) =0a(11) =446a(12) =84a(13) =12a(14) =1a(15) =0a(16) =26430a(17) =2590a(18) =240a(19) =20a(20) =1a(21) =0a(22) =3596762a(23) =175200a(24) =8970a(25) =540a(26) =30a(27) =1a(28) =0a(29) =1111506858
External references
- oeis: A380252