Let $ABC$ be a triangle and $n$ a positive integer. Consider on the side $BC$ the points $A_1, A_2, ..., A_{2^n-1}$ that divide the side into  $2^n$ equal parts, that is, $BA_1=A_1A_2=...=A_{2^n-2}A_{2^n-1}=A_{2^n-1}C$. Set the points $B_1, B_2, ..., B_{2^n-1}$ and $C_1, C_2, ..., C_{2^n-1}$ on the sides $CA$ and $AB$, respectively, analogously. Draw the line segments $AA_1, AA_2, ..., AA_{2^n-1}$, $BB_1, BB_2, ..., BB_{2^n-1}$ and $CC_1, CC_2, ..., CC_{2^n-1}$. Find, in terms of $n$, the number of regions into which the triangle is divided.

1. **Divide the sides of the triangle:**
   - Consider the triangle \(ABC\).
   - Divide side \(BC\) into \(2^n\) equal parts, creating points \(A_1, A_2, \ldots, A_{2^n-1}\).
   - Similarly, divide side \(CA\) into \(2^n\) equal parts, creating points \(B_1, B_2, \ldots, B_{2^n-1}\).
   - Divide side \(AB\) into \(2^n\) equal parts, creating points \(C_1, C_2, \ldots, C_{2^n-1}\).

2. **Draw the cevians:**
   - Draw the cevians \(AA_1, AA_2, \ldots, AA_{2^n-1}\).
   - Draw the cevians \(BB_1, BB_2, \ldots, BB_{2^n-1}\).
   - Draw the cevians \(CC_1, CC_2, \ldots, CC_{2^n-1}\).

3. **Count the number of regions:**
   - To find the number of regions, we need to determine the number of points inside the triangle where three cevians intersect.
   - Let \(Z\) be the number of such triple intersection points.

4. **Calculate the number of triple intersections:**
   - Each median is cut at \(2^n - 1\) places by other cevians.
   - By Ceva's theorem, each of these points is a triple intersection.
   - Therefore, there are \(3(2^n - 1)\) triple intersections on the medians.
   - The centroid is counted thrice, so we subtract 2 from the total count.
   - Thus, the number of triple intersections is \(3(2^n - 1) - 2 = 3 \cdot 2^n - 5\).

5. **Verify there are no other triple intersections:**
   - Suppose three cevians \(\overline{AA_i}\), \(\overline{BB_j}\), \(\overline{CC_k}\) are concurrent.
   - Let the cevians divide the opposite sides in the ratios \(\frac{a_1}{a_2}\), \(\frac{b_1}{b_2}\), \(\frac{c_1}{c_2}\) respectively, where each fraction is in lowest terms.
   - The numbers \(a_1, a_2, b_1, b_2, c_1, c_2\) are odd, and \(a_1 + a_2, b_1 + b_2, c_1 + c_2\) are powers of two.
   - By Ceva's theorem, \(\frac{a_1}{a_2} \cdot \frac{b_1}{b_2} \cdot \frac{c_1}{c_2} = 1\).

6. **Use modulo 4 to find contradictions:**
   - If \(x\) and \(y\) are positive odd integers with \(x + y \ge 4\) a power of two, then \(\frac{x}{y} \equiv -1 \pmod{4}\).
   - This is not true when \(x + y = 2\), i.e., \(x = y = 1\), as \(\frac{1}{1} \equiv 1 \pmod{4}\).
   - If none of the three cevians is a median, then \(a_1 + a_2, b_1 + b_2, c_1 + c_2 \ge 4\).
   - Thus, \(1 = \frac{a_1}{a_2} \cdot \frac{b_1}{b_2} \cdot \frac{c_1}{c_2} \equiv (-1) \cdot (-1) \cdot (-1) = -1 \pmod{4}\), a contradiction.
   - Therefore, one of the three cevians must be a median.

7. **Calculate the total number of regions:**
   - The total number of regions is given by:
     \[
     3 \cdot 2^{2n} - 3 \cdot 2^n + 1 - Z
     \]
   - Substituting \(Z = 3 \cdot 2^n - 5\), we get:
     \[
     3 \cdot 2^{2n} - 3 \cdot 2^n + 1 - (3 \cdot 2^n - 5) = 3 \cdot 2^{2n} - 6 \cdot 2^n + 6
     \]

The final answer is \(\boxed{3 \cdot 2^{2n} - 6 \cdot 2^n + 6}\)