Busy Beaver problem: a(n) = maximal number of steps that an n-state Turing machine can make on an initially blank tape before eventually halting.
1, 6, 21, 10
4 seqfan posts
Fri Sep 30 20:25:14 CEST 2011 [seqfan] Re: easy and bref
Fri Sep 30 19:39:12 CEST 2011 [seqfan] Re: easy and bref
Fri Sep 30 19:31:31 CEST 2011 [seqfan] Re: easy and bref
Fri Nov 12 06:05:07 CET 2010 [seqfan] Broken links
Index of A-numbers in seqfan: by ascending order
by month
by frequency
by keyword
Links to OEIS content are included according to
The OEIS End-User License Agreement
.