MathNet 2012 Question 39

You are given two line segments of length $2^{n}$ for each integer $0 \leq n \leq 10$. How many distinct nondegenerate triangles can you form with three of the segments? Two triangles are considered distinct if they are not congruent.