"2n--->n(n+1)(4n+1)/2

2n+1->(n+1)(4n2+7n+2)/2
which gives:
1---->1
2---->5
3---->13
4---->27
5---->48
6---->78
7---->118
8---->170
Maybe less elegant that Robbert Van Der Kruk
email: takelion@yahoo.com.sg
I looked by recurrence at how many triangles are added when moving from k to k+1 "floors",
where the "floors" are added below. Let S(n) be the number of triangle for n "floors":
S(n)=S(n-1)
+1+2+...+n <--- these are the triangles pointing up
+ (if n even) 1+2+...+n/2 +1+2+...+(n/2-1) <--- pointing down
+ (if n odd) 2(1+...+(n-1)/2) <--- pointing down
S(n)=S(n-1) + (n even) n(3n+2)/4 + (n odd) (n-1)(n+1)/4
where S(0)=0 and S(1)=1
By recurrence, knowing that 1+2+...+k=k(k+1)/2 and 1+4+9+...+k2=k(k+1)(2k+1)/6, one may
find the formulas of the top of this post:
S(2n)=n(n+1)(4n+1)/2
S(2n+1)=(n+1)(4n2+7n+2)/2."