Suppose that each side of an equilateral triangle can be partitioned into n partitions, all of which have equal length. From this, you are able to create n^2 equilateral triangles. These are n triangles. From this information, how many DOWNWARD pointing triangles are there in an n triangle?

Apparently its a messy formula.

Any thoughts?