User blog comment:LittlePeng9/Color reducing for Turing machines/@comment-5529393-20130413054452

I think all the n-1's need to be n's. For example, with c = 3, you get n = 2, and you need a length 2 subscript, and need to write and move 2 states. So you would need 2^3 - 1 + 3*2 + 2*2 = 17 states per original state, which leads to 17*45 = 765 states for the Kirby-Paris hydra machine.