login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007101 Number of labeled trivalent (or cubic) cyclically 4-connected graphs with 2n nodes.
(Formerly M4761)
2
1, 10, 3360, 1753920, 1812888000, 3158396841600, 8496995611104000, 33199738565849856000, 180116271096528678912000, 1310903590075375049994240000, 12454930569778045924343408640000 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,2

REFERENCES

R. W. Robinson, personal communication.

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

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

R. W. Robinson, Table of n, a(n) for n = 2..30

N. C. Wormald, Enumeration of cyclically 4-connected cubic graphs, J. Number Theory 9 (4) (1985) 563, Theorem 4.1.

CROSSREFS

Sequence in context: A243008 A133198 A001329 * A007103 A006903 A115481

Adjacent sequences:  A007098 A007099 A007100 * A007102 A007103 A007104

KEYWORD

nonn

AUTHOR

N. J. A. Sloane.

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified March 28 19:06 EDT 2017. Contains 284246 sequences.