Why are there $(2kn+1)^{kn}$ Turing Machines with $k$ symbols and $n$ states?
Perhaps they are counting the number of Turing machines with at most $n$ states. In any case, it's not a big difference. Usually one is only interested in an upper bound, and from that perspective there is no difference between the two expressions.