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!)
A006797 A subclass of 2n-node trivalent planar graphs without triangles.
(Formerly M0899)
0
1, 1, 0, 1, 2, 3, 9, 28, 97, 378, 1601, 7116 (list; graph; refs; listen; history; text; internal format)
OFFSET

4,5

COMMENTS

Number of cubic 3-connected planar non-hamiltonian triangle-free graphs with no essential 4-cuts or 3-cuts. - R. J. Mathar, Feb 08 2012

REFERENCES

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

LINKS

Table of n, a(n) for n=4..15.

D. A. Holton and B. D. McKay, The smallest non-hamiltonian 3-connected cubic planar graphs have 38 vertices, J. Combinat. Theory B vol 45, iss. 3 (1988) 305-319.

D. A. Holton and B. D. McKay, Erratum, J. Combinat. Theory B vol 47, iss. 2 (1989) 248.

CROSSREFS

Sequence in context: A015960 A099079 A339831 * A144239 A320951 A139006

Adjacent sequences:  A006794 A006795 A006796 * A006798 A006799 A006800

KEYWORD

nonn,more

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 14 05:21 EDT 2021. Contains 342943 sequences. (Running on oeis4.)