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, 179098 (list; graph; refs; listen; history; text; 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, 28 August, 2000.

LINKS

Table of n, a(n) for n=0..7.

Eric Weisstein's World of Mathematics, Eulerian Graph

CROSSREFS

Cf. A058338.

Sequence in context: A124191 A065087 A305870 * A025503 A263801 A078124

Adjacent sequences:  A058334 A058335 A058336 * A058338 A058339 A058340

KEYWORD

nonn,nice,hard,more

AUTHOR

N. J. A. Sloane.

EXTENSIONS

a(7) (generated graphs with nauty, filtered and counted with Python) by Pietro Battiston, Feb 08 2014

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 12 22:01 EST 2018. Contains 317116 sequences. (Running on oeis4.)