login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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). 5

%I

%S 0,0,488,0,11660,375552,0,160680,6652366,146387872,0,1678880,86303920,

%T 2298445830,42795288180,0,14771680,918342738,28995928200,629732269188,

%U 10663498973088

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

%D Arques, Didier; and Giorgetti, Alain. Counting rooted maps on a surface. Theoret. Comput. Sci. 234 (2000), no. 1-2, 255--272. MR1745078 (2001f:05078).

%e Triangle begins:

%e 0,

%e 0,488,

%e 0,11660,375552,

%e 0,160680,6652366,146387872,

%e 0,1678880,86303920,2298445830,42795288180,

%e 0,14771680,918342738,28995928200,629732269188,10663498973088,

%e ...

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

%K nonn,tabl

%O 0,3

%A _N. J. A. Sloane_, Jul 28 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 21 02:02 EST 2020. Contains 332086 sequences. (Running on oeis4.)