Question 68
Each side of an equilateral triangle is divided into $n$ equal parts. Lines parallel to the sides of the triangle are drawn through these points, dividing the triangle into $n^{2}$ smaller triangles. We say that a sequence of distinct triangles is a chain if two successive triangles share a common side. What is the largest possible number of triangles in a chain?