|
%I #64 Mar 16 2023 04:50:46
%S 1,1,1,2,1,6,12,6,1,12,60,152,186,108,24,1,20,180,940,3050,6180,7960,
%T 6540,3330,960,120,1,30,420,3600,20790,83952,240480,496680,750810,
%U 838130,691020,416160,178230,51480,9000,720,1,42,840,10570,93030,601944
%N Irregular array, read by rows: T(n,k) is the number of labeled acyclic digraphs with n nodes and k arcs (n >= 0, 0 <= k <= n*(n-1)/2).
%H Andrew Howroyd, <a href="/A081064/b081064.txt">Table of n, a(n) for n = 0..1350</a> (rows 0..20)
%H E. de Panafieu and S. Dovgal, <a href="https://arxiv.org/abs/1903.09454">Symbolic method and directed graph enumeration</a>, arXiv:1903.09454 [math.CO], 2019.
%H R. W. Robinson, <a href="http://cobweb.cs.uga.edu/~rwr/publications/components.pdf">Counting digraphs with restrictions on the strong components</a>, Combinatorics and Graph Theory '95 (T.-H. Ku, ed.), World Scientific, Singapore (1995), 343-354.
%H V. I. Rodionov, <a href="https://doi.org/10.1016/0012-365X(92)90155-9">On the number of labeled acyclic digraphs</a>, Discr. Math. 105 (1-3) (1992), 319-321.
%F 1 = 1*exp(-x) + 1*exp(-(1+y)*x)*x/1! + (2*y+1)*exp(-(1+y)^2*x)*x^2/2! + (6*y^3 + 12*y^2 + 6*y + 1)*exp(-(1+y)^3*x)*x^3/3! + (24*y^6 + 108*y^5 + 186*y^4 + 152*y^3 + 60*y^2 + 12*y + 1)*exp(-(1+y)^4*x)*x^4/4! + (120*y^10 + 960*y^9 + 3330*y^8 + 6540*y^7 + 7960*y^6 + 6180*y^5 + 3050*y^4 + 940*y^3 + 180*y^2 + 20*y + 1)*exp(-(1+y)^5*x)*x^5/5! + ... - _Vladeta Jovovic_, Jun 07 2005
%F We explain _Vladeta Jovovic_'s functional equation above. If F_n(y) = Sum_{k = 0..n*(n-1)/2) T(n,k) * y^k for n >= 0, then Sum_{n >= 0} F_n(y) * exp(-(1 + y)^n * x) * x^n/n! = 1. - _Petros Hadjicostas_, Apr 11 2020
%F From _Petros Hadjicostas_, Apr 10 2020: (Start)
%F If A_n(x) = Sum_{k >= 0} T(n,k)*x^k (with T(n,k) = 0 for k > n*(n-1)/2)), then Sum_{m=1..n} (-1)^(m-1) * binomial(n,m) * (1 + x)^(m*(n-m)) * A_m(x) = 1.
%F T(n,0) = 1, T(n,1) = n*(n-1), T(n,2) = 12*binomial(n+1,4), and T(n,3) = binomial(n,3)*(n^3 - 5*n - 6).
%F Also, T(n, n*(n-1)/2 - 1) = A055533(n) = n!*(n-1)^2/2 for n > 1. (End)
%e Array T(n,k) (with n >= 0 and 0 <= k <= n*(n-1)/2) begins as follows:
%e 1;
%e 1;
%e 1, 2;
%e 1, 6, 12, 6;
%e 1, 12, 60, 152, 186, 108, 24;
%e 1, 20, 180, 940, 3050, 6180, 7960, 6540, 3330, 960, 120;
%e ...
%e From _Petros Hadjicostas_, Apr 10 2020: (Start)
%e For n=2 and k=2, we have T(2,2) = 2 labeled directed acyclic graphs with 2 nodes and 2 arcs: [A (double ->) B] and [B (double ->) A].
%e For n=3 and k=4, we have T(3,4) = 6 labeled directed acyclic graphs with 3 nodes and 4 arcs: [X (double ->) Y (single ->) Z (single <-) X] with (X,Y,Z) a permutation of {A,B,C}. (End)
%p A081064gf := proc(n,x)
%p local m,a ;
%p option remember;
%p if n = 0 then
%p 1;
%p else
%p a := 0 ;
%p for m from 1 to n do
%p a := a+(-1)^(m-1)*binomial(n,m)*(1+x)^(m*(n-m)) *procname(n-m,x) ;
%p end do:
%p expand(a) ;
%p end if;
%p end proc:
%p A081064 := proc(n,k)
%p coeff(A081064gf(n,x),x,k) ;
%p end proc:
%p for n from 0 to 8 do
%p for k from 0 do
%p tnk := A081064(n,k) ;
%p if tnk =0 then
%p break;
%p end if;
%p printf("%d ",tnk) ;
%p end do:
%p printf("\n") ;
%p end do: # _R. J. Mathar_, Mar 21 2019
%t nn = 6; a[n_] := a[n] = Sum[(-1)^(k + 1) Binomial[n, k] (1 + x)^(k (n - k)) a[ n - k], {k, 1, n}]; a[0] = 1; Table[CoefficientList[a[n], x], {n, 0, nn}] // Grid (* _Geoffrey Critzer_, Mar 11 2023 *)
%o (PARI)
%o B(n)={my(v=vector(n)); for(n=1, #v, v[n]=vector(n, i, if(i==n, 1, my(u=v[n-i]); sum(j=1, #u, (1+'y)^(i*(#u-j))*((1+'y)^i-1)^j * binomial(n,i) * u[j])))); v}
%o T(n)={my(v=B(n)); vector(#v+1, n, if(n==1, [1], Vecrev(vecsum(v[n-1]))))}
%o { my(A=T(5)); for(i=1, #A, print(A[i])) } \\ _Andrew Howroyd_, Dec 27 2021
%Y Cf. A003024 (row sums), A055533 (subdiagonal).
%Y Columns: A147796 (k = 3), A147817 (k = 4), A147821 (k = 5), A147860 (k = 6), A147872 (k = 7), A147881 (k = 8), A147883 (k = 9), A147964 (k = 10).
%K easy,nonn,tabf
%O 0,4
%A _Vladeta Jovovic_, Apr 15 2003
%E T(0,0) = 1 prepended by _Petros Hadjicostas_, Apr 11 2020
|
