login
The OEIS is supported by the many generous donors to the OEIS 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
0, 0, 488, 0, 11660, 375552, 0, 160680, 6652366, 146387872, 0, 1678880, 86303920, 2298445830, 42795288180, 0, 14771680, 918342738, 28995928200, 629732269188, 10663498973088 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,3
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).
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
KEYWORD
nonn,tabl
AUTHOR
N. J. A. Sloane, Jul 28 2012
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 22 22:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)