|
Search: id:A058378
|
|
|
| A058378 |
|
Number of trivalent 2-connected planar graphs with 2n nodes. |
|
+0
3
|
|
| 0, 1, 1, 3, 8, 29, 114, 583, 3310, 21168, 144622, 1039495, 7731540
(list; graph; listen)
|
|
|
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 (bdm(AT)cs.anu.edu.au) and Gunnar Brinkmann (Gunnar.Brinkmann(AT)ugent.be) using their program "plantri", Dec 19, 2000
|
|
LINKS
|
B. D. McKay, Plantri
M. Meringer, Tables of Regular Graphs
|
|
CROSSREFS
|
Cf. A005964, A000109.
Sequence in context: A148875 A148876 A013309 this_sequence A063839 A130470 A162054
Adjacent sequences: A058375 A058376 A058377 this_sequence A058379 A058380 A058381
|
|
KEYWORD
|
nonn,nice,hard
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Dec 19 2000
|
|
|
Search completed in 0.003 seconds
|
