1,2

This is the 2nd row of Table 1, p. 3 in Liskovets. The first row is A003024. Abstract: In this note we derive enumerative formulas for several types of labelled acyclic directed graphs by slight modifications of the familiar recursive formula for simple acyclic digraphs. These considerations are motivated by, and based upon, recent combinatorial results in geometric topology obtained by S.Choi, who established exact correspondences between acyclic digraphs and so-called small covers over hypercubes and related polytopes. In particular, we show that the number of equivalence classes of small covers over the cartesian product of n copies of an r-simplex is equal to the number of acyclic (2^r-1)-multidigraphs of order n. Asymptotics follows easily since the main formula is represented by a simple equation in terms of special generating functions.

Valery A. Liskovets, More on counting acyclic digraphs, April 15, 2008.

1 = Sum_{n>=0} a(n)*exp(-4^n*x)*x^n/n!. - Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 22 2008

Cf. A003024.

Sequence in context: A062646 A009503 A096548 this_sequence A041851 A082168 A096348

Adjacent sequences: A137432 A137433 A137434 this_sequence A137436 A137437 A137438

nonn

Jonathan Vos Post (jvospost3(AT)gmail.com), Apr 17 2008

More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 22 2008