Designing a Turing Machine for $f(n) = 4⌊(1/4)n⌋ +1$

Question

Design a Turing Machine to construct the function f(n) = 4⌊(1/4)n⌋ + 1, (that is, 1 more than 4× the integer part of (1/4)n) for n ∈ N

Am I wrong in assuming that the machine in the end will just add 1 to the original? If I am (which is very likely):

Am I wrong in assuming that I can just construct the desired TM by just adding the required functions? I.e. TM that quarters n. Then add TM that multiplies by 4. Then add TM that adds 1.

Any help appreciated.