  Simon's congruence, denoted \sim_n, relates words having the same subwords of
length up to n. We show that, over a k-letter alphabet, the number of words
modulo \sim_n is in 2^{\Theta(n^{k-1} log n)}.
