login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A291802
Take n-th word over {1,2} listed in A291797 and apply the Post tag system described in A284116 (but adapted to the alphabet {1,2}); a(n) = position of the longest word in the orbit, or -1 if the orbit is unbounded.
2
0, 3, 0, 0, 16, 14, 0, 0, 0, 13, 15, 11, 23, 9, 0, 18, 0, 22, 20, 0, 12, 8, 24, 10, 20, 18, 2, 6, 106, 16, 0, 23, 27, 0, 0, 0, 27, 5, 25, 0, 0, 105, 3, 103, 37, 15, 1, 1, 107, 17, 19, 101, 9, 99, 2, 35, 7, 7, 31, 13, 71, 97, 0, 0, 0, 0, 0, 22, 0, 34, 0, 0, 0
OFFSET
1,2
COMMENTS
Post's tag system maps a word w over {1,2} to w', where if w begins with 1, w' is obtained by appending 11 to w and deleting the first three letters, or if w begins with 2, w' is obtained by appending 2212 to w and deleting the first three letters.
We work over {1,2} rather than the official alphabet {0,1} because of the prohibition in the OEIS of terms (other than 0 itself) which begin with 0.
This is an analog of A291796 for the words in A291797.
LINKS
Lars Blomberg, Table of n, a(n) for n = 1..8190 (For terms in A291797 up to length 36.)
Peter R. J. Asveld, On a Post's System of Tag. Bulletin of the EATCS 36 (1988), 96-102. See Table 3.
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Sep 04 2017
EXTENSIONS
a(31)-a(73) from Lars Blomberg, Sep 08 2017
STATUS
approved