id:A054940 - OEIS Search Results

Search: id:A054940

Displaying 1-1 of 1 results found.

page 1

Number of connected labeled graphs with n nodes and an odd number of edges.

+0
1

0, 1, 1, 22, 352, 13412, 932768, 125776816, 33148125376, 17248244478848, 17820828772662272, 36677298103403269504, 150636101324831804975104, 1235824405515221870758956032, 20263840468865240117261288526848 (list; graph; listen)

	OFFSET	`1,4`
	LINKS	`V. A. Liskovets, Some easily derivable sequences, J. Integer Sequences, 3 (2000), #00.2.2.`
	FORMULA	`a(n)=(A001187(n)+(-1)^n*A000142(n-1))/2.`
	CROSSREFS	`Cf. A054939.` `Sequence in context: A103722 A100904 A036738 this_sequence A016265 A016263 A001718` `Adjacent sequences: A054937 A054938 A054939 this_sequence A054941 A054942 A054943`
	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 17 2000`

page 1

Search completed in 0.002 seconds

Last modified November 30 13:13 EST 2009. Contains 167758 sequences.

AT&T Labs Research