|
%I M4659 #9 Mar 30 2012 16:45:08
%S 1,1,9,101,3223,301597,98198291,112780875113,458970424333059,
%T 6669800460126763729,349443329644003900650627,
%U 66606536952459989434239085385,46558117112722258272139140469354603
%N Number of unlabeled rooted connected strength 3 Eulerian graphs with n nodes.
%D R. W. Robinson, personal communication.
%D R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1979.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H R. W. Robinson, <a href="/A007133/b007133.txt">Table of n, a(n) for n = 1..22</a>
%K nonn
%O 1,3
%A _N. J. A. Sloane_.
|
