Special right triangle than 256: Isosceles right-angled triangles cannot have sides with integer values, because the ratio of the hypotenuse to either other side is , but cannot be expressed as a ratio of two integers. However, infinitely many "almost-isosceles" right triangles do exist. These are right-angled triangles with integral sides for which the lengths of the non-hypotenuse edges differ by one. Such almost-isosceles right-angled triangles can be obtained recursively, "a" is length of hypotenuse, "n" = 1, 2, 3, ... Equivalently, where {"x", "y"} are the solutions to the Pell equation , with the hypotenuse "y" being the odd terms of the
Floyd's triangle Floyd's triangle Floyd's triangle is a right-angled triangular array of natural numbers, used in computer science education. It is named after Robert Floyd. It is defined by filling the rows of the triangle with consecutive numbers, starting with a 1 in the top left corner: Beginning programmers are often assigned the task of writing a program to print out the table in the format shown. The numbers along the left edge of the triangle are the lazy caterer's sequence and the numbers along the right edge are the triangular numbers. The "n"th row sums to "n"("n" + 1)/2, the constant