id:A122081 - OEIS Search Results

Search: id:A122081

Displaying 1-1 of 1 results found.

page 1

A122081

Number of unlabeled bicolored graphs, with no isolated nodes, on 2n nodes having n nodes of each color and allowing the color classes to be interchanged.

+0
4

1, 1, 3, 14, 115, 2086, 101791, 14835870, 6852422567, 10338780759514, 51804974736769271 (list; graph; listen)

	OFFSET	`0,3`
	REFERENCES	`R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976.`
	CROSSREFS	`Cf. A007139.` `Sequence in context: A121951 A085244 A007140 this_sequence A161936 A127850 A061029` `Adjacent sequences: A122078 A122079 A122080 this_sequence A122082 A122083 A122084`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Oct 18 2006`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research