Consider the above triangular lattice of points. Find the number of distinct triangles of any size that can be formed in this lattice.
For extra credit, generalize this for an triangular lattice.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
I found the terms here , for the number of triangles on a triangular lattice. The generalized formula I found was 2 1 ( n 2 + n + 2 ) ( 4 n + 2 ) − 2 3 ∑ k = 2 n ∑ m = 2 k ( n − k + 1 ) ( n − k + 2 ) g cd ( k − 1 , m − 1 ) .