# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a006713 Showing 1-1 of 1 %I A006713 M4310 #19 Dec 18 2017 22:45:05 %S A006713 6,480,196560,149869440,208166112000,470619551001600, %T A006713 1622357050938624000,8100931274981056512000, %U A006713 56279222605087617687552000,526611567858781597240688640000,6462027944190599588931310387200000,101691538301880025620001692844032000000 %N A006713 Number of 3-edge-colored connected trivalent graphs with 2n labeled nodes. %D A006713 R. C. Read, Some Enumeration Problems in Graph Theory. Ph.D. Dissertation, Department of Mathematics, Univ. London, 1958. %D A006713 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A006713 Andrew Howroyd, Table of n, a(n) for n = 2..50 %H A006713 R. C. Read, Letter to N. J. A. Sloane, Feb 04 1971 (gives initial terms of this sequence) %Y A006713 Cf. A006712 (for not necessarily connected graphs), A248362 (for the incorrect values). See also A002830, A002831, A002851. %K A006713 nonn %O A006713 2,1 %A A006713 _N. J. A. Sloane_ %E A006713 a(5)-a(6) corrected and a(7)-a(10) from _Sean A. Irvine_, Oct 05 2014 %E A006713 Terms a(11) and beyond from _Andrew Howroyd_, Dec 18 2017 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE