|
%I M3711 #12 May 13 2017 23:24:26
%S 0,4,120,33600,18446400,18361728000,30199104936000,76326119565696000,
%T 280889824362219072000,1443428429045578335360000,
%U 10016498030869925136622080000,91330153089556497015273454080000
%N Number of labeled connected rooted trivalent graphs with 2n nodes.
%D R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1977.
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%D N. C. Wormald, Triangles in labeled cubic graphs, pp. 337-345 of Combinatorial Mathematics (Canberra, 1977), Lect. Notes Math. 686, 1978.
%H R. W. Robinson, <a href="/A006607/b006607.txt">Table of n, a(n) for n = 1..29</a>
%Y Cf. A002829, A286757 (corrected version?)
%K nonn
%O 1,2
%A _N. J. A. Sloane_.
|
