Original: In mathematical logic, a Gödel numbering is a function that assigns to each symbol and well-formed formula of some formal language a unique natural number, called its Gödel number.
Simplified: h (s_1) times 22 ^ {(n-1)} + h (s_2) times 22 ^ {(n-2)} + cdots + h (s _ {n-1}) times 22 ^ 1 + h (s_n) times