A308174 - OEIS

A308174

Let EM denote the Ehrenfeucht-Mycielski sequence A038219, and let P(n) = [EM(1),...,EM(n)]. To compute EM(n+1) for n>=3, we find the longest suffix S (say) of P(n) which has previously appeared in P(n). Suppose the most recent appearance of S began at index n-t(n). Then a(n) = length of S, while t(n) is given in A308175.

1, 1, 2, 1, 2, 2, 3, 3, 3, 2, 3, 3, 2, 3, 3, 4, 4, 3, 4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 5, 6, 6, 6, 6, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6

(list; graph; refs; listen; history; text; internal format)

OFFSET

3,3

COMMENTS

Then EM(n+1) is the complement of the bit following the most recent appearance of S.

LINKS

Rémy Sigrist, Table of n, a(n) for n = 3..50000

Rémy Sigrist, Perl program for A308174

EXAMPLE

Tableau showing calculation of terms 3 through 13

1 2 3 4 5 6 7 8 9 10 11 12 13 n

0 1 0 0 1 1 0 1 0 1 1 1 0 A038219(n)