|
| |
|
|
A096330
|
|
Number of 3-connected planar graphs on n labeled nodes.
|
|
0
| | |
|
|
|
OFFSET
| 4,2
|
|
|
COMMENTS
| Recurrence known, see Bodirsky et al.
|
|
|
REFERENCES
| M. Bodirsky, C. Groepl and M. Kang: Generating Labeled Planar Graphs Uniformly At Random; ICALP03 Eindhoven, LNCS 2719, Springer Verlag (2003), 1095 - 1107.
|
|
|
CROSSREFS
| Cf. A066537.
Sequence in context: A014769 A012851 A181719 * A174751 A042203 A042200
Adjacent sequences: A096327 A096328 A096329 * A096331 A096332 A096333
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| S. R. Finch (Steven.Finch(AT)inria.fr), Aug 02 2004
|
| |
|
|
