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

Okay, but you still need 2^{n+1} - 1 states for the reading, since we have a length n subscript. You can improve that to 2^n - 1 + c though.

I guess that means 2^2 - 1 + 3 + 3*1 + 2*1 = 11 states per original states, for 45*11 = 495 total states.