|
%I M2045 #8 Mar 30 2012 16:45:08
%S 0,2,12,176,6416,745920,293075904,394099077120,1835009281314048,
%T 30009926711011488256,1747146367164504269618176,
%U 366331755173237226238282129408,279347803170668467265962662338908160
%N Number of unlabeled strength 3 Eulerian graphs with n nodes, 2 of odd degree.
%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="/A007129/b007129.txt">Table of n, a(n) for n = 1..22</a>
%K nonn
%O 1,2
%A _N. J. A. Sloane_.
|
