login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A021103 Number of two-connected (or biconnected) planar graphs with n nodes. 7
0, 0, 1, 1, 3, 9, 44, 294, 2893, 36496, 545808, 9029737, 159563559, 2952794985, 56589742050 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

REFERENCES

R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.

A. Gagarin, G. Labelle, P. Leroux and T. Walsh, Structure and enumeration of two-connected graphs with prescribed three-connected components  Adv. in Appl. Math. 43 (2009), no. 1, 46-74. [From Gilbert Labelle (labelle.gilbert(AT)uqam.ca), Jan 20 2009]

LINKS

Table of n, a(n) for n=1..15.

CROSSREFS

Cf. A005142, A049336.

Sequence in context: A262128 A028858 A058106 * A222662 A209977 A001902

Adjacent sequences:  A021100 A021101 A021102 * A021104 A021105 A021106

KEYWORD

nonn

AUTHOR

Brendan McKay

EXTENSIONS

3 more terms from Gilbert Labelle (labelle.gilbert(AT)uqam.ca), Jan 20 2009

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 26 01:48 EST 2020. Contains 331270 sequences. (Running on oeis4.)