|
Search: id:A020562
|
|
|
| A020562 |
|
Number of cyclic multigraphs on n labeled edges (without loops). |
|
+0
1
|
|
| 1, 1, 3, 17, 152, 1933, 32608, 695657, 18148533, 564860131, 20581455139, 864802010595, 41392831046804, 2233799248861031, 134737655762330602, 9015762313899965851, 664889968074287179739
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
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.
|
|
CROSSREFS
|
Sequence in context: A135750 A007767 A075820 this_sequence A135751 A001469 A110501
Adjacent sequences: A020559 A020560 A020561 this_sequence A020563 A020564 A020565
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Gilbert Labelle (gilbert(AT)lacim.uqam.ca), Simon Plouffe (plouffe(AT)math.uqam.ca)
|
|
|
Search completed in 0.002 seconds
|
