A082402 - OEIS

This site is supported by donations to The OEIS Foundation.

A082402

Number of n-node labeled weakly connected acyclic digraphs.

0, 1, 2, 18, 446, 26430, 3596762, 1111506858, 774460794326, 1206342801843750, 4162927142993589122, 31557464707483035620178, 521560130632321900618457246, 18669813048017298278379855511470 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,3`
	REFERENCES	`R. W. Robinson, Counting labeled acyclic digraphs, pp. 263-264 of F. Harary, editor, New Directions in the Theory of Graphs. Academic Press, NY, 1973.`
	FORMULA	`E.g.f.: ln(B(x)) where B(x) is e.g.f. for A003024. a(n) = A003024(n) - Sum_{k=1..n-1} binomial(n-1, k-1)a(k)A003024(n-k).`
	CROSSREFS	`Cf. A003024.` `Sequence in context: A152684 A201732 A141074 * A156907 A053916 A015203` `Adjacent sequences: A082399 A082400 A082401 * A082403 A082404 A082405`
	KEYWORD	`nonn`
	AUTHOR	`Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 15 2003`

Content is available under The OEIS End-User License Agreement .

Last modified February 15 16:28 EST 2012. Contains 205823 sequences.