id:A054944 - OEIS Search Results

Search: id:A054944

Displaying 1-1 of 1 results found.

page 1

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

+0
2

1, 1, 10, 806, 282552, 367387448, 1761545808144, 31759604694834608, 2200205489188051324800, 595216852658907342647881088, 635231932478914399659212340198144 (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. A054945.` `Sequence in context: A159709 A015057 A006440 this_sequence A015093 A104906 A013386` `Adjacent sequences: A054941 A054942 A054943 this_sequence A054945 A054946 A054947`
	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 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research