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