

A005964


Number of trivalent connected (or cubic) planar graphs with 2n nodes.
(Formerly M2816)


6



0, 1, 1, 3, 9, 32, 133, 681, 3893, 24809, 169206, 1214462, 9034509
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,4


REFERENCES

A. T. Balaban, Enumeration of Cyclic Graphs, pp. 63105 of A. T. Balaban, ed., Chemical Applications of Graph Theory, Ac. Press, 1976; see p. 92.
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=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]
F. C. Bussemaker, S. Cobeljic, L. M. Cvetkovic and J. J. Seidel, Computer investigations of cubic graphs, T.H.Report 76WSK01, Technological University Eindhoven, Dept. Mathematics, 1976
M. Meringer, Tables of Regular Graphs


CROSSREFS

Cf. A058378, A000109, A002851, A204186.
Sequence in context: A183425 A039628 A194530 * A246138 A129416 A210689
Adjacent sequences: A005961 A005962 A005963 * A005965 A005966 A005967


KEYWORD

nonn,nice,hard


AUTHOR

N. J. A. Sloane


EXTENSIONS

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


STATUS

approved



