|
| |
|
|
A054957
|
|
Number of labeled connected Eulerian digraphs with n nodes.
|
|
2
|
|
|
|
1, 1, 6, 118, 7000, 1329496, 868255024, 2039295163312, 17639804273910144, 569596637165777524096, 69273803156588266525129984
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,3
|
|
|
LINKS
|
Table of n, a(n) for n=1..11.
V. A. Liskovets, Some easily derivable sequences, J. Integer Sequences, 3 (2000), #00.2.2.
|
|
|
CROSSREFS
|
Cf. A058338, A054955, A007080, A054959, A054956, A058337, A054958.
Sequence in context: A100070 A135869 A218713 * A081537 A127726 A117063
Adjacent sequences: A054954 A054955 A054956 * A054958 A054959 A054960
|
|
|
KEYWORD
|
nonn,easy
|
|
|
AUTHOR
|
N. J. A. Sloane, May 24 2000
|
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic, Mar 06 2001
|
|
|
STATUS
|
approved
|
| |
|
|
