|
| |
|
|
A096332
|
|
Number of connected planar graphs on n labeled nodes.
|
|
0
| |
|
|
1, 1, 4, 38, 727, 26013, 1597690, 149248656, 18919743219, 3005354096360, 569226803220234, 124594074249852576, 30861014504270954737, 8520443838646833231236, 2592150684565935977152860
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
REFERENCES
| M. Bodirsky, C. Groepl and M. Kang: Generating Labeled Planar Graphs Uniformly At Random; ICALP03 Eindhoven, LNCS 2719, Springer Verlag (2003), 1095 - 1107.
|
|
|
LINKS
| Bodirsky et al., Generating Labeled Planar Graphs Uniformly at Random
O. Gimenez and M. Noy, Asymptotic enumeration and limit laws of planar graphs
|
|
|
FORMULA
| This is generated by log(1+g(x)), where g(x) is the e.g.f. for labeled planar graphs, which may be computed from recurrences in Bodirsky et al. - Keith Briggs (keith.briggs(AT)bt.com), Feb 04 2005
|
|
|
EXAMPLE
| There are 4 connected labeled planar graphs on 3 nodes:
1-2-3,
1-3-2,
2-1-3 and
1-2
|/
3
|
|
|
CROSSREFS
| Cf. A066537.
Sequence in context: A201861 A171779 A171203 * A084284 A084285 A084286
Adjacent sequences: A096329 A096330 A096331 * A096333 A096334 A096335
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| S. R. Finch (Steven.Finch(AT)inria.fr), Aug 02 2004
|
|
|
EXTENSIONS
| More terms from Keith Briggs (keith.briggs(AT)bt.com), Feb 04 2005
|
| |
|
|
