id:A006713 - OEIS Search Results

Search: id:A006713

Displaying 1-1 of 1 results found.

page 1

Number of 3-edge-colored connected trivalent graphs with 2n nodes.
(Formerly M4310)

+0
1

6, 480, 196560, 153498240, 214951968000 (list; graph; listen)

	OFFSET	`2,1`
	REFERENCES	`R. C. Read, Some Enumeration Problems in Graph Theory. Ph.D. Dissertation, Department of Mathematics, Univ. London, 1958.`
	CROSSREFS	`Adjacent sequences: A006710 A006711 A006712 this_sequence A006714 A006715 A006716` `Sequence in context: A112945 A080295 A084108 this_sequence A006712 A099057 A123278`
	KEYWORD	`nonn`
	AUTHOR	`njas`

page 1

Search completed in 0.002 seconds

Last modified May 16 01:24 EDT 2008. Contains 139630 sequences.