id:A054960 - OEIS Search Results

Search: id:A054960

Displaying 1-1 of 1 results found.

page 1

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

+0
8

0, 1, 2, 5, 16, 78, 522, 6168, 137316, 6002584, 509498932, 82545585936, 25251015681176, 14527077828617744, 15713242984902154384, 32000507852263778595584, 122967932076766466336249888 (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)=(A000088(n)-A000171(n))/2.`
	CROSSREFS	`Cf. A007869 for graphs with an even number of edges.` `Sequence in context: A002632 A020127 A121396 this_sequence A004110 A048754 A037075` `Adjacent sequences: A054957 A054958 A054959 this_sequence A054961 A054962 A054963`
	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 19 2000`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research