|
| |
|
|
A097999
|
|
Number of 2-connected outerplanar graphs on n labeled nodes.
|
|
2
| |
|
|
1, 9, 132, 2700, 70920, 2275560, 86264640, 3772681920, 186972105600, 10355595465600, 633892275878400, 42495895579737600, 3096545573029708800, 243680880958010496000, 20596410256606119936000
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 3,2
|
|
|
LINKS
| M. Bodirsky and M. Kang, The asymptotic number of outerplanar graphs.
M. Drmota, O. Gimenez, Marc Noy, Vertices of given degree in series-parallel graphs, Random Struct. Algor. 36 (3) (2010), 251-371, Lemma 2.3
S. R. Finch, Planar graph growth constants.
|
|
|
FORMULA
| Recurrence known, see Bodirsky and Kang.
E.g.f.: (-3+2*x-3*x^2)/16+(3-x)*sqrt(1-6*x+x^2)/16+ln((3-x-sqrt(1-6*x+x^2))/2)/2. - Vladeta Jovovic (vladeta(AT)eunet.rs), Jun 26 2007
|
|
|
CROSSREFS
| Sequence in context: A194895 A112123 A167253 * A089547 A110273 A082760
Adjacent sequences: A097996 A097997 A097998 * A098000 A098001 A098002
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| S. R. Finch (Steven.Finch(AT)inria.fr), Sep 08 2004
|
| |
|
|
