%I A006713 M4310
%S A006713 6,480,196560,153498240,214951968000
%N A006713 Number of 3-edge-colored connected trivalent graphs with 2n nodes.
%D A006713 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A006713 R. C. Read, Some Enumeration Problems in Graph Theory. Ph.D. Dissertation, 
               Department of Mathematics, Univ. London, 1958.
%Y A006713 Sequence in context: A112945 A080295 A084108 this_sequence A006712 A099057 
               A123278
%Y A006713 Adjacent sequences: A006710 A006711 A006712 this_sequence A006714 A006715 
               A006716
%K A006713 nonn
%O A006713 2,1
%A A006713 N. J. A. Sloane (njas(AT)research.att.com).