OFFSET
3,2
COMMENTS
Maps for a(3) through a(7) are illustrated in Links.
The planar maps considered are without loops or isthmuses.
In other words, a(n) is the number of embeddings in the plane of connected bridgeless planar simple graphs with n vertices in which each internal face is a triangle.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 3..200
Ya-Ping Lu, Illustration of initial terms
FORMULA
PROG
(PARI) A377785seq(30) \\ See PARI link in A378340 for program code.
CROSSREFS
KEYWORD
nonn,new
AUTHOR
Ya-Ping Lu, Nov 06 2024
EXTENSIONS
a(9) onwards from Andrew Howroyd, Nov 24 2024
STATUS
approved