How would a Turing Machine recognize n consecutive characters
What answer I came up with would be this. We would use a TM with 2 tapes, t1, t2 and 2 headers h1, h2.


P0. Scan the first tape with the input, if a character ∉ {a, b}
REJECT. 
P1. Write "#" and n character of "1" on t2, the head remaining
in the right extremity. 
P2. Read characters on t1 and while they are "a" repeat P3, P4.    
P3. Move h1 to the right
P4. Read the character on t2 and if it's "1" move h2 to the left, if it's "#" move h2 to the right extremity. 
P5. If the read character on t1 is "b" repeat P6
P6. Read the character on t2, if it's "1" move h2 to the right extremity, if it's "#" ACCEPT
P7. Getting at the end and not accepting means we REJECT


I had no example so I am not sure this is 100% correct but it's what I came up with after few hours of thinking. Hope it helps someone and please correct me if it's wrong.