login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A122511 Number of n-node labeled trivalent (or cubic) graphs with connectivity 1. 1
0, 0, 0, 0, 113400, 134719200, 206367361200, 441231126336000, 1314804135572928000, 5371366122198236160000, 29519910833205467394720000, 214250468144929272764547840000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

REFERENCES

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..30

CROSSREFS

Sequence in context: A252036 A103113 A179922 * A172549 A172589 A172692

Adjacent sequences:  A122508 A122509 A122510 * A122512 A122513 A122514

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Nov 13 2006

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 19 10:39 EDT 2021. Contains 345126 sequences. (Running on oeis4.)