Busy Beaver sequence, or Rado's sigma function: maximal number of 1's that an n-state Turing machine can print on an initially blank tape before halting.
A028444
Busy Beaver sequence, or Rado's sigma function: maximal number of 1's that an n-state Turing machine can print on an initially blank tape before halting.
Terms
- a(0) =0a(1) =1a(2) =4a(3) =6a(4) =13a(5) =4098
External references
- oeis: A028444