Sure, I’m just referring to the fact that there doesn’t seem to be a widespread standard on what “Busy Beaver” refers to in the literature. Scott Aaronson tends to reference the shift function, but older papers consider Σ as the “Busy Beaver function” or the “ones function” as you point out. My number came from running the machine itself and considering the largest contiguous section of output (since you typically start with a tape consisting of infinite zeros).

If we think of the nth prime as the output of a Turing machine that computes the prime numbers where n is on the input tape, then if people are saying the output aloud of such a machine, it would make sense to do so similarly here as well.

Ultimately, it doesn’t really matter. All these functions basically grow at the same rate asymptotically.