Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A054955
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A054955 Number of labeled Eulerian digraphs with n nodes and an even number of edges. +0
4
1, 2, 8, 88, 3928, 688336, 438953344, 1023160206720, 8829110851362176, 284886609918484446976, 34640035331694391965082624 (list; graph; listen)
OFFSET

1,2

LINKS

V. A. Liskovets, Some easily derivable sequences, J. Integer Sequences, 3 (2000), #00.2.2.

CROSSREFS

Adjacent sequences: A054952 A054953 A054954 this_sequence A054956 A054957 A054958

Sequence in context: A009144 A132316 A136749 this_sequence A012299 A012295 A009486

KEYWORD

nonn,easy

AUTHOR

njas, May 24 2000

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Mar 05 2001

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 October 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research