login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


Number of n-node triangulations of the triple torus S_3 in which every node has degree >= 6.
0

%I #9 Mar 16 2023 22:31:39

%S 0,20,50214,8677769

%N Number of n-node triangulations of the triple torus S_3 in which every node has degree >= 6.

%H M. Jungerman and G. Ringel, <a href="https://doi.org/10.1007/BF02414187">Minimal triangulations on orientable surfaces</a>, Acta Math. 145 (1980), 121-154.

%H Thom Sulanke, <a href="https://tsulanke.pages.iu.edu/graphs/surftri/">Generating triangulations of surfaces (surftri)</a> (also subpages).

%K nonn

%O 9,2

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

%E Name corrected by _Allan Bickle_, Mar 16 2023

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 23 12:24 EDT 2024. Contains 376164 sequences. (Running on oeis4.)