$ (a_n)_{n \equal{} 0}^\infty$ is a sequence on integers. For every $ n \ge 0$, $ a_{n \plus{} 1} \equal{} a_n^3 \plus{} a_n^2$. The number of distinct residues of $ a_i$ in $ \pmod {11}$ can be at most?

$\textbf{(A)}\ 2  \qquad\textbf{(B)}\ 3  \qquad\textbf{(C)}\ 4  \qquad\textbf{(D)}\ 5  \qquad\textbf{(E)}\ 6$
Given the sequence \( (a_n)_{n=0}^\infty \) defined by \( a_{n+1} = a_n^3 + a_n^2 \), we need to determine the maximum number of distinct residues of \( a_i \) modulo 11.

1. **List all possible residues modulo 11:**
   \[
   0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 \pmod{11}
   \]

2. **Calculate the squares of these residues modulo 11:**
   \[
   \begin{aligned}
   0^2 &\equiv 0 \pmod{11}, \\
   1^2 &\equiv 1 \pmod{11}, \\
   2^2 &\equiv 4 \pmod{11}, \\
   3^2 &\equiv 9 \pmod{11}, \\
   4^2 &\equiv 16 \equiv 5 \pmod{11}, \\
   5^2 &\equiv 25 \equiv 3 \pmod{11}, \\
   6^2 &\equiv 36 \equiv 3 \pmod{11}, \\
   7^2 &\equiv 49 \equiv 5 \pmod{11}, \\
   8^2 &\equiv 64 \equiv 9 \pmod{11}, \\
   9^2 &\equiv 81 \equiv 4 \pmod{11}, \\
   10^2 &\equiv 100 \equiv 1 \pmod{11}.
   \end{aligned}
   \]

3. **Calculate the cubes of these residues modulo 11:**
   \[
   \begin{aligned}
   0^3 &\equiv 0 \pmod{11}, \\
   1^3 &\equiv 1 \pmod{11}, \\
   2^3 &\equiv 8 \pmod{11}, \\
   3^3 &\equiv 27 \equiv 5 \pmod{11}, \\
   4^3 &\equiv 64 \equiv 9 \pmod{11}, \\
   5^3 &\equiv 125 \equiv 4 \pmod{11}, \\
   6^3 &\equiv 216 \equiv 7 \pmod{11}, \\
   7^3 &\equiv 343 \equiv 2 \pmod{11}, \\
   8^3 &\equiv 512 \equiv 6 \pmod{11}, \\
   9^3 &\equiv 729 \equiv 3 \pmod{11}, \\
   10^3 &\equiv 1000 \equiv 10 \pmod{11}.
   \end{aligned}
   \]

4. **Calculate \( a_n^3 + a_n^2 \) modulo 11 for each residue:**
   \[
   \begin{aligned}
   0^3 + 0^2 &\equiv 0 \pmod{11}, \\
   1^3 + 1^2 &\equiv 2 \pmod{11}, \\
   2^3 + 2^2 &\equiv 8 + 4 \equiv 12 \equiv 1 \pmod{11}, \\
   3^3 + 3^2 &\equiv 5 + 9 \equiv 14 \equiv 3 \pmod{11}, \\
   4^3 + 4^2 &\equiv 9 + 5 \equiv 14 \equiv 3 \pmod{11}, \\
   5^3 + 5^2 &\equiv 4 + 3 \equiv 7 \pmod{11}, \\
   6^3 + 6^2 &\equiv 7 + 3 \equiv 10 \pmod{11}, \\
   7^3 + 7^2 &\equiv 2 + 5 \equiv 7 \pmod{11}, \\
   8^3 + 8^2 &\equiv 6 + 9 \equiv 15 \equiv 4 \pmod{11}, \\
   9^3 + 9^2 &\equiv 3 + 4 \equiv 7 \pmod{11}, \\
   10^3 + 10^2 &\equiv 10 + 1 \equiv 11 \equiv 0 \pmod{11}.
   \end{aligned}
   \]

5. **Analyze the sequence behavior for each initial residue \( a_0 \):**
   - \( a_0 \equiv 0 \pmod{11} \Rightarrow a_{n+1} \equiv 0 \pmod{11} \) (1 distinct residue)
   - \( a_0 \equiv 1 \pmod{11} \Rightarrow a_{n+1} \equiv 2 \pmod{11} \Rightarrow a_{n+2} \equiv 1 \pmod{11} \) (2 distinct residues: 1, 2)
   - \( a_0 \equiv 2 \pmod{11} \Rightarrow a_{n+1} \equiv 1 \pmod{11} \Rightarrow a_{n+2} \equiv 2 \pmod{11} \) (2 distinct residues: 1, 2)
   - \( a_0 \equiv 3 \pmod{11} \Rightarrow a_{n+1} \equiv 3 \pmod{11} \) (1 distinct residue)
   - \( a_0 \equiv 4 \pmod{11} \Rightarrow a_{n+1} \equiv 3 \pmod{11} \Rightarrow a_{n+2} \equiv 3 \pmod{11} \) (2 distinct residues: 3, 4)
   - \( a_0 \equiv 5 \pmod{11} \Rightarrow a_{n+1} \equiv 7 \pmod{11} \Rightarrow a_{n+2} \equiv 7 \pmod{11} \) (2 distinct residues: 5, 7)
   - \( a_0 \equiv 6 \pmod{11} \Rightarrow a_{n+1} \equiv 10 \pmod{11} \Rightarrow a_{n+2} \equiv 0 \pmod{11} \) (3 distinct residues: 6, 10, 0)
   - \( a_0 \equiv 7 \pmod{11} \Rightarrow a_{n+1} \equiv 7 \pmod{11} \) (1 distinct residue)
   - \( a_0 \equiv 8 \pmod{11} \Rightarrow a_{n+1} \equiv 4 \pmod{11} \Rightarrow a_{n+2} \equiv 3 \pmod{11} \) (3 distinct residues: 8, 4, 3)
   - \( a_0 \equiv 9 \pmod{11} \Rightarrow a_{n+1} \equiv 7 \pmod{11} \Rightarrow a_{n+2} \equiv 7 \pmod{11} \) (2 distinct residues: 9, 7)
   - \( a_0 \equiv 10 \pmod{11} \Rightarrow a_{n+1} \equiv 0 \pmod{11} \Rightarrow a_{n+2} \equiv 0 \pmod{11} \) (2 distinct residues: 10, 0)

6. **Conclusion:**
   The maximum number of distinct residues is 3.

The final answer is \(\boxed{3}\)