login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

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

%I #9 Mar 13 2023 09:14:57

%S 0,20,63148,18883616

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

%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="http://hep.physics.indiana.edu/~tsulanke/graphs/surftri/">Generating triangulations of surfaces (surftri)</a>, (also subpages).

%K nonn,more

%O 9,2

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