A003088 - OEIS

This site is supported by donations to The OEIS Foundation.

A003088

Number of unilateral digraphs with n unlabeled nodes.
(Formerly M2011)

1, 1, 2, 11, 171, 8603, 1478644 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,3`
	REFERENCES	`F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 218.` `R. C. Read (rcread(AT)math.uwaterloo.ca), email to N. J. A. Sloane (njas(AT)research.att.com), 28 August, 2000.` `R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.` `N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).`
	LINKS	`R. W. Robinson, Counting strong digraphs (research announcement), J. Graph Theory 1, 1977, pp. 189-190.`
	CROSSREFS	`Cf. A057270, A003029 (labeled case), A003085, A035512, A051421, A049531, A049512.` `Sequence in context: A013050 A051255 A120445 * A121231 A122527 A039747` `Adjacent sequences: A003085 A003086 A003087 * A003089 A003090 A003091`
	KEYWORD	`nonn,nice,more`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`
	EXTENSIONS	`Note that Read and Wilson incorrectly give a(4) as 172 - thanks to Vladeta Jovovic, Goran Kilibarda (vladeta(AT)eunet.rs) for finding this error and for verifying a(5).`

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

Last modified February 15 21:45 EST 2012. Contains 205860 sequences.