id:A006800 - OEIS Search Results

Search: id:A006800

Displaying 1-1 of 1 results found.

page 1

Number of connected transitive graphs with n nodes.
(Formerly M0345)

+0
2

1, 1, 1, 2, 2, 5, 3, 10, 7, 18, 7, 64, 13, 51, 44, 272, 35, 365, 59, 1190, 235, 807, 187, 15422, 461, 4221, 1425, 25792, 1181, 46236, 2191 (list; graph; listen)

	OFFSET	`1,4`
	REFERENCES	`McKay, Brendan D.; Royle, Gordon F.; The transitive graphs with at most $26$ vertices. Ars Combin. 30 (1990), 161-176.` `B. D. McKay, personal communication.`
	LINKS	`Eric Weisstein's World of Mathematics, Vertex-Transitive Graph` `Steven Skiena, A Database of Graphs in Combinatorica Format.`
	CROSSREFS	`Sequence in context: A075545 A006307 A133440 this_sequence A113177 A135281 A068465` `Adjacent sequences: A006797 A006798 A006799 this_sequence A006801 A006802 A006803`
	KEYWORD	`nonn,nice`
	AUTHOR	`njas`
	EXTENSIONS	`More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Jun 30 2007`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research