The description given on Wikipedia is adequate for most purposes:
The ternary relation $T_1(e,i,x)$ takes three natural numbers as arguments. The triples of numbers $(e,i,x)$ that belong to the relation (the ones for which $T_1(e,i,x)$ is true) are defined to be exactly the triples in which $x$ encodes a computation history of the computable function with index $e$ when run with input $i$, and the program halts as the last step of this computation history. That is, $T_1$ first asks whether $x$ is the Gödel number of a finite sequence $\langle x_j \rangle$ of complete configurations of the Turing machine with index $e$, running a computation on input $i$. If so, $T_1$ then asks if this sequence begins with the starting state of the computation and each successive element of the sequence corresponds to a single step of the Turing machine. If it does, $T_1$ finally asks whether the sequence $\langle x_j \rangle$ ends with the machine in a halting state. If all three of these questions have a positive answer, then $T_1(e,i,x)$ holds (is true). Otherwise, $T_1(e,i,x)$ does not hold (is false).
A more thorough (but still somewhat informal) discussion is given in Enderton's chapter of the Handbook of Mathematical Logic. Formal details of Gödel coding are given in Smorynski's chapter of the same Handbook. Before embarking on this, Smorynski writes:
The details of an encoding are fascinating to work out and boring to read. The author wrote the present section for his own benefit and his feelings will not be hurt if the reader chooses to skip it.
Wikipedia also gives details on Gödel numbering for sequences.
My recommendation is that you work out your own encoding in full detail. This is a valuable and interesting exercise that is best done in private...