A291795 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.
6, 16, 16, 22, 56, 34, 176, 76, 62, 208, 62, 208, 68, 768, 104, 88, 106, 224, 146, 134, 226, 172, 132, 4432, 206, 232, 378, 206, 432, 380, 208, 290, 1336, 224, 280, 1152, 336, 210, 1190, 356, 386, 292, 254, 806, 324, 362, 278, 316, 610, 1968, 710, 628, 10434
Offset: 1
Keywords
Links
- Lars Blomberg, Table of n, a(n) for n = 1..6075
- Peter R. J. Asveld, On a Post's System of Tag. Bulletin of the EATCS 36 (1988), 96-102.
Crossrefs
Cf. A284116 and the cross-references there.
Extensions
a(33) and beyond from Lars Blomberg, Apr 19 2018