A378076
Number of embeddings on the sphere of 2-connected homeomorphically irreducible planar graphs with n edges.
Original entry on oeis.org
1, 0, 1, 2, 3, 6, 16, 37, 100, 293, 888, 2822, 9305, 31274, 106972, 370828, 1298058, 4582413, 16289759, 58259600, 209465186
Offset: 6
A378077
Triangle read by rows: T(n,k) is the number of embeddings on the sphere of planar graphs with n vertices and k faces having connectivity exactly 2 and minimum vertex degree at least 3, k=6..2n-5.
Original entry on oeis.org
1, 1, 1, 3, 7, 2, 1, 8, 35, 60, 47, 12, 0, 5, 72, 307, 647, 652, 325, 59, 0, 3, 86, 776, 3395, 7647, 9582, 6654, 2442, 368, 0, 0, 45, 1041, 9091, 38876, 94278, 136628, 121204, 64232, 18916, 2363, 0, 0, 18, 827, 14407, 111076, 468211, 1192511, 1937266, 2049784, 1409199, 607746, 150161, 16253
Offset: 6
Triangle begins:
n\k| 6 7 8 9 10 11 12 13 14 15 16 17
-----+------------------------------------------------------------------------
6 | 1, 1;
7 | 1, 3, 7, 2;
8 | 1, 8, 35, 60, 47, 12;
9 | 0, 5, 72, 307, 647, 652, 325, 59;
10 | 0, 3, 86, 776, 3395, 7647, 9582, 6654, 2442, 368;
11 | 0, 0, 45, 1041, 9091, 38876, 94278, 136628, 121204, 64232, 18916, 2363;
...
A378074
Number of embeddings on the sphere of 2-connected homeomorphically irreducible planar graphs with n nodes.
Original entry on oeis.org
0, 0, 0, 1, 2, 9, 47, 420, 4673, 63253, 927238, 14342093, 229607392, 3776227106, 63482545872, 1087322656758, 18927037827561
Offset: 1
Showing 1-3 of 3 results.
Comments