|
%I #13 Mar 24 2019 14:38:22
%S 6,16,16,22,56,34,176,76,62,208,62,208,68,768,104,88,106,224,146,134,
%T 226,172,132,4432,206,232,378,206,432,380,208,290,1336,224,280,1152,
%U 336,210,1190,356,386,292,254,806,324,362,278,316,610,1968,710,628,10434
%N Consider Post's tag system applied to the word (100)^n; a(n) = length of the longest word in the orbit, or -1 if the orbit is unbounded.
%H Lars Blomberg, <a href="/A291795/b291795.txt">Table of n, a(n) for n = 1..6075</a>
%H Peter R. J. Asveld, <a href="http://doc.utwente.nl/66184/1/1988m20.pdf">On a Post's System of Tag</a>. Bulletin of the EATCS 36 (1988), 96-102.
%Y Cf. A284116 and the cross-references there.
%K nonn
%O 1,1
%A _N. J. A. Sloane_, Sep 04 2017
%E a(33) and beyond from _Lars Blomberg_, Apr 19 2018
|
