|
| |
|
|
A054958
|
|
Number of labeled connected Eulerian digraphs with n nodes and an even number of edges.
|
|
2
| |
|
|
1, 1, 4, 62, 3512, 664808, 434127872, 1019647584176, 8819902136975232, 284798318582888943488, 34636901578294133264379392
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
LINKS
| V. A. Liskovets, Some easily derivable sequences, J. Integer Sequences, 3 (2000), #00.2.2.
|
|
|
CROSSREFS
| Cf. A058338, A054955, A007080, A054959, A054956, A058337, A054957.
Sequence in context: A132064 A102193 A166028 * A191300 A087613 A202630
Adjacent sequences: A054955 A054956 A054957 * A054959 A054960 A054961
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), May 24 2000
|
|
|
EXTENSIONS
| More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Mar 06 2001
|
| |
|
|
