login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A129060 Number of n-node triangulations of the nonorientable surface N_5 in which every node has degree >= 6. 0

%I

%S 0,2,5839,1117750,41548569

%N Number of n-node triangulations of the nonorientable surface N_5 in which every node has degree >= 6.

%H G. Ringel, <a href="https://doi.org/10.1007/BF01343898">Wie man die geschlossenen nichtorientierbaren Flächen in möglichst wenig Dreiecke zerlegen kann</a>, Math. Ann. 130 (1955), 317-326.

%H Thom Sulanke, <a href="http://hep.physics.indiana.edu/~tsulanke/graphs/surftri/">Generating triangulations of surfaces (surftri)</a>, (also subpages).

%K nonn,more

%O 8,2

%A _N. J. A. Sloane_, May 13 2007

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 October 17 01:03 EDT 2019. Contains 328103 sequences. (Running on oeis4.)