User blog:Alemagno12/How strong is this function?

Let f(n) be the length of the largest string that satisfies the following conditions: I believe f(n) has tetrational growth rate, but I'm not sure.
 * The string can have at most n types of characters
 * No substring in the string appears inmediately before a copy of itself