login
A379432
Triangle read by rows: T(n,k) is the number of unsensed 2-connected (nonseparable) planar maps with n edges and k vertices, n >= 2, 2 <= k <= n.
2
1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 3, 7, 3, 1, 1, 4, 13, 13, 4, 1, 1, 5, 29, 44, 29, 5, 1, 1, 7, 51, 139, 139, 51, 7, 1, 1, 8, 92, 370, 623, 370, 92, 8, 1, 1, 10, 147, 913, 2307, 2307, 913, 147, 10, 1, 1, 12, 240, 2048, 7644, 11673, 7644, 2048, 240, 12, 1, 1, 14, 357, 4295, 22344, 50174, 50174, 22344, 4295, 357, 14, 1
OFFSET
2,8
COMMENTS
The maps considered here may include parallel edges.
The number of faces is n + 2 - k.
FORMULA
T(n,k) = T(n, n+2-k).
EXAMPLE
Triangle begins:
1;
1, 1;
1, 1, 1;
1, 2, 2, 1;
1, 3, 7, 3, 1;
1, 4, 13, 13, 4, 1;
1, 5, 29, 44, 29, 5, 1;
1, 7, 51, 139, 139, 51, 7, 1;
1, 8, 92, 370, 623, 370, 92, 8, 1;
1, 10, 147, 913, 2307, 2307, 913, 147, 10, 1;
...
CROSSREFS
Row sums are A006403.
Cf. A082680 (rooted), A342061 (sensed), A212438 (3-connected), A277741, A342060.
Sequence in context: A371830 A266378 A092113 * A331485 A342061 A045995
KEYWORD
nonn,tabl
AUTHOR
Andrew Howroyd, Jan 14 2025
STATUS
approved