login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
1,4
LINKS
Simon Caron-Huot, Frank Coronado, and Beatrix Mühlmann, Determinants in self-dual N=4 SYM and twistor space, arXiv:2304.12341 [hep-th], 2023. See p. 23.
Eric Weisstein's World of Mathematics, Planar connected graph.
FORMULA
Inverse Euler transform of A049370. - Falk Hüffner, May 12 2019
CROSSREFS
KEYWORD
nonn,more,hard
EXTENSIONS
a(8)-a(11) from formula by Falk Hüffner, May 12 2019
STATUS
approved