A007133 - OEIS

This site is supported by donations to The OEIS Foundation.

A007133

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

1, 1, 9, 101, 3223, 301597, 98198291, 112780875113, 458970424333059, 6669800460126763729, 349443329644003900650627, 66606536952459989434239085385, 46558117112722258272139140469354603 (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: A174509 A103461 A101563 * A183518 A083452 A081461` `Adjacent sequences: A007130 A007131 A007132 * A007134 A007135 A007136`
	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 16 08:13 EST 2012. Contains 205893 sequences.