login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A058337 Eulerian digraphs with n nodes. 5
1, 1, 1, 3, 12, 90, 2162 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

COMMENTS

Assumed to be weakly connected.

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.

LINKS

Eric Weisstein's World of Mathematics, Eulerian Graph

CROSSREFS

Cf. A058338.

Sequence in context: A174463 A124191 A065087 * A025503 A078124 A115245

Adjacent sequences:  A058334 A058335 A058336 * A058338 A058339 A058340

KEYWORD

nonn,nice,more

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 13 12:30 EST 2012. Contains 205469 sequences.