cp's OEIS Frontend

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.

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.

Table of values

n a(n)
0 6
1 7
2 9
3 9
4 9
5 14
6 9
7 13
8 13
9 11
10 13
11 14
12 9
13 14
14 11
15 17
16 15
17 18
18 9
19 11
20 11
21 22
22 24
23 23
24 13
25 11
26 13
27 15
28 10
29 14
30 14
31 21
32 18
33 15
34 17
35 14
36 10
37 14
38 9
39 13
40 21
41 18
42 20
43 20
44 22
45 37
46 39
47 38
48 15
49 18
50 10
51 11
52 14
53 22
54 24
55 23
56 13
57 11
58 13
59 16
60 13
61 16
62 17
63 25
64 21
65 22
66 15
67 16
68 13
69 26
70 28
71 25
72 15

List of values

[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, 11, 13, 15, 10, 14, 14, 21, 18, 15, 17, 14, 10, 14, 9, 13, 21, 18, 20, 20, 22, 37, 39, 38, 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]