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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A058378 Number of trivalent 2-connected planar graphs with 2n nodes. 2
0, 1, 1, 3, 8, 29, 114, 583, 3310, 21168, 144622, 1039495, 7731540 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

REFERENCES

A. T. Balaban, Enumeration of Cyclic Graphs, pp. 63-105 of A. T. Balaban, ed., Chemical Applications of Graph Theory, Ac. Press, 1976; see p. 92.

Computed by Brendan McKay and Gunnar Brinkmann (Gunnar.Brinkmann(AT)ugent.be) using their program "plantri", Dec 19 2000.

LINKS

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

Gunnar Brinkmann and Brendan McKay, plantri and fullgen programs for generation of certain types of planar graph.

Gunnar Brinkmann and Brendan McKay, plantri and fullgen programs for generation of certain types of planar graph [Cached copy, pdf file only, no active links, with permission]

Gunnar Brinkmann and Brendan McKay, Guide to using plantri [Cached copy, with permission]

M. Meringer, Tables of Regular Graphs

CROSSREFS

Cf. A005964, A000109.

Sequence in context: A148876 A245889 A013309 * A063839 A192744 A130470

Adjacent sequences:  A058375 A058376 A058377 * A058379 A058380 A058381

KEYWORD

nonn,nice,more,hard

AUTHOR

N. J. A. Sloane, Dec 19 2000

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 October 16 18:08 EDT 2018. Contains 316271 sequences. (Running on oeis4.)