OFFSET
3,8
COMMENTS
See A378103 for illustration of initial terms. This sequence does not consider planar maps to be equivalent to their reflections.
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 and k triangular internal faces up to orientation preserving isomorphisms.
The number of edges is n + k - 1.
LINKS
Andrew Howroyd, Table of n, a(n) for n = 3..2306 (rows 3..50)
FORMULA
EXAMPLE
Triangle begins:
n\k | 1 2 3 4 5 6 7 8 9 10 11 12 13
----+----------------------------------------------------------
3 | 1;
4 | 0, 1, 1;
5 | 0, 1, 1, 2, 1;
6 | 0, 0, 2, 5, 5, 6, 5;
7 | 0, 0, 2, 8, 13, 20, 21, 26, 24;
8 | 0, 0, 0, 10, 28, 55, 79, 104, 119, 147, 133;
9 | 0, 0, 0, 7, 45, 126, 230, 360, 491, 625, 735, 892, 846;
...
PROG
(PARI) my(A=A378336rows(10)); for(i=1, #A, print(A[i])) \\ See PARI link in A378340 for program code.
KEYWORD
nonn,tabf,new
AUTHOR
Andrew Howroyd, Nov 23 2024
STATUS
approved