1, 6, 21, 107, … ?
Apparently, this is the busy beaver sequence, described in the fabulous On-Line Encyclopedia of Integer Sequences as:
The maximal number of steps that an n-state Turing machine can make on an initially blank tape before eventually halting.
You can even listen to this sequence if you’re prepared to allow pop-ups and plugins.
Articles