For $n = 3$, there are 16 good lists, so $G ( 3 ) = 16$. List all of them, starting with good lists with $t ( 1 ) = 1$, then good lists with $t ( 1 ) = 2$, and then good lists with $t ( 1 ) = 3$.
For $n = 3$, there are 16 good lists, so $G ( 3 ) = 16$. List all of them, starting with good lists with $t ( 1 ) = 1$, then good lists with $t ( 1 ) = 2$, and then good lists with $t ( 1 ) = 3$.