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!)
A054381 Number of n-node connected planar graphs with minimum degree at least 2. 0
0, 0, 1, 3, 10, 49, 332, 3178, 39267, 578786, 9502259 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

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

Eric Weisstein's World of Mathematics, Planar connected graph.

FORMULA

Inverse Euler transform of A049370. - Falk Hüffner, May 12 2019

CROSSREFS

Cf. A049370.

Sequence in context: A193281 A143921 A082426 * A102088 A297295 A088142

Adjacent sequences:  A054378 A054379 A054380 * A054382 A054383 A054384

KEYWORD

nonn,hard

AUTHOR

Eric W. Weisstein

EXTENSIONS

a(8)-a(11) from formula by Falk Hüffner, May 12 2019

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 July 24 02:31 EDT 2021. Contains 346270 sequences. (Running on oeis4.)