it might take O(2^n) more bits to describe BB(2^n+1) as well, but I wasn’t sure so I used BB(2^(n+1)) in my example instead.
You can find it by emulating the Busy Beaver.
You can find it by emulating the Busy Beaver.