OFFSET
6,4
COMMENTS
From Brahadeesh Sankarnarayanan, Jan 20 2026: (Start)
Here, the 1-skeleton of the triangulation is a simple graph. For triangulations by multigraphs with loops, see A003051.
By Euler's formula, any triangulation of S_1 with minimum degree 6 is in fact 6-regular. (End)
LINKS
Ulrich Brehm and Wolfgang Kuhnel, Equivelar maps on the torus, Eur. J. Comb. 29 (2008) 1843-1861.
M. Jungerman and G. Ringel, Minimal triangulations on orientable surfaces, Acta Math. 145 (1980), 121-154.
Thom Sulanke, Generating triangulations of surfaces (surftri), (also subpages).
Thom Sulanke and Frank H. Lutz, Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds, Eur. J. Comb. 30 (2009) 1965--1979; see also arXiv:math/0610022 [math.CO], 2006-2007.
FORMULA
MATHEMATICA
T2[n_] := Piecewise[{{DivisorSigma[0, n] - 2 - T6[n], Mod[n, 2] == 1}, {DivisorSigma[0, n/2] - 2, Mod[n, 4] == 2}}, DivisorSigma[0, n/2] + DivisorSigma[0, n/4] - 4 - T6[n]];
T3[n_] := Length[{ToRules[Reduce[n == p^2 + p q + q^2 && 0 < q < p, {p, q}, Integers]]}];
T6[n_] := Boole[n >= 9 && (IntegerQ[Sqrt[n]] || IntegerQ[Sqrt[n/3]])]
T[n_] := Piecewise[{{DivisorSigma[1, n]/6 + T2[n]/2 + 2/3 T3[n] +
5/6 T6[n] - (2 - Mod[n, 2]), n > 6}}];
Table[T[n], {n, 7, 100}] (* Eric W. Weisstein after Brehm and Kuhnel, Aug 30 2018 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, May 12 2007
EXTENSIONS
Terms a(18) and beyond from Thom Sulanke added by Ed Pegg Jr, Aug 30 2018
STATUS
approved
