What is the explicit formula for the sequence representing the number of any triangles in a triangular grid, like those below?
Counting only up-facing triangles of size one, we get triangular numbers.
Counting both up-facing and down-facing triangles of size one, we get square numbers (that is, perfect squares)
But what is the total number of all triangles of any size? Here are some values for small $n$.