login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


Number of n-node connected planar graphs with minimum degree at least 2.
0

%I #24 May 02 2023 14:41:14

%S 0,0,1,3,10,49,332,3178,39267,578786,9502259

%N Number of n-node connected planar graphs with minimum degree at least 2.

%H Simon Caron-Huot, Frank Coronado, and Beatrix Mühlmann, <a href="https://arxiv.org/abs/2304.12341">Determinants in self-dual N=4 SYM and twistor space</a>, arXiv:2304.12341 [hep-th], 2023. See p. 23.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PlanarConnectedGraph.html">Planar connected graph</a>.

%F Inverse Euler transform of A049370. - _Falk Hüffner_, May 12 2019

%Y Cf. A002218, A010355, A049370.

%K nonn,more,hard

%O 1,4

%A _Eric W. Weisstein_

%E a(8)-a(11) from formula by _Falk Hüffner_, May 12 2019

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 24 10:20 EDT 2024. Contains 376196 sequences. (Running on oeis4.)