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

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: A103461 A101563 A269732 * A183518 A339643 A083452

Adjacent sequences: A007130 A007131 A007132 * A007134 A007135 A007136

Keyword

nonn

Author

N. J. A. Sloane.

Status

approved