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 A131956 #11 Feb 16 2025 08:33:06 %S A131956 6,7,9,9,9,14,9,13,13,11,13,14,9,14,11,17,15,18,9,11,11,22,24,23,13, %T A131956 11,13,15,10,14,14,21,18,15,17,14,10,14,9,13,21,18,20,20,22,37,39,38, %U A131956 15,18,10,11,14,22,24,23,13,11,13,16,13,16,17,25,21,22,15,16,13,26,28,25,15 %N A131956 Busy Beaver variation: maximum number of steps for a 2-state, 2-symbol Turing machine running on a tape which is initialized with the number n in binary and 0's everywhere else. The machine is started at the rightmost bit in the number n. %H A131956 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BusyBeaver.html">Busy Beaver</a>. %e A131956 a(5) is the maximum number of steps running on a tape which is initialized as: %e A131956 ..000001010000.... with the machine starting at the rightmost 1. %e A131956 a(5) = 14, with the machine: %e A131956 A0-> 0*L %e A131956 A1-> 0BR %e A131956 B0-> 1BL %e A131956 B1-> 1AR %Y A131956 Cf. A060843. %K A131956 nonn %O A131956 0,1 %A A131956 Bryan Jacobs (bryanjj(AT)gmail.com), Aug 01 2007