|
|
A342060
|
|
Triangle read by rows: T(n,k) is the number of embeddings on the sphere of 2-connected planar graphs with n nodes and k faces, n >= 3, k=2..2*n-4.
|
|
3
|
|
|
1, 1, 1, 1, 1, 2, 4, 2, 1, 1, 3, 13, 21, 16, 5, 2, 1, 4, 29, 94, 183, 154, 76, 18, 5, 1, 6, 59, 328, 1146, 2114, 2144, 1246, 447, 88, 14, 1, 7, 104, 915, 5046, 16009, 30183, 33719, 23749, 10585, 3017, 489, 50, 1, 9, 181, 2239, 17876, 85550, 254831, 478913, 581324, 468388, 255156, 93028, 22077, 3071, 233
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
3,6
|
|
COMMENTS
|
Equivalently, T(n,k) is the number of unsensed 2-connected planar maps with n vertices and k faces.
The number of edges is n+k-2.
Terms of this sequence can be computed using the tool "plantri". The expanded reference gives rows 3..15 of this table.
|
|
LINKS
|
|
|
FORMULA
|
T(n,2) = 1.
|
|
EXAMPLE
|
Triangle begins:
1;
1, 1, 1;
1, 2, 4, 2, 1;
1, 3, 13, 21, 16, 5, 2;
1, 4, 29, 94, 183, 154, 76, 18, 5;
1, 6, 59, 328, 1146, 2114, 2144, 1246, 447, 88, 14;
...
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|