Integer triangle formula_112 and formula_113 generate the same triple. Unfortunately the two pairs can both be of gcd=3, so we can't avoid duplicates by simply skipping that case. Instead, duplicates can be avoided by formula_27 going only till formula_115. Note that we still need to divide by 3 if gcd=3. The only solution for formula_116 under the above constraints is formula_117 for formula_118. With this additional formula_119 constraint all triples can be generated uniquely. An Eisenstein triple is a set of integers which are the lengths of the sides of a triangle where one of the angles is 60 degrees. Integer triangles
Leibniz harmonic triangle formula_4 Whereformula_5is a binomial coefficient Whereas each entry in Pascal's triangle is the sum of the two entries in the above row, each entry in the Leibniz triangle is the sum of the two entries in the row "below" it. For example, in the 5th row, the entry (1/30) is the sum of the two (1/60)s in the 6th row. Just as Pascal's triangle can be computed by using binomial coefficients, so can Leibniz's: formula_6. Furthermore, the entries of this triangle can be computed from Pascal's: "The terms in each row are the initial term divided by the corresponding Pascal