Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A004109
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A004109 Number of connected trivalent (or cubic) labeled graphs with 2n nodes.
(Formerly M5345)
+0
1
0, 1, 70, 19320, 11166120, 11543439600, 19491385914000, 50233275604512000, 187663723374359232000, 975937986889287117696000, 6838461558851342749449120000, 62856853767402275979616458240000 (list; graph; listen)
OFFSET

1,3

REFERENCES

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

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

LINKS

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

CROSSREFS

Sequence in context: A007100 A103157 A007099 this_sequence A002829 A005983 A014608

Adjacent sequences: A004106 A004107 A004108 this_sequence A004110 A004111 A004112

KEYWORD

nonn,nice

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 August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research