|
| |
|
|
A135388
|
|
Number of Eulerian circuits on the complete graph K_{2n+1}.
|
|
0
| |
|
|
2, 264, 129976320, 911520057021235200, 257326999238092967427785160130560, 6705710151431658873046319662156165939200000000000000, 32132958735643556926111996291480203406145819659840760945049600000000000000000
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
REFERENCES
| B. D. McKay, Applications of a technique for labeled enumeration, Congress. Numerantium, 40 (1983), 207-221.
|
|
|
LINKS
| Brendan D. McKay and Robert W. Robinson, Asymptotic enumeration of Eulerian circuits in the complete graph, Combinatorics, Probability and Computing, 7 (1998), 437-449.
|
|
|
FORMULA
| a(n) = A007082(n) * (n-1)!^(2*n+1)
|
|
|
CROSSREFS
| Cf. A007082.
Sequence in context: A122862 A137105 A007082 * A188964 A007512 A048534
Adjacent sequences: A135385 A135386 A135387 * A135389 A135390 A135391
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Max Alekseyev (maxale(AT)gmail.com), Dec 10 2007
|
| |
|
|
