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”).

A342056
Number of unrooted 3-connected triangulations of a disk with n nodes.
4
1, 2, 7, 27, 132, 773, 5017, 34861, 253676, 1903584, 14616442, 114254053, 906266345, 7277665889, 59066524810, 483864411124, 3996427278475, 33250623548406, 278472800696431, 2346089674759665, 19872284655990058, 169155659546689252, 1446375853153588731, 12418636483734071261, 107034910337046043232
OFFSET
4,2
LINKS
G. Brinkmann and B. D. McKay, Fast generation of planar graphs (expanded edition), Table 27, Column d_1.
The House of Graphs, Planar graphs
PROG
(PARI) A342053AntidiagonalSums(25) \\ See links in A342053 for program.
CROSSREFS
Antidiagonal sums of A342053.
Cf. A342052.
Sequence in context: A213226 A058800 A357901 * A363199 A367594 A293031
KEYWORD
nonn
AUTHOR
Andrew Howroyd, Feb 26 2021
STATUS
approved