cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A054381 #25 Feb 16 2025 08:32:42
%S A054381 0,0,1,3,10,49,332,3178,39267,578786,9502259
%N A054381 Number of n-node connected planar graphs with minimum degree at least 2.
%H A054381 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 A054381 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PlanarConnectedGraph.html">Planar connected graph</a>.
%F A054381 Inverse Euler transform of A049370. - _Falk Hüffner_, May 12 2019
%Y A054381 Cf. A002218, A010355, A049370.
%K A054381 nonn,more,hard
%O A054381 1,4
%A A054381 _Eric W. Weisstein_
%E A054381 a(8)-a(11) from formula by _Falk Hüffner_, May 12 2019