id:A054922 - OEIS Search Results

Search: id:A054922

Displaying 1-1 of 1 results found.

page 1

Number of connected unlabeled symmetric relations (graphs with loops) having n nodes such that complement is also connected.

+0
1

2, 0, 0, 10, 164, 2670, 56724, 1867860, 104538928, 10461483366, 1912179618740, 644464839239880, 402785011941549964, 468944407349226545614, 1021179521951204217530900, 4174755063830188009750183026 (list; graph; listen)

	OFFSET	`1,1`
	LINKS	`V. A. Liskovets, Some easily derivable sequences, J. Integer Sequences, 3 (2000), #00.2.2.`
	FORMULA	`2*A054921(n)-A000666(n).`
	CROSSREFS	`Sequence in context: A000425 A010893 A000171 this_sequence A061848 A120556 A120560` `Adjacent sequences: A054919 A054920 A054921 this_sequence A054923 A054924 A054925`
	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 December 10 12:37 EST 2009. Contains 170569 sequences.

AT&T Labs Research