id:A054956 - OEIS Search Results

Search: id:A054956

Displaying 1-1 of 1 results found.

page 1

Number of labeled Eulerian digraphs with n nodes and an odd number of edges.

+0
4

0, 0, 2, 64, 3808, 687616, 438948304, 1023160166400, 8829110850999296, 284886609918480818176, 34640035331694391925165824 (list; graph; listen)

	OFFSET	`1,3`
	LINKS	`V. A. Liskovets, Some easily derivable sequences, J. Integer Sequences, 3 (2000), #00.2.2.`
	CROSSREFS	`Sequence in context: A127691 A013822 A010047 this_sequence A085535 A060613 A139772` `Adjacent sequences: A054953 A054954 A054955 this_sequence A054957 A054958 A054959`
	KEYWORD	`nonn,easy`
	AUTHOR	`njas, May 24 2000`
	EXTENSIONS	`More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Mar 05 2001`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.