|
Search: id:A014507
|
|
|
| A014507 |
|
Number of digraphs with loops, having unlabeled (non-isolated) nodes and n labeled edges. |
|
+0
2
|
|
| 1, 2, 13, 162, 3075, 80978, 2784067, 119971162, 6289972169, 392257225754, 28582571639293, 2398695602082442, 229094801646110203, 24652935339990534970, 2963620352166634246995
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
G. Labelle, Counting enriched multigraphs..., Discrete Math., 217 (2000), 237-248.
G. Paquin, D\'enombrement de multigraphes enrichis, M\'emoire, Math. Dept., Univ. Qu\'ebec \`a Montr\'eal, 2004.
|
|
FORMULA
|
Sum_{k=0..n} Stirling1(n, k)*Bell(2*k). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Jun 21 2003
|
|
CROSSREFS
|
Sequence in context: A058192 A054382 A062593 this_sequence A132614 A098638 A090643
Adjacent sequences: A014504 A014505 A014506 this_sequence A014508 A014509 A014510
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Simon Plouffe, gilbert(AT)lacim.uqam.ca (Gilbert Labelle).
|
|
|
Search completed in 0.002 seconds
|
