Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled nodes with k arcs and a global source and sink, n >= 1, k = 0..max(1,n-1)*(n-2)+1.

A350795

Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled nodes with k arcs and a global source and sink, n >= 1, k = 0..max(1,n-1)*(n-2)+1.

Terms

    a(0) =1a(1) =0a(2) =1a(3) =0a(4) =0a(5) =1a(6) =1a(7) =0a(8) =0a(9) =0a(10) =1a(11) =6a(12) =8a(13) =4a(14) =1a(15) =0a(16) =0a(17) =0a(18) =0a(19) =1a(20) =16a(21) =70a(22) =140a(23) =159a(24) =113a(25) =53a(26) =17a(27) =4a(28) =1a(29) =0

External references