Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006607
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006607 Number of labeled connected rooted trivalent graphs with 2n nodes.
(Formerly M3711)
+0
1
0, 4, 120, 33600, 18446400, 18361728000, 30199104936000, 76326119565696000, 280889824362219072000, 1443428429045578335360000, 10016498030869925136622080000, 91330153089556497015273454080000 (list; graph; listen)
OFFSET

1,2

REFERENCES

N. C. Wormald, Triangles in labeled cubic graphs, pp. 337-345 of Combinatorial Mathematics (Canberra, 1977), Lect. Notes Math. 686, 1978.

R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1977.

LINKS

R. W. Robinson, Table of n, a(n) for n = 1..29

CROSSREFS

Sequence in context: A068204 A001332 A071304 this_sequence A062081 A053881 A075114

Adjacent sequences: A006604 A006605 A006606 this_sequence A006608 A006609 A006610

KEYWORD

nonn

AUTHOR

njas

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 July 19 08:04 EDT 2008. Contains 142098 sequences.


AT&T Labs Research