cp's OEIS Frontend

A058833 Number of labeled n-node 4-valent graphs containing 3 double edges, a distinguished unordered pair of which are adjacent.

%I A058833 #9 Sep 04 2017 19:25:26
%S A058833 0,0,0,3,0,30,360,6930,196728,8115660,433362960,28552545945,
%T A058833 2276033387760,216132739612218,24118774853584320,3125242929676107240,
%U A058833 465357404934002231280,78908446775174591638440
%N A058833 Number of labeled n-node 4-valent graphs containing 3 double edges, a distinguished unordered pair of which are adjacent.
%D A058833 R. C. Read and N. C. Wormald, Number of labeled 4-regular graphs, J. Graph Theory, 4 (1980), 203-212.
%F A058833 Read and Wormald give recurrence relations involving all sequences A005815 and A058830-A058837 (see the Maple program). - _Emeric Deutsch_, Jan 26 2005
%p A058833 a[0]:=1: b[0]:=0: c[0]:=0: d[0]:=0: e[0]:=0: f[0]:=0: g[0]:=0: h[0]:=0: i[0]:=0: for p from 1 to 20 do a[p]:=((p-1)*(2*p-9)*a[p-1]+(2*p-8)*b[p-1]+c[p-1])/3: b[p]:=(6*p*(p-1)*a[p-1]+4*p*b[p-1]+p*d[p-1])/2: c[p]:=(6*p*(p-3)*b[p-1]+8*p*c[p-1]+4*p*d[p-1]+p*e[p-1])/4: d[p]:=p*b[p-1]+p*f[p-1]:e[p]:=(4*p*c[p-1]+4*p*d[p-1]+2*p*g[p-1]+p*(p-1)*(p-2)*a[p-3])/2:f[p]:=p*(p-1)*((4*p-8)*a[p-2]+2*b[p-2]+h[p-2])/2: g[p]:=p*(p-1)*(4*(p-3)*b[p-2]+4*c[p-2]+4*d[p-2]+2*f[p-2]+i[p-2])/2:h[p]:=p*((2*p-2)*a[p-1]+b[p-1]): i[p]:=p*((2*p-4)*b[p-1]+2*c[p-1]+2*d[p-1]+f[p-1]+h[p-1]): od: seq(e[n],n=0..20); # A058833(n)=e[n] - _Emeric Deutsch_, Jan 26 2005
%Y A058833 Cf. A005815, A058830, A058831, A058832, A058834, A058835, A058836, A058837.
%K A058833 nonn,easy
%O A058833 0,4
%A A058833 _N. J. A. Sloane_, Jan 05 2001
%E A058833 More terms from _Emeric Deutsch_, Jan 26 2005