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!)
A129039 Number of n-node triangulations of the triple torus S_3 in which every node has degree >= 4. 0

%I #6 Mar 12 2023 17:11:18

%S 0,20,65546,23650152

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

%D M. Jungerman and G. Ringel, Minimal triangulations on orientable surfaces, Acta Math. 145 (1980), 121-154.

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

%K nonn

%O 9,2

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

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 16 16:01 EDT 2024. Contains 371749 sequences. (Running on oeis4.)