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,3

Links

Table of n, a(n) for n=0..20.

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).

Example

Triangle begins:
  0,
  0,488,
  0,11660,375552,
  0,160680,6652366,146387872,
  0,1678880,86303920,2298445830,42795288180,
  0,14771680,918342738,28995928200,629732269188,10663498973088,
  ...

Crossrefs

Diagonals give A118449, A214804, A214805, A214807. Cf. A214337.

Sequence in context: A235839 A203873 A097766 * A126819 A045011 A253336

Adjacent sequences: A214803 A214804 A214805 * A214807 A214808 A214809

Keyword

nonn,tabl

Author

N. J. A. Sloane, Jul 28 2012

Status

approved