Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006713
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006713 Number of 3-edge-colored connected trivalent graphs with 2n nodes.
(Formerly M4310)
+0
1
6, 480, 196560, 153498240, 214951968000 (list; graph; listen)
OFFSET

2,1

REFERENCES

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

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

CROSSREFS

Sequence in context: A112945 A080295 A084108 this_sequence A006712 A099057 A123278

Adjacent sequences: A006710 A006711 A006712 this_sequence A006714 A006715 A006716

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research