Abstract
In this paper, we introduce a new depicting of the so-called numerical semigroup tree $\mathcal T$. By exploring computationally this improved picture, relying on the type notion of a semigroup, we found that the number of semigroups of genus $g$ and type $t$ is constant when $t$ is close to $g$ while $g$ grows. We also study the unimodularity of various sequences as well as the behavior of the leaves in $\mathcal T$. We put forward several conjectures that are supported by various computational experiments.