Turing machine that can move right only $O(1)$ steps beyond input
Your machine uses $n + k = O(n)$ space. As such, it can be simulated by a linear bounded automaton. The latter is known to be weaker than a general Turing machine. For example, it cannot solve the halting problem for machines using $n^2$ space, a problem that Turing machines are able to solve.