Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097999
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A097999 Number of 2-connected outerplanar graphs on n labeled nodes. +0
3
1, 9, 132, 2700, 70920, 2275560, 86264640, 3772681920, 186972105600, 10355595465600, 633892275878400, 42495895579737600, 3096545573029708800, 243680880958010496000, 20596410256606119936000 (list; graph; listen)
OFFSET

3,2

LINKS

M. Bodirsky and M. Kang, The asymptotic number of outerplanar graphs.

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: A060944 A112123 A167253 this_sequence A089547 A110273 A082760

Adjacent sequences: A097996 A097997 A097998 this_sequence A098000 A098001 A098002

KEYWORD

nonn

AUTHOR

S. R. Finch (Steven.Finch(AT)inria.fr), Sep 08 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research