|
%I #13 Mar 29 2019 01:25:03
%S 3,14,9,16,97,34,1293,400,91,1734,49,1532,51,18168,271,78,395,674,265,
%T 260,2701,1068,143,935110,2949,1664,2781,2874,9883,3186,1313,996,
%U 109875,406,5949,57480,15941,258,32359,4712,1223,2424,469,35722,1481,1508,395,662
%N Consider Post's tag system applied to the word (100)^n; a(n) = position of the longest word in the orbit, or -1 if the orbit is unbounded.
%H Lars Blomberg, <a href="/A291796/b291796.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
|
