3 problems

Let ${}^dt_m$ denote the relevant column-sequence count for integer tetrahedra, and let $a_k$ be defined by … where $b_0=96$ and, for $k\geq1$, $b_k$ is given by the residue-class…

Let $T_n$ be the set of graphs corresponding to integer tetrahedra of perimeter $n$. Graph-count asymptotic conjecture. The cardinality of $T_n$ satisfies … This is presented as an…

Let $\tn$ denote the number of integer tetrahedra of perimeter $n$, counted up to congruence. Asymptotic enumeration conjecture. The number $\tn$ satisfies … This conjecture is mot…