The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A006713 Number of 3-edge-colored connected trivalent graphs with 2n labeled nodes. (Formerly M4310) 5

%I M4310

%S 6,480,196560,149869440,208166112000,470619551001600,

%T 1622357050938624000,8100931274981056512000,

%U 56279222605087617687552000,526611567858781597240688640000,6462027944190599588931310387200000,101691538301880025620001692844032000000

%N Number of 3-edge-colored connected trivalent graphs with 2n labeled nodes.

%D R. C. Read, Some Enumeration Problems in Graph Theory. Ph.D. Dissertation, Department of Mathematics, Univ. London, 1958.

%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

%H Andrew Howroyd, <a href="/A006713/b006713.txt">Table of n, a(n) for n = 2..50</a>

%H R. C. Read, <a href="/A002831/a002831.pdf">Letter to N. J. A. Sloane, Feb 04 1971</a> (gives initial terms of this sequence)

%Y Cf. A006712 (for not necessarily connected graphs), A248362 (for the incorrect values). See also A002830, A002831, A002851.

%K nonn

%O 2,1

%A _N. J. A. Sloane_

%E a(5)-a(6) corrected and a(7)-a(10) from _Sean A. Irvine_, Oct 05 2014

%E Terms a(11) and beyond from _Andrew Howroyd_, Dec 18 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 4 21:30 EST 2020. Contains 338939 sequences. (Running on oeis4.)