A131957 Busy Beaver sigma variation: maximum number of 1's on the final tape, for a 2-state, 2-symbol Turing machine running on a tape which is initialized with the number n in binary and 0's everywhere else. The machine is started at the right-most bit in the number n.

4, 4, 4, 5, 6, 6, 5, 6, 5, 6, 6, 7, 6, 7, 6, 7, 6, 7, 6, 6, 8, 8, 7, 8, 6, 7, 7, 8, 7, 8, 7, 8, 7, 8, 6, 8, 7, 7, 7, 7, 6, 8, 8, 9, 8, 9, 8, 10, 7, 8, 7, 7, 7, 9, 8, 9, 7, 8, 8, 9, 8, 9, 8, 9, 8, 9, 8, 8, 8, 7, 8, 10, 8, 7, 7, 8, 8, 8, 7, 8, 8, 8, 7, 10, 10, 10, 9, 10, 8, 10, 10, 10, 10, 10, 9, 12, 8, 9, 7, 9