id:A007832 - OEIS Search Results

Search: id:A007832

Displaying 1-1 of 1 results found.

page 1

Number of point labeled 5,6-free two-graphs with n nodes.

+0
1

1, 1, 2, 8, 52, 457, 4979, 64591, 972906, 16701834, 322063458, 6894918021, 162316253829, 4168330738093, 115980086558470, 3476156853885992, 111665862911781864, 3827642575341002133, 139457935266705019299 (list; graph; listen)

	OFFSET	`1,3`
	LINKS	`P. J. Cameron, Counting two-graphs related to trees, Elec. J. Combin., Vol. 2, #R4.`
	CROSSREFS	`Sequence in context: A027329 A136794 A125787 this_sequence A111088 A006351 A089467` `Adjacent sequences: A007829 A007830 A007831 this_sequence A007833 A007834 A007835`
	KEYWORD	`nonn`
	AUTHOR	`Peter Cameron [ P.J.Cameron(AT)qmw.ac.uk ]`

page 1

Search completed in 0.002 seconds

Last modified November 21 14:49 EST 2008. Contains 150807 sequences.

AT&T Labs Research