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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A204199 Number of (strictly) 2-connected cubic graphs on 2n nodes. 1
0, 0, 0, 1, 4, 24, 139 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

COMMENTS

The number of (strictly) 1-connected cubic graphs on 2n nodes begins 0, 0, 0, 0, 1, 4, 29. If we had more terms this would warrant its own entry.

LINKS

Table of n, a(n) for n=1..7.

F. C. Bussemaker, S. Cobeljic, L. M. Cvetkovic and J. J. Seidel, Computer investigations of cubic graphs, T.H.-Report 76-WSK-01, Technological University Eindhoven, Dept. Mathematics, 1976.

CROSSREFS

Cf. A002851, A204198.

Sequence in context: A153337 A122690 A183512 * A262376 A005319 A155119

Adjacent sequences:  A204196 A204197 A204198 * A204200 A204201 A204202

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane, Jan 12 2012

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 October 21 16:20 EDT 2019. Contains 328302 sequences. (Running on oeis4.)