Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006712
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006712 Number of 3-edge-colored labeled trivalent graphs with 2n nodes.
(Formerly M4311)
+0
1
6, 480, 197820, 154103040, 215643443400 (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

Adjacent sequences: A006709 A006710 A006711 this_sequence A006713 A006714 A006715

Sequence in context: A080295 A084108 A006713 this_sequence A099057 A123278 A127605

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 8 20:39 EST 2009. Contains 166234 sequences.


AT&T Labs Research