%I A006903 M4763
%S A006903 0,0,0,10,3360,1829520,2010023400,3622767548400,9820308795897600,
%T A006903 38117776055769009600,204209112522362230483200
%N A006903 Number of triangle-free trivalent (or cubic) graphs with 2n labeled nodes.
%D A006903 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A006903 N. C. Wormald, The number of labeled cubic graphs with no triangles, 
               Congress. Numerantium, 33 (1981), 359-378.
%D A006903 Confirmed by Gordon Royle (gordon(AT)maths.uwa.edu.au), May 31, 2000.
%Y A006903 Sequence in context: A001329 A007101 A007103 this_sequence A115481 A154238 
               A024139
%Y A006903 Adjacent sequences: A006900 A006901 A006902 this_sequence A006904 A006905 
               A006906
%K A006903 nonn,nice
%O A006903 0,4
%A A006903 Simon Plouffe, N. J. A. Sloane (njas(AT)research.att.com).