Triangle read by rows: T(n,k) is the number of colored digraphs on n nodes with exactly k colors assigned in a fix order according the node count (1 <= k <= n).
A329541
Triangle read by rows: T(n,k) is the number of colored digraphs on n nodes with exactly k colors assigned in a fix order according the node count (1 <= k <= n).
Terms
- a(0) =1a(1) =3a(2) =4a(3) =16a(4) =36a(5) =64a(6) =218a(7) =1856a(8) =2112a(9) =4096a(10) =9608a(11) =136376a(12) =445440a(13) =528384a(14) =1048576a(15) =1540944a(16) =62020640a(17) =270506880a(18) =449511424a(19) =537919488a(20) =1073741824a(21) =882033440a(22) =55259421024a(23) =435010671104
External references
- oeis: A329541