|
| |
|
|
A054943
|
|
Number of connected oriented graphs on n nodes with an odd number of edges.
|
|
0
|
|
|
|
0, 2, 8, 320, 27584, 6991360, 5179178368, 11396324458496, 74944172892993536, 1476405354971707604992, 87208352627656970712229888, 15450530398306943408625302896640, 8211400756816955708062672318337859584
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Table of n, a(n) for n=1..13.
V. A. Liskovets, Some easily derivable sequences, J. Integer Sequences, 3 (2000), #00.2.2.
|
|
|
CROSSREFS
|
Sequence in context: A013086 A012536 A012541 * A013135 A012999 A013003
Adjacent sequences: A054940 A054941 A054942 * A054944 A054945 A054946
|
|
|
KEYWORD
|
nonn,easy,changed
|
|
|
AUTHOR
|
N. J. A. Sloane, May 24 2000
|
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic, Mar 11 2003
|
|
|
STATUS
|
approved
|
| |
|
|
