id:A054926 - OEIS Search Results

Search: id:A054926

Displaying 1-1 of 1 results found.

page 1

Number of connected unlabeled graphs with n nodes and floor(n*(n-1)/4) edges.

+0
2

1, 0, 0, 2, 5, 19, 132, 1579, 33366 (list; graph; listen)

	OFFSET	`1,4`
	LINKS	`V. A. Liskovets, Some easily derivable sequences, J. Integer Sequences, 3 (2000), #00.2.2.`
	CROSSREFS	`Can be read off rows of A054924.` `Sequence in context: A107882 A089126 A113346 this_sequence A002786 A039719 A014466` `Adjacent sequences: A054923 A054924 A054925 this_sequence A054927 A054928 A054929`
	KEYWORD	`nonn,easy`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), May 24 2000`
	EXTENSIONS	`Description corrected by David Wasserman (wasserma(AT)spawar.navy.mil), Mar 05 2002`

page 1

Search completed in 0.002 seconds

Last modified December 4 23:11 EST 2009. Contains 170347 sequences.