BB(n,1)

BB(n,1) is the Busy Beaver problem for n-state, 1-symbol TMs. It is trivial that Σ(n,1) = 0, as 1-symbol TMs cannot print any non-zero symbols. As any transition back to an already visited state will put the machine in an infinite loop, the most effective halting strategy is to pass through the states one by one, halting only in the final state, thus making BB(n,1) = n.