The sequence reconstruction problem was proposed by Levenshtein in 2001. In this model, a sequence from a code is transmitted over several channels, and the decoder receives the distinct outputs from each channel. The main problem is to determine the minimum number of channels required to reconstruct the transmitted sequence. In the combinatorial context, the sequence reconstruction problem is equivalent to finding the value of $N_q(n,d,t)$, defined as the size of the largest intersection of two metric balls of radius $t$, where the distance between their centers is at least $d$ and the sequences are $q$-ary sequences of the length $n$. Levenshtein first discussed this problem in the uncoded sequence setting and determined the value of $N_q(n,1,t)$ for any $n\geqslant t$. Moreover, Gabrys and Yaakobi studied this problem in the context of binary one-deletion-correcting codes and determined the value of $N_2(n,2,t)$ for $t\geqslant 2$. In this paper we study this problem for $3$-ary sequences of length $n$ over the deletion channel, where the transmitted sequence belongs to a one-deletion-correcting code and there are $t$ deletions in every channel. Specifically, we determine $N_3(n,2,t)$ for $t\geqslant 2$.