Busy 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.

A060843

Busy 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.

Terms

    a(0) =1a(1) =6a(2) =21a(3) =107a(4) =47176870

External references