id:A007833 - OEIS Search Results

Search: id:A007833

Displaying 1-1 of 1 results found.

page 1

Number of point-labeled reduced two-graphs with n nodes.

+0
3

1, 0, 1, 1, 28, 448, 18788, 1419852, 207249896, 58206408344, 31725488477648, 33830818147141904, 71068681534173472576, 295648155633330113713344, 2444510010072634827916776064 (list; graph; listen)

	OFFSET	`1,5`
	COMMENT	`Also number of (n-1)-node labeled mating graphs without isolated nodes, cf. A006024. - Vladeta Jovovic (vladeta(AT)eunet.rs), Mar 23 2004`
	LINKS	`P. J. Cameron, Counting two-graphs related to trees, Elec. J. Combin., Vol. 2, #R4.`
	CROSSREFS	`Sequence in context: A125485 A054337 A009685 this_sequence A080315 A022752 A000771` `Adjacent sequences: A007830 A007831 A007832 this_sequence A007834 A007835 A007836`
	KEYWORD	`nonn`
	AUTHOR	`Peter Cameron [ P.J.Cameron(AT)qmw.ac.uk ]`

page 1

Search completed in 0.002 seconds

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.

AT&T Labs Research