Triangle read by rows: T(n,k) is the number of colored digraphs on n nodes with exactly k colors arbitrarily assigned (1 <= k <= n).

A329546

Triangle read by rows: T(n,k) is the number of colored digraphs on n nodes with exactly k colors arbitrarily assigned (1 <= k <= n).

Terms

    a(0) =1a(1) =3a(2) =4a(3) =16a(4) =72a(5) =64a(6) =218a(7) =2608a(8) =6336a(9) =4096a(10) =9608a(11) =272752a(12) =1336320a(13) =2113536a(14) =1048576a(15) =1540944a(16) =93847104a(17) =812045184a(18) =2337046528a(19) =2689597440a(20) =1073741824a(21) =882033440a(22) =110518842048

External references