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”).
%I #8 May 15 2024 09:08:32
%S 1,1,1,1,2,6,24,80,240,1080,3780,13440
%N Maximum numbers of planar embeddings for connected planar graphs on n vertices.
%C Computed by Stan Wagon up to n=7 and Brendan McKay up to n=12.
%H Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/UniquelyEmbeddableGraph.html">Uniquely Embeddable Graph</a>.
%Y Cf. A372853 (uniquely embeddable planar connected graphs).
%K nonn,more
%O 1,5
%A _Eric W. Weisstein_, May 15 2024