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.

A208229 Consider Wolfram's universal 2-state 3-symbol Turing machine on a one-way-infinite tape with all but the first n cells initially blank and the head initially in state 1. a(n) is the maximum number of steps the Turing machine can make before halting.

Table of values

n a(n)
0 3
1 3
2 15
3 19
4 37
5 51
6 69
7 97
8 111
9 161
10 167
11 241
12 247
13 327
14 341
15 435
16 451
17 547
18 571
19 665
20 709
21 801
22 849

List of values

[3, 3, 15, 19, 37, 51, 69, 97, 111, 161, 167, 241, 247, 327, 341, 435, 451, 547, 571, 665, 709, 801, 849]

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

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