|
%I #23 Apr 20 2020 00:26:39
%S 1,1,2,1,1,6,15,20,15,6,1,1,12,66,220,495,792,924,792,495,220,66,12,1,
%T 1,20,190,1140,4845,15504,38760,77520,125970,167960,184756,167960,
%U 125970,77520,38760,15504,4845,1140,190,20,1,1,30,435,4060,27405,142506,593775
%N Triangle read by rows: T(n,k) = number of labeled loopless digraphs with n nodes and k arcs (n >= 1, 0 <= k <= n*(n-1)).
%D J. L. Gross and J. Yellen, eds., Handbook of Graph Theory, CRC Press, 2004; p. 521.
%H G. C. Greubel, <a href="/A123554/b123554.txt">Table of n, a(n) for the first 25 rows, flattened</a>
%F T(n,k) = binomial(n*(n-1), k). - _Andrew Howroyd_, Apr 19 2020
%e Triangle begins:
%e 1
%e 1 2 1
%e 1 6 15 20 15 6 1
%e 1 12 66 220 495 792 924 792 495 220 66 12 1
%t Table[CoefficientList[Series[(1+x)^(2*Binomial[n,2]), {x,0,2*Binomial[n,2]}], x], {n,6}] (* _Geoffrey Critzer_, Nov 12 2011 *)
%o (PARI) T(n,k)={binomial(n*(n-1), k)}
%o {for(n=1, 5, for(k=0, n*(n-1), print1(T(n,k), ", ")); print)} \\ _Andrew Howroyd_, Apr 19 2020
%Y Row sums are A053763.
%Y Cf. A052283 (unlabeled analog).
%K nonn,tabf
%O 1,3
%A _N. J. A. Sloane_, Nov 15 2006
%E More terms from _Vladeta Jovovic_, Nov 15 2006
|
