|
Search: id:A069736
|
|
|
| A069736 |
|
Total number of Eulerian circuits in labeled multigraphs with n edges. |
|
+0
2
|
|
| 1, 2, 13, 150, 2541, 57330, 1623105, 55405350, 2216439225, 101738006370, 5271938032725, 304455567165750, 19391501988260325, 1350480167457671250, 102096314890336391625, 8327231070135771543750, 728877648485930118800625
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
B. Lass, Demonstration combinatoire de la formule de Harer-Zagier, C. R. Acad. Sci. Paris, Serie I, 333 (2001) No 3, 155-160.
|
|
LINKS
|
Valery Liskovets, A Note on the Total Number of Double Eulerian Circuits in Multigraphs , Journal of Integer Sequences, Vol. 5 (2002), Article 02.2.5
|
|
FORMULA
|
a(n)=(2n)!/(2^n n!)(3^(n+1)-1)/(2(n+1)). G.f.: f(x)=(sqrt{1-2x}-sqrt{1-6x})/2x.
|
|
CROSSREFS
|
Cf. A011781.
Sequence in context: A107699 A079330 A059367 this_sequence A058192 A054382 A062593
Adjacent sequences: A069733 A069734 A069735 this_sequence A069737 A069738 A069739
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Valery A. Liskovets (liskov(AT)im.bas-net.by), Apr 07 2002
|
|
|
Search completed in 0.002 seconds
|
