id:A058338 - OEIS Search Results

Search: id:A058338

Displaying 1-1 of 1 results found.

page 1

Number of digraphs with indegree = outdegree at each vertex, or Eulerian digraphs (including disconnected graphs) with n nodes.

+0
5

1, 1, 2, 5, 18, 111, 2292 (list; graph; listen)

	OFFSET	`0,3`
	REFERENCES	`F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 219 (but there is an error).` `R. C. Read (rcread(AT)math.uwaterloo.ca), email to N. J. A. Sloane (njas(AT)research.att.com), 28 August, 2000.`
	CROSSREFS	`Cf. A058337.` `Sequence in context: A093730 A007769 A005805 this_sequence A006896 A125625 A097584` `Adjacent sequences: A058335 A058336 A058337 this_sequence A058339 A058340 A058341`
	KEYWORD	`nonn,nice,more`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.