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

%I

%S 0,0,1,1,3,9,44,294,2893,36496,545808,9029737,159563559,2952794985,

%T 56589742050

%N Number of two-connected (or biconnected) planar graphs with n nodes.

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

%D 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]

%Y Cf. A005142, A049336.

%K nonn

%O 1,5

%A _Brendan McKay_

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

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 February 17 15:32 EST 2020. Contains 331998 sequences. (Running on oeis4.)