id:A054945 - OEIS Search Results

Search: id:A054945

Displaying 1-1 of 1 results found.

page 1

Number of strongly connected labeled digraphs on n nodes with an odd number of edges.

+0
2

0, 0, 8, 800, 282528, 367387328, 1761545807424, 31759604694829568, 2200205489188051284480, 595216852658907342647518208, 635231932478914399659212336569344 (list; graph; listen)

	OFFSET	`1,3`
	LINKS	`V. A. Liskovets, Some easily derivable sequences, J. Integer Sequences, 3 (2000), #00.2.2.`
	FORMULA	`a(n)=(A003030(n)-(n-1)!)/2.`
	CROSSREFS	`Cf. A054944.` `Sequence in context: A060183 A145415 A001547 this_sequence A158817 A159707 A097818` `Adjacent sequences: A054942 A054943 A054944 this_sequence A054946 A054947 A054948`
	KEYWORD	`nonn,easy`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), May 24 2000`
	EXTENSIONS	`More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 15 2000`

page 1

Search completed in 0.002 seconds

Last modified November 24 23:16 EST 2009. Contains 167481 sequences.

AT&T Labs Research