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.

A119683 Maximal number of steps that an n-state Turing machine can make which was started on an initially blank tape before halting on the blank tape again.

This page as a plain text file.
%I A119683 #1 Sep 29 2006 03:00:00
%S A119683 1,4,12,34
%N A119683 Maximal number of steps that an n-state Turing machine can make which was started on an initially blank tape before halting on the blank tape again.
%Y A119683 Cf. A060843, A028444.
%K A119683 hard,nonn
%O A119683 1,2
%A A119683 Christian Hercher (ch(AT)wurzel.org), Jun 08 2006

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

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