|
Search: id:A003084
|
|
|
| A003084 |
|
Related to number of digraphs.
(Formerly M3993)
|
|
+0
2
|
|
| 1, 5, 40, 801, 46821, 9185102, 6163297995, 14339791643249, 117235455142196308, 3412474003994007703605, 357748249084029269153547905, 136400554886800212073525651823742
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 124, table 5.1.2, p*a_p
|
|
FORMULA
|
Sum a(n) x^n / n = log (1 + Sum d(n) x^n ), where d(n) is # digraphs on n nodes (A000273 ).
|
|
CROSSREFS
|
Sequence in context: A113079 A138427 A005330 this_sequence A010573 A043083 A041599
Adjacent sequences: A003081 A003082 A003083 this_sequence A003085 A003086 A003087
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
Corrected and extended by Vladeta Jovovic (vladeta(AT)Eunet.yu), Jan 09 2000
|
|
|
Search completed in 0.002 seconds
|
