%I A007133 M4659
%S A007133 1,1,9,101,3223,301597,98198291,112780875113,458970424333059,
%T A007133 6669800460126763729,349443329644003900650627,
%U A007133 66606536952459989434239085385,46558117112722258272139140469354603
%N A007133 Number of unlabeled rooted connected strength 3 Eulerian graphs with 
               n nodes.
%D A007133 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A007133 R. W. Robinson, personal communication.
%D A007133 R. W. Robinson, Numerical implementation of graph counting algorithms, 
               AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1979.
%H A007133 R. W. Robinson, <a href="b007133.txt">Table of n, a(n) for n = 1..22</
               a>
%Y A007133 Sequence in context: A060150 A103461 A101563 this_sequence A083452 A081461 
               A110698
%Y A007133 Adjacent sequences: A007130 A007131 A007132 this_sequence A007134 A007135 
               A007136
%K A007133 nonn
%O A007133 1,3
%A A007133 N. J. A. Sloane (njas(AT)research.att.com).