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!)
A123485 Number of n-node labeled trivalent (or cubic) graphs with connectivity 2. 1
0, 0, 0, 2520, 1814400, 1888563600, 2979953776800, 6935468956416000, 23019567930463104000, 105689740661883810432000, 653795414851090462030080000, 5326203537908913517889391360000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

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: A109480 A066599 A107531 * A282433 A228080 A172553

Adjacent sequences:  A123482 A123483 A123484 * A123486 A123487 A123488

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 April 14 05:17 EDT 2021. Contains 342942 sequences. (Running on oeis4.)