This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A081419 #4 Sep 29 2006 03:00:00 %S A081419 0,1,2,3,4,6,9,34,520 %N A081419 Largest value held in any register at the end of a halting computation by an n-instruction register Minski machine. %C A081419 We start with initially empty registers and include exactly one Halt instruction. Analogous to the Busy Beaver function, Sigma, for Turing Machines. %C A081419 n<=5 are proved. 5<n<=9 are good lower bounds. %D A081419 Tibor Rado, On Noncomputable Functions, Bell System Technical Journal, vol. 41, # 3, 877-884, May 1963. %F A081419 Noncomputable. %e A081419 E.g. B(3) is of the form: %e A081419 1: A+ -> 2 %e A081419 2: A+ -> 3 %e A081419 3: Halt %e A081419 Halting with B(3)=2 %Y A081419 Cf. A028444. %K A081419 hard,nice,nonn %O A081419 1,3 %A A081419 Rick J. Griffiths (rjg42(AT)cam.ac.uk), Apr 20 2003