Let $a_n$ be a sequence defined by some $a_0$ and the recursion $a_{n+1} = a_n + 2 \cdot  3^n$ for $n \ge 0$. 
Determine all rational values of $a_0$ such that $a^j_k / a^k_j$ is an integer for all integers $j$ and $k$ with $0 < j < k$.
1. **Define the sequence and find the general form:**
   Given the sequence \(a_n\) defined by \(a_{n+1} = a_n + 2 \cdot 3^n\) with some initial value \(a_0\), we need to find the general form of \(a_n\).

   We start by iterating the recurrence relation:
   \[
   \begin{aligned}
   a_1 &= a_0 + 2 \cdot 3^0 = a_0 + 2, \\
   a_2 &= a_1 + 2 \cdot 3^1 = (a_0 + 2) + 6 = a_0 + 8, \\
   a_3 &= a_2 + 2 \cdot 3^2 = (a_0 + 8) + 18 = a_0 + 26.
   \end{aligned}
   \]
   Observing the pattern, we can generalize:
   \[
   a_n = a_0 + 2 \sum_{i=0}^{n-1} 3^i.
   \]
   Using the formula for the sum of a geometric series, \(\sum_{i=0}^{n-1} 3^i = \frac{3^n - 1}{2}\), we get:
   \[
   a_n = a_0 + 2 \cdot \frac{3^n - 1}{2} = a_0 + 3^n - 1.
   \]

2. **Express the condition in terms of \(a_0\):**
   We need to determine all rational values of \(a_0\) such that \(\frac{a_k^j}{a_j^k}\) is an integer for all integers \(0 < j < k\).

   Given \(a_n = a_0 + 3^n - 1\), we have:
   \[
   \frac{a_k^j}{a_j^k} = \frac{(a_0 + 3^k - 1)^j}{(a_0 + 3^j - 1)^k}.
   \]

3. **Simplify the condition:**
   Suppose \(a_0 = \frac{m}{n}\) for some integers \(m, n\) such that \(\gcd(m, n) = 1\) and \(n > 0\). Then:
   \[
   \frac{a_k^j}{a_j^k} = \frac{\left(\frac{m}{n} + 3^k - 1\right)^j}{\left(\frac{m}{n} + 3^j - 1\right)^k} = n^{k-j} \cdot \frac{(m + n(3^k - 1))^j}{(m + n(3^j - 1))^k}.
   \]
   For this to be an integer, we need:
   \[
   (m + n(3^j - 1))^k \mid (m + n(3^k - 1))^j \quad \forall \ 0 < j < k.
   \]

4. **Analyze the divisibility condition:**
   This implies:
   \[
   m + n(3^j - 1) \mid m + n(3^k - 1) \quad \forall \ 0 < j < k.
   \]
   Therefore:
   \[
   m + n(3^j - 1) \mid n(3^k - 3^j) \quad \forall \ 0 < j < k.
   \]

5. **Test specific values:**
   For \((k, j) = (2, 1)\) and \((k, j) = (3, 2)\), we get:
   \[
   \begin{aligned}
   m + 2n &\mid 6, \\
   m + 8n &\mid 18.
   \end{aligned}
   \]

6. **Solve the system of divisibility conditions:**
   Considering \(\gcd(m, n) = 1\) and \(n > 0\), we test possible values:
   - If \(n = 1\), then \(m + 2 \mid 6\) and \(m + 8 \mid 18\). The possible values for \(m\) are:
     \[
     \begin{aligned}
     m + 2 &= 1, 2, 3, 6 \implies m = -1, 0, 1, 4, \\
     m + 8 &= 1, 2, 3, 6, 9, 18 \implies m = -7, -6, -5, -2, 1, 10.
     \end{aligned}
     \]
     The common value is \(m = 1\).

   - If \(n = 1\), then \(a_0 = 1\).

7. **Verify the solution:**
   For \(a_0 = 1\), we have \(a_n = 3^n\). The condition \(\frac{a_k^j}{a_j^k}\) being an integer holds true for all \(0 < j < k\).

   For \(a_0 = -5\), we have \(a_n = 3^n - 6\). The condition fails for \(k = 6\) and \(j = 5\).

Thus, the only rational value of \(a_0\) that satisfies the condition is \(a_0 = 1\).

The final answer is \(\boxed{a_0 = 1}\)