|
%I M2865 #9 Mar 30 2012 16:45:08
%S 0,1,1,3,10,44,274,2518,39159,1087472,56214536,5422178367,
%T 973901229150,325367339922914,202427527012666564,
%U 235111320292288931449,511328244516581761886211,2088977518516761768744519266
%N Number of connected strength-1 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="/A007125/b007125.txt">Table of n, a(n) for n = 1..26</a>
%K nonn
%O 1,4
%A _N. J. A. Sloane_.
|
