|
Search: id:A005964
|
|
|
| A005964 |
|
Number of trivalent connected planar graphs with 2n nodes.
(Formerly M2816)
|
|
+0
5
|
|
| 0, 1, 1, 3, 9, 32, 133, 681, 3893, 24809, 169206, 1214462, 9034509
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
The g.f. z*(-1+2*z)/(-1+3*z) conjectured by S. Plouffe in his 1992 dissertation is wrong.
|
|
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.
|
|
LINKS
|
B. D. McKay, Plantri
M. Meringer, Tables of Regular Graphs
S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures}, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
|
|
CROSSREFS
|
Cf. A058378, A000109.
Sequence in context: A063020 A104184 A039628 this_sequence A129416 A009356 A058138
Adjacent sequences: A005961 A005962 A005963 this_sequence A005965 A005966 A005967
|
|
KEYWORD
|
nonn,nice,hard
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
Extended by Brendan McKay (bdm(AT)cs.anu.edu.au) and Gunnar Brinkmann (Gunnar.Brinkmann(AT)ugent.be) using their program "plantri", Dec 19, 2000
|
|
|
Search completed in 0.002 seconds
|
