47176870domain: NAppears in sequencesBusy Beaver problem: a(n) is the maximal number of steps that an n-state Turing machine can make on an initially blank tape before eventually halting.at n=4A060843