Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A058337
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A058337 Eulerian digraphs with n nodes. +0
6
1, 1, 1, 3, 12, 90, 2162 (list; graph; listen)
OFFSET

0,4

COMMENT

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: A039305 A124191 A065087 this_sequence A025503 A078124 A115245

Adjacent sequences: A058334 A058335 A058336 this_sequence A058338 A058339 A058340

KEYWORD

nonn,nice,more

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research