A007130 - OEIS

This site is supported by donations to The OEIS Foundation.

A007130

Number of unlabeled rooted strength 3 Eulerian graphs with n nodes.
(Formerly M4242)

1, 1, 6, 41, 816, 54121, 14274660, 14153665099, 51048862475458, 667165739670566962, 31770009199858957846460, 5550661350485312810140308676, 3581414124954098378653083208146076 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,3`
	REFERENCES	`R. W. Robinson, personal communication.` `R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1979.` `N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).`
	LINKS	`R. W. Robinson, Table of n, a(n) for n = 1..22`
	CROSSREFS	`Sequence in context: A178824 A006198 A167588 * A075000 A112960 A181041` `Adjacent sequences: A007127 A007128 A007129 * A007131 A007132 A007133`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com).`

Content is available under The OEIS End-User License Agreement .

Last modified February 15 18:22 EST 2012. Contains 205835 sequences.