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.

A131957 Busy Beaver sigma variation: maximum number of 1's on the final tape, 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 4
1 4
2 4
3 5
4 6
5 6
6 5
7 6
8 5
9 6
10 6
11 7
12 6
13 7
14 6
15 7
16 6
17 7
18 6
19 6
20 8
21 8
22 7
23 8
24 6
25 7
26 7
27 8
28 7
29 8
30 7
31 8
32 7
33 8
34 6
35 8
36 7
37 7
38 7
39 7
40 6
41 8
42 8
43 9
44 8
45 9
46 8
47 10
48 7
49 8
50 7
51 7
52 7
53 9
54 8
55 9
56 7
57 8
58 8
59 9
60 8
61 9
62 8
63 9
64 8
65 9
66 8
67 8
68 8
69 7
70 8
71 10
72 8
73 7
74 7
75 8
76 8
77 8
78 7
79 8
80 8
81 8
82 7
83 10
84 10
85 10
86 9
87 10
88 8
89 10
90 10
91 10
92 10
93 10
94 9
95 12
96 8
97 9
98 7
99 9

List of values

[4, 4, 4, 5, 6, 6, 5, 6, 5, 6, 6, 7, 6, 7, 6, 7, 6, 7, 6, 6, 8, 8, 7, 8, 6, 7, 7, 8, 7, 8, 7, 8, 7, 8, 6, 8, 7, 7, 7, 7, 6, 8, 8, 9, 8, 9, 8, 10, 7, 8, 7, 7, 7, 9, 8, 9, 7, 8, 8, 9, 8, 9, 8, 9, 8, 9, 8, 8, 8, 7, 8, 10, 8, 7, 7, 8, 8, 8, 7, 8, 8, 8, 7, 10, 10, 10, 9, 10, 8, 10, 10, 10, 10, 10, 9, 12, 8, 9, 7, 9]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.