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 #15 Jun 03 2023 09:29:40
%S 1,2,7,27,132,773,5017,34861,253676,1903584,14616442,114254053,
%T 906266345,7277665889,59066524810,483864411124,3996427278475,
%U 33250623548406,278472800696431,2346089674759665,19872284655990058,169155659546689252,1446375853153588731,12418636483734071261,107034910337046043232
%N Number of unrooted 3-connected triangulations of a disk with n nodes.
%H Andrew Howroyd, <a href="/A342056/b342056.txt">Table of n, a(n) for n = 4..100</a>
%H G. Brinkmann and B. D. McKay, <a href="https://users.cecs.anu.edu.au/~bdm/papers/plantri-full.pdf">Fast generation of planar graphs (expanded edition)</a>, Table 27, Column d_1.
%H The House of Graphs, <a href="https://houseofgraphs.org/meta-directory/planar">Planar graphs</a>
%o (PARI) A342053AntidiagonalSums(25) \\ See links in A342053 for program.
%Y Antidiagonal sums of A342053.
%Y Cf. A342052.
%K nonn
%O 4,2
%A _Andrew Howroyd_, Feb 26 2021