  We consider incomplete tilings of the equilateral triangle of edge length n
that is subdivided into n^2 regular equilateral smaller unit triangles. Pairs
of the unit triangles that share a side may be converted into lozenges, leaving
some subset of the unit triangles untouched. We count numerically these
coverings by lozenges and unit triangles for edge lengths n <= 6: the total and
the detailed refinement as a function of the number of lozenges.
