|
Search: id:A054941
|
|
|
| A054941 |
|
Number of connected oriented graphs on n nodes. |
|
+0
3
|
|
| 1, 2, 20, 624, 55248, 13982208, 10358360640, 22792648882176, 149888345786341632, 2952810709943411146752, 174416705255313941476193280, 30901060796613886817249881227264
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
V. A. Liskovets, Some easily derivable sequences, J. Integer Sequences, 3 (2000), #00.2.2.
|
|
FORMULA
|
E.g.f.: 1+ln( Sum_{n >= 0} 3^binomial(n, 2)*x^n/n! ). - Vladeta Jovovic (vladeta(AT)eunet.rs), Feb 14 2003
|
|
CROSSREFS
|
Sequence in context: A009399 A009182 A015207 this_sequence A012495 A158268 A163594
Adjacent sequences: A054938 A054939 A054940 this_sequence A054942 A054943 A054944
|
|
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), Feb 14 2003
|
|
|
Search completed in 0.002 seconds
|
