|
%I M1990 #11 Dec 19 2021 00:11:25
%S 0,2,10,162,6218,739198,292320730,393805101318,1834614855993394,
%T 30008091277676005830,1747116355298560745383906,
%U 366330007995516101568779931526,279347436837102450848968821962591698
%N Number of unlabeled 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="/A007131/b007131.txt">Table of n, a(n) for n = 1..22</a>
%K nonn,nice
%O 1,2
%A _N. J. A. Sloane_
|
