|
Search: id:A054959
|
|
|
| A054959 |
|
Number of labeled connected Eulerian digraphs with n nodes and an odd number of edges. |
|
+0
3
|
|
| 0, 0, 2, 56, 3488, 664688, 434127152, 1019647579136, 8819902136934912, 284798318582888580608, 34636901578294133260750592
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
LINKS
|
V. A. Liskovets, Some easily derivable sequences, J. Integer Sequences, 3 (2000), #00.2.2.
|
|
CROSSREFS
|
Cf. A058338, A054955, A007080, A054956, A058337, A054958, A054957.
Sequence in context: A080313 A080268 A009555 this_sequence A080318 A002542 A041391
Adjacent sequences: A054956 A054957 A054958 this_sequence A054960 A054961 A054962
|
|
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
|
|
|
Search completed in 0.002 seconds
|
