Integer triangle side of the formula are integers it follows that all integer triangles must have an integer value of "16T" and "T" will be rational. By the law of cosines, every angle of an integer triangle has a rational cosine. If the angles of any triangle form an arithmetic progression then one of its angles must be 60°. For integer triangles the remaining angles must also have rational cosines and a method of generating such triangles is given below. However, apart from the trivial case of an equilateral triangle there are no integer triangles whose angles form either a geometric or
Sierpinski triangle the Sierpinski triangle. The Sierpinski triangle may be constructed from an equilateral triangle by repeated removal of triangular subsets: Each removed triangle (a "trema") is topologically an open set. This process of recursively removing triangles is an example of a finite subdivision rule. The same sequence of shapes, converging to the Sierpinski triangle, can alternatively be generated by the following steps: Note that this infinite process is not dependent upon the starting shape being a triangle—it is just clearer that way. The first few steps starting, for example, from a square also tend towards a Sierpinski triangle. Michael Barnsley used