

A006713


Number of 3edgecolored connected trivalent graphs with 2n labeled nodes.
(Formerly M4310)


5



6, 480, 196560, 149869440, 208166112000, 470619551001600, 1622357050938624000, 8100931274981056512000, 56279222605087617687552000, 526611567858781597240688640000, 6462027944190599588931310387200000, 101691538301880025620001692844032000000
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

2,1


REFERENCES

R. C. Read, Some Enumeration Problems in Graph Theory. Ph.D. Dissertation, Department of Mathematics, Univ. London, 1958.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).


LINKS



CROSSREFS



KEYWORD

nonn


AUTHOR



EXTENSIONS



STATUS

approved



