id:A007082 - OEIS Search Results

Search: id:A007082

Displaying 1-1 of 1 results found.

page 1

Number of Eulerian circuits on the complete graph K_{2n+1}, divided by (n-1)!^{2n+1}.
(Formerly M2183)

+0
2

2, 264, 1015440, 90449251200, 169107043478365440, 6267416821165079203599360, 4435711276305905572695127676467200, 58393052751308545653929138771580386824519680, 14021772793551297695593332913856884153315254190271692800, 60498832138791357698014788383803842810832836262245623803123983974400 (list; graph; listen)

	OFFSET	`1,1`
	REFERENCES	`B. D. McKay, Applications of a technique for labeled enumeration, Congress. Numerantium, 40 (1983), 207-221.` `Brendan D. McKay and Robert W. Robinson, Asymptotic enumeration of Eulerian circuits in the complete graph, Combinatorics, Probability and Computing, 7 (1998), 437-449.` `N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).`
	CROSSREFS	`Sequence in context: A103029 A122862 A137105 this_sequence A135388 A007512 A048534` `Adjacent sequences: A007079 A007080 A007081 this_sequence A007083 A007084 A007085`
	KEYWORD	`nonn,nice`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Mira Bernstein (mira(AT)math.berkeley.edu)`
	EXTENSIONS	`The 1998 paper gives terms up to n=10 [i.e. up through K_{21}]` `More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Mar 28 2003`

page 1

Search completed in 0.002 seconds

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.

AT&T Labs Research