A214806 Triangle read by rows: T(n,k) = number of rooted maps with n vertices and k faces on a non-orientable surface of type 2 (0 <= k <= n).
0, 0, 488, 0, 11660, 375552, 0, 160680, 6652366, 146387872, 0, 1678880, 86303920, 2298445830, 42795288180, 0, 14771680, 918342738, 28995928200, 629732269188, 10663498973088
Offset: 0
Examples
Triangle begins: 0, 0,488, 0,11660,375552, 0,160680,6652366,146387872, 0,1678880,86303920,2298445830,42795288180, 0,14771680,918342738,28995928200,629732269188,10663498973088, ...
Links
- Didier Arquès and Alain Giorgetti, Counting rooted maps on a surface, Theoret. Comput. Sci. 234 (2000), no. 1-2, 255--272. MR1745078 (2001f:05078).