Hacker News new | ask | show | jobs
by rckoepke 1227 days ago
I believe the answer is:

(n+1)!/((k+1)!*(n-k)!) where n=768 and k=2

Or about 75.5 million triangular faces. Which explains a lot. Thanks for that.